implement the interface: interface SortedList<T>{ /*Get an item from list at index position *params index - index position in array *returns item - if item is found at index position *throws IndexOutOfBoundException - if input index is not within list T get(int index); } Check if an item exists in sortedList. Eg. 1,2,3,4,5,6 ...
Algorithm question (a classical NP problem) that I was able to solve followed by a distributed system debugging question
Pretend that an end user is providing you with input. In this case, it's a math equation, such as (3+2)*4-1. Parse the input and display the answer.
normal BI questions
Based on previous project implementation of Spring Framework , can you customize the transaction processing behavior?
Q. Resume based questions
Basics of Linux,git,puppet/chef,docker,scripting
Given an array (unsorted) numbers how would you find every pair of numbers that add up to a given sum?
How to reverse the bits in a 32 bit word. First question.
1. Core Java 2. Advanced Java 3. Problem Statements and Solutions
Viewing 461 - 470 interview questions