Round 2 : 1. About STL containers 2. Arrays, Vectors, Difference between the two, Unordered and ordered maps, Complexity of insertion or searching 3. Basic questions about Data structures, Linked list, Structure of a node, Insertion and deletion, Types of linked lists, Insertion of single linked list into a circular linked list by deleting a node, deletion of first node of circular linked list. 4. Difference between binary trees and binary search trees, Which one has less searching time complexity and why? 5. Basic algorithmic concepts, Finding a pair of numbers from array with given sum with linear time complexity, Frequency of particular words in a paragraph, Name string searching algorithms, What is hashing?, Remove dupicates from an array using extra space and without using extra space. 6. Questions about databases, types of databases, indexing and multi-threading in C++.

Round 3 : 1. An array of decreasing numbers is given, find out the rank when given number (query) is pushed into the array, initial array may contain duplicates, elements with same value have same ranks. 2. A 2D array is given, you have to check whether given 2D pattern exists in the former grid.

Round 4 : 1. Discussions on full-time opportunities 2. Questions to him 3. Discussions about work culture, growth and technologies 4. Questions about functional programming and databases 5. Reviews of company and research work (if done) 6. Discussions about relocation, opportunities and challenges

HR Part was just about making the interviewee prepared for the rounds and about other stuffs such as stipend etc.