The interview process consisted of 3 interview rounds along with one coding round. The questions were of moderate level. The questions were completely based on DS-Algo in the coding round and in the interview rounds.

1. You were given an array and had to find the number of triplets that form a triangle. The question was straightforward and available on GeeksforGeeks.

2. The crux of this question was to find the connected component with the maximum number of elements. The graph was given in the form of a binary matrix, and the connected components were supposed to consist of all 1's.

3. I do not remember this question. However, I solved it using a priority queue.

In my first interview round, I was given a problem based on a queue. The question was that you have been given a list of integers in which you can move only in the forward direction. You are given two functions: getNextElement() and endList(). When endList() returns true, you have completely traversed the list. You were asked to develop an algorithm that prints the first odd number, then the first even number, then the second odd, and the second even, and so on. For example, if the list is 1, 4, 6, 7, 2, 3, your output should be 1, 4, 7, 6, 3, 2.

This question was straightforward: How to maintain a leaderboard?

The next question was supposed to be: You have been given some DBMS queries, say 1000 queries. If you fetch 100 queries each time, it takes 11 attempts, as in the last attempt (11th) you will come to know that you do not have any queries remaining. Now, you are supposed to modify this process such that you do not have to use one additional query.

This round was a managerial round. I was asked a couple of questions regarding my projects and a couple of HR questions.