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

Oracle 3 years Java Experienced Kolkata location. I attended 2 rounds.

Round 1

1. List prime factorization of numbers from 1 to 10000
2. List Armstrong Numbers from 1 to 500
3. Write 5 features from 5 classes of Collection Framework
4. Find missing number from given Pattern. It was easy but right now I cannot remember the exact pattern

Round 2

1. Find Middle element in LinkedList contains millions of millions data by traverse only once and without using extra memory space.

   
   

   
   
   

   public E getMidElement() {     E header = null;     Iterator<E> increementIterator = linkedList.iterator();     Iterator<E> headerIterator = linkedList.iterator();     int counter = 0;     header = null;     while (increementIterator.hasNext()) {         counter++;         if (counter % 2 == 0)             header = headerIterator.next();         increementIterator.next();     }     if (counter % 2 != 0) {         header = headerIterator.next();     }     return header; }

2. Listing Contiguous Elements whose sum is maximum in an array contains signed integers
3. Print ODD numbers in one thread and EVEN numbers in another thread, but final print will be in normal sequesnce e.g. 1 2 3 4 5 …

If you like neveropen and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the neveropen 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.

Related Practice Problems

Armstrong Numbers

Kadane’s Algorithm

Recommended

Solve DSA problems on GfG Practice.

Solve Problems

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
• DSA in C++
• DSA in Java
• DSA in Python
• DSA in JavaScript