This post details the interview process, including all dates and relevant information. Please read the entire post for comprehensive details.

There were 4 rounds of interviews.

However, my resume was shortlisted through the referral program before the interviews began.

On September 23rd, 2021, my friend referred me for the SDE 1 position. On September 29th, I received an email with a HackerRank test link, which I had to complete within a week.

I took the test on October 1st (details to follow). On September 25th, I received an email stating that I had to attend 3 interview rounds on November 11th.

After completing the 3 interview rounds, I received a call from the APAC recruiter on November 17th. I was informed that I had been selected and had to sign the offer letter. Yay!

Round 1: HackerRank Round

This round consisted of 6 MCQs and 2 coding questions.

The MCQs were of medium difficulty, and with good practice, they could be solved easily.

Coding Question 1: Given the arrival and departure times of all trains that reach a railway station, the task is to find the minimum number of platforms required for the railway station so that no train waits. We are given two arrays that represent the arrival and departure times of trains that stop.

Coding Question 2: I don't remember the exact question, but it was related to dynamic programming and was of medium difficulty.

Interview Round 1: Problem Solving and Algorithms

Interview Round 2: Behavioural Round

• Tell me about yourself.
• How would you explain the internet and online shopping to your grandfather?
• Tell me about a project where you needed attention to detail.
• Tell me about a project when you worked as a team.
• Tell me how you manage multiple tasks simultaneously.
• How do you trust your teammates?
• If you see a deadline being missed, what will you do?

And many more similar questions.

Interview Round 3: Data Structures and OOPs

Extract a list of numbers from a list of strings such as ["A2D", "1B", "3F5", "67FE2", "AA"] such that the final result would be [2, 1, 3, 5, 67, 2].

You are given an array [1,5,3,6,2,4,4,7]. Now print all the pairs whose sum is equal to 8, for example:

1,7 4,4 5,3 6,2

Climbing Stairs: You are climbing a staircase. It takes n steps to reach the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

You have a string "CAT". Find its anagrams from the given set of strings:

ACT, TAC, DOG, TCA, BOB, JUM

Ans: ACT, TAC, TCA