Technical Interviews: 1. Print singly linklist in reverse order. 2. Reverse singly link list. 3. Find duplicate in an array. 4. Rinding common ancestor of two nodes in a bst. 5. Given address of any node in a singly linklist and head node was not known. We have to delete that node. 6. Discussion on projects. 7. Finding if some tree is bst or not. HR round: 1. Tell me about yourself. 2. Why we should hire you. 3. Some questions on project.