Status: M.Tech new grad ( Computer Science and Engineering)
Position: Software Engineer
Location: Bangalore, India
Date: 1 December 2019

There were four rounds, and it was an on-campus recruitment drive.

Round 1: Online Assesment on 31/10/19
There were two coding questions.
1. You are given a number X. You have to reach X starting from 1. You have the choice of either going to the immediate next positive number or to reverse the digits of the current number(removing leading zeroes if any).
Example if the player currently said 56, then he could next say 57 or 65 and so on.
What is the fewest number of numbers required to reach X form 1.

Constrains:
T<=100
X<=10^14
Input:
42
output:
16

2.N people are standing in a row wearing coloured shirts, where A[i] denotes the colour of the shirt i th person is wearing. People wearing the same colour T-shirt belong to the same team. If i th and j th person belong to the same team (that means they are wearing the same color T-shirt) and you have an index k such that i<k<j and k belong to another team, then these people fight.
For example: If you have 1 1 2 2, there are no fights. But if you have 1 2 1 2, then the two teams fight.
You don't like people fighting. The only operation you are allowed to do is change the T-shirt color of one team to another(you have to change the color of all members of that team), and the cost of this operation is the number of people in this team. Find the minimum cost to make sure that there will be no fight.

Input:
N - length of sequence 1 <= N <= 100000
A[1] A[2].... A[n] - sequence 1<= A[i] <= 200000

Example:
13131
Answer. 2
Explanation: Change the T-shirt colour of second and fourth person to 1(that is changing team wearing colour 3)

I could solve both the problems but partially, i.e. brute force approach. All the test case did not pass.

Round 2: Debugging Round on 30/11/19
It was a pen-paper round. In this round, we were given three questions with logical errors. Each question had a description of what it intended to do. We have to read the description and based on the that we need to remove the logical errors.

1. Code of printing the binary tree in level order. But after every 2 level we need to switch the direction of printing.
2. A question of multithreading. Code was given of printing odd and even numbers using threads in a syncronised manner.
3. A mutex lock question. The different critical section accessed by processors and we need to set proper place to lock and unlock the mutex.

I could find out all the errors in question 1 and 3 but could not do question 2.

Round 3: F2F Coding Interview on 01/12/19
The interviewer asked me one question, and we had a detail discussion about different approaches. Then he told to write the code in the paper. I wrote, and he tested for some corner cases. My code passed all the corner case.

Question: Given a binary tree and a node k. Suppose we ignite a fire at node k. After each time unit, the fire spreads to its parent and children (if available). Similarly it happens for the next nodes. Find the time in which the tree will be burnt completely. Storing parent pointer is not allowed in any

Round 4: F2F Desing Interview on 01/12/19
It was the last round. Here the interviewer asked me to design dropbox.
I designed something, but could not convinced the interviewer.

At the end, I was rejected.
The interviewer where very helpful and it was a very good experience.