I can only make it to 2 rounds. Round 1: 2 DSA questions For each element in an array, find the nearest greater element on the right side of it. Simple use stack traverse from right and each time pop elements from stack which are smaller than it. And the top of the stack is answer to that index. Then add that element to stack too for further elements. 2. Find if we can divide the array into two sub arrays no need to be contiguous or in same order such that sum of the two sub arrays are equal. Simple add all elements and see if thats odd then means impossible so return null. Else just find elements whose sum is equal to (sum of all elements)/2. Round 2: Java based questions: Use stream api to convert 4 chars from each string to upper case in a list of strings. Check a number is even or odd but don't use % opperator or bit wise opperator. We can convert it to string and check if last digit is even or not. What is singleton class ways to create its object. How to pass not fixed no of arguments to a function. At last LRU cache? Which he only don't know and asks unnecessary questions.

3 round of technical round happens. 1st round will be DSA where easy to medium level questions can expect. 2nd round will be on HLD/tech expert deep dive. 3rd round will be a managerial round. You can expect bit technical question and mangerial question. Mostly will check the previous project.