Skip to content
Related Articles

Related Articles

Oracle Interview Experience | Set 25 (On-Campus)
  • Difficulty Level : Hard
  • Last Updated : 05 Aug, 2016

Round 1
This was an online round.There were three sections :

  1. Aptitude and logic
  2. Data structures(mainly binary tree), OS, DBMS, OOPS.
  3. Data analysis

Online coding round:2 codes:

Code 1: given an array and a player.The player selects elements from array.If the player selects an item with value i the he/she cannot select i+1 or i-1.Find the maximum sum of value the player can select.

I/P : 4 1 2 8
O/P : 14

I/P : 9 7 4 5 6 1 2 3 8
O/P: 25

Code 2: overlapping interval find the interval with less difference.

I/P :
O/P : 2

I/P : none
O/P : 0


  1.  tell me about yourself?
  2. Some questions on c/c++ aptitude? i.e, based on pointer, static variable, recursion
  3. Reverse the words of the string
  4. Write pseudo code for the 4 queen problem for 4*4 chess board
  5. Given tree do all traversal.
  6. Given a big file sort it? Big in the sense doesn’t fit into memory.


  1. Puzzle: You have 10 boxes of balls (each ball weighing exactly10 gm) with one box with defective balls (each one of the defective balls weigh 9 gm). You are given an electronic weighing machine and only one chance at it. How will find out which box has the defective balls?
  2. Puzzle: Pirate one: Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person:  1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?
  3. Check given link list is palindrome or not in O(n) time and O(1) space.
  4. Some 3-4 questions related to sql query.
  5. String related questions


  1. Asked me to explain merge sort and was asked to write complete working code for it.
  2. project related questions


  1. Given a n coordinates find 5 coordinate which will form polygon
  2. Given one array of size of n design 3 stack such no stack could give overflow when there is space available in array.
  3. Design a directory for phone and name.

I didn’t get call for HR. Hope this will help !!

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.   In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :