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
-
Find Middle element in LinkedList contains millions of millions data by traverse only once and without using extra memory space.
JAVA 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 ...