Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Oracle Interview Experience | Set 43 (For 3 Years Experienced)

  • Difficulty Level : Easy
  • Last Updated : 12 Mar, 2017

I attended interview for Java developer for 3 years experience.

First round was written for 40 mint which consist of 30 question. Out of 30, 25 questions were from Java fundamentals and 5 simple aptitude. Do not remember questions exactly but all were simple and easy.

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

After that 2 face to face interviews



1st round face to face
1. They ask tell me about yourself

2. Employee and department table design based on some condition like one employee can belong to more than one department then one employee can belong to one department only like this 5-6 question

3. There is an array [1,2,5,4,8,3] and sum = 7. Find all the sub set array such that sum of elements is 7
Example [1+2+4]=7, [2+5]=7, [4+3]=7

4 There are two array array1 = [a, f, h, k, m, o, s, r …….. and so on], array2 = [h, k, m. o]. Check that array1 contain array2 or not

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. 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

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!