Entering edit mode

*Topics: Graphs, Hashmaps*

**Interview Rounds**

There were 2 technical interview rounds of 45 min each, No HR round was there.

*Round 1*

The interviewer directly started out with the question, without any introduction. She first asked me to code the brute force solution, since we need to count the ordered pairs, I suggested the O(n^2) time complexity naive approach, and then she asked me to code it in the doc.

I suggested the optimised solution using a hint.

Time Complexity - O(n)

She also asked me to write the test cases.

*Questions Interviewer asked* -

- Why did I choose Hashmaps?
- Why do Hashmaps have O(1) complexity in finding an element?

*The question I asked -*

Since the interviewer didn’t start with an introduction, I asked about the introduction and in which teams she was working.

*Round 2*

The interviewer started with an Introduction and after that, he put the question on the doc.

Similar question - *https://leetcode.com/problems/detonate-the-maximum-bombs/*

Some clarification I asked for -

- What if there would be no circles or the list of circles is empty?
- List of circles will have only one circle?

I solved the question using DFS. He also asked me for 3-4 follow-ups and asked me how I would approach them. He didn’t ask me to write code for the follow-ups.

The question I asked -

- I asked him about the team in which he was working.
- Any research publications he has done in the past?

**Verdict** - Selected

**Tips and Takeaways -**

- Communication is very important, think loudly, and interviewers are there to guide you.
- You should be well-versed in the Data Structures that you are using. In my first interview, the interviewer asked me 2-3 questions about Hashmaps.
- Last but not the least, have faith in yourself.

*All the best!*

Loading Similar Posts