Online Test:

• MCQs on almost all topics (DS, Algo, C, C++, OS, DBMS, Quant, Verbal)
• 2 coding problems:
  1. Rat in a maze (Basic Recursion Problem).
  2. Given an undirected graph, check whether it is a tree or not (Easy BFS problem).

F2F Technical Interview Round 1 (40 Mins):

• Very long and in-depth discussion on projects.
• Discussion about some Google product implementations.
• Given Inorder and Preorder Traversal of a binary tree, construct the Binary Tree (Complete code with all boundary conditions needed).

F2F Technical Interview Round 2 (40 mins):

• Discussion on projects (asked to dry run the algorithm used).
• Multithreading?
• Process and Threads?
• Semaphores implementation plus some basic OS questions (Critical Sections, etc.).
• Solve the Reader Writer Problem with Semaphores (Code was needed).
• Given a tree, print rightmost nodes (I said it can be done using Level Order Traversal and printing the last node at each level, then he asked to write the code for it).
• Implement Queue with 2 stacks.
• Some more questions on other projects.

F2F HR (60 mins):

• Introduction.
• Many questions on different practical situations, and asked for my reaction to them.
• Find the top 3 records from an employee table.

Nothing as such; just have your basics right.