Interview Experience- Round 1: Explain your micro services project. Why it is good? How to handle failure/ service down? Implement a caching service using java and the runtime memory. Implement an iterator which prints alternate elements. Round 2: Purely java based round. All the aspects of core java was touched in this round. Round 3: Tech arch round. The arch came with a question printed on a paper. The question was ambiguous and hence there doesn’t exist an exact solution but they will expect the same code which they have in their mind. No questions from Data Structures or system design. This round was really a turn off for me.
Java Software Engineer Interview Questions
4,200 java software engineer interview questions shared by candidates
How split method works? is related how to solve the algorithm.
what project have you worked with java ?
On the first interview session there were average Java questions, focused on multithreading and collections (How does HashMap work?). The assessment consisted on 2 problems, one was focused on efficiency, the other was focused on logic. On the last round, the technical interview was more complex, addressing subjects like Java memory.
1. merge 2 sorted Array 2. flatten the array of object type ex: Object[] array = { 1, 2, new Object[]{ 3, 4, new Object[]{ 5 }, 6, 7 } }; o/p: {1,2,3,4,5,6,7} .using stream Api 3. Stock Buy and sell 4.Array with -ve and positive integer.. return pair with max product. 5. LRU cache Impl 6.We have Order class with orderId and OrderTime.. In a function we have startTime and endTime.. we needed to return all the order placed with in that time range[startTime, endTime];
Dynamic Programming on Arrays/Lists. Asked to write a program to find set of array segments(i to j index) whose sum is 0 in an Array without changing the order of elements in the array. Solve in O(n).
please tell us about yourself
Good interview Lots of questions related to java, spring, dbms, etc
Thread safe singleton Convert camel case string to snake case
two sum,three sum,closest sum,merge two sorted linkedlists, and in second round check cyclic dependency in a 2d array its a graph question
Viewing 2611 - 2620 interview questions