Round 1 - Algo
#1. Find kth bit from last in a given number (bit operation)
#2. Reverse a Linked List
#3. Find Least Common Ancestor in BST
#4. Difference b/w Arrays, ArrayList
#5. Other generic DS based questions

Round 2
#1. Given a buggy C++ BST insertion code using 2 pointers (it was giving some null pointer exception) asked to fix the code and make the insertion working.
#2. Given a python code using some lists manipulation and was asked to give the expected output
#3. Then questions like why are you switching company, what was the complex problem solved in your current networking company, what features you had developed there etc.

Offer accepted.