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?
Create a linkedlist structure and write a method to reverse it in place
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?
First round: Your projects, How to dynamically load a class, OOPs concepts, Difference in between Abstract class and Interface, Thread life cycle, Synchronized block and use, Immutable class, Servlet life cycle and how servlet works Second round: First round: Your projects, OOPs concepts, Difference in between Abstract class and Interface, Thread life cycle, String constant pool, What is Immutable class and how to create it, Servlet life cycle and how servlet works, Singleton design pattern, How to handle clone and serialization concepts in Singleton class, Difference in between JSON & XML Techno-managerial round: Your projects, RESTful webservices, Runtime polymorphism
Viewing 511 - 520 interview questions