1st round: 1. Time and Space complexity of all the data structures and algorithms. 2. What is Scaling? What is Vertical and Horizontal Scaling? 3. Questions on Java 8 2nd round: 3 coding questions, I attended only two 1. Balancing brackets like "()[]{}" and "([)]" . Push in stack if open bracker is encountered and pop from Stack if closing bracket is the and match them. https://leetcode.com/problems/valid-parentheses/ 2. Given a linked list, determine if it has a cycle in it https://leetcode.com/problems/linked-list-cycle/
