Test (3 coding questions, 1 MCQ).

A minimum of 2 questions must be correct to be shortlisted for the next rounds.

3 Technical Interviews The interviewers are very friendly and cool; they give us enough time to think.

1 HR round

Written Test

Multiple choice on OS, SQL, OOPs.

1. Maximum number of overlaps at any time interval.
2. Dynamic programming.
3. Minimum steps to reach a destination in Snakes and Ladders.

Interview Round 1:

1. An array in which each element occurs in pairs except one. How can you find it?
2. Check whether a given binary tree is a Binary Search Tree or not.
3. How to check whether a given point lies in a triangle or not.
4. Implement a stack using 2 queues.
5. What is paging? Difference between paging and segmentation.
6. Different types of memories (primary, secondary).
7. How will you search in a rotated array with minimum time complexity?
8. Print all pairs which make sum X in an array of N integers.
9. Print all nodes in a binary tree in zigzag format.

Interview Round 2:

1. Dynamic programming (Longest Increasing Sequence).
2. Dynamic programming (Longest AP Sequence).
3. How can you generate a different string every time?
4. How can you compare two elements without using any relational operators?
5. You need to deliver goods to N different places, you have a fuel constraint and a delivery time limit for each of the N places. Design an algorithm to deliver the goods efficiently (combination of 2 graph algorithms).
6. LRU cache data structure implementation.
7. Some questions on my project.
8. BFS, DFS.

Interview Round 3:

1. How are some sites blocked in a particular place?
2. If a village has 100 couples (1:1 sex ratio), they have a belief that a girl child is precious, so they keep on giving birth until they have a girl child. What will be the sex ratio in that case?
3. In how many different ways can you find the sum of 50, 51, 52, ..., 150 numbers?
4. Some questions on internship.
5. Types of memories.