I applied through a recruiter. The process took 2 days.

I had applied via LinkedIn. The TA sent me an email to schedule a call for discussing my profile. On the call, she explained the interview process to me and scheduled the interview. It was a 3-round process on a Zoom call.

• Round 1: It was a 1-hour round, and two programming questions were asked to code on a Google sheet.
• Round 2: It was a design round, and I was asked to design a vehicle parking system. First, I had to design the classes and explain it, and then I was asked to implement it on an IDE and develop APIs for the interviewer to evaluate. It was a 2-hour round, and everything had to be done in that time only. In both rounds, you have to share your screen and enable your video so that the panel can evaluate your code.
• Round 3: It was supposed to be the fitment round, but I never got a call back after round 2.

Given an array and a list of queries that contain starting and end indexes, we have to find the sum of the array from the starting to end indexes and add it to the list for each query. For example, arr[] = {1, 2, 5, 8, 9, 10}, and queries = List<List> queries = [[2, 5], [3, 5]]; the output = list = [32, 27]. The explanation is that for the first query, we add the sum from index 2 to 5, and for the second query, the sum is from index 3 to 5.

There are some villages near a city in India that have yet to be connected to the city via road. Some villages are connected to each other via road and some aren’t. A village is said to be connected to the city if one can travel from that village to the city via any road. The cost of making a road between a city and a village and that between a village and another village is the same and equal to 1 unit. Find the minimum cost the government must bear in order to connect all the villages to the city. The input includes N, which is the number of villages, and a Matrix, M[N+1][N+1], where 0 to N-1 indexes represent a village and the Nth index represents a city. M[x][y] = M[y][x] = 1 if there is a road between x and y.

Round 2 was a 2-hour round to design a Vehicle Parking System for a mall.