Oracle Interview Experience | Set 45 (For 3 Years Experienced) Last Updated : 16 May, 2017 Improve Improve Like Article Like Save Share Report Oracle 3 years Java Experienced Kolkata location. I attended 2 rounds. Round 1 List prime factorization of numbers from 1 to 10000 List Armstrong Numbers from 1 to 500 Write 5 features from 5 classes of Collection Framework Find missing number from given Pattern. It was easy but right now I cannot remember the exact pattern Round 2 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; } Listing Contiguous Elements whose sum is maximum in an array contains signed integers 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 … Related Practice Problems Armstrong Numbers Kadane’s Algorithm Like Article Suggest improvement Previous Minimize operations to reduce N to 2 by repeatedly reducing by 3 or dividing by 5 Next Using Chinese Remainder Theorem to Combine Modular equations Share your thoughts in the comments Add Your Comment Please Login to comment...