Skip to content
Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

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

  • Difficulty Level : Easy
  • Last Updated : 16 May, 2017

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

Round 1

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!

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

      Related Practice Problems

      My Personal Notes arrow_drop_up
Recommended Articles
Page :