Technical Round 1(Google Meet): (1 hr )

The interviewer started with his introduction – He was a 4-year experienced developer.

Then he asked about my intro.

• We started the discussion with my recent project in about 10 minutes.
• Then directly jumped to problem-solving.

Problem 1:

You are given a matrix where ‘M’ is a monster, ‘P’ is a pillar and 0 signifies space. You need to place bombs in the matrix to kill all the monsters. Note that if the bomb explodes, it can kill any no. of monsters in that row or column. The role of the pillar is to avoid the propagation of an explosion.

Your task is to find the minimum no of bombs required to kill all the monsters. Note that a bomb can only be placed in space.

Input :

[[0,M,0,0],

[M,0, P, M],

[0, M,0,0]];

Output: 2

• Honestly, I didn’t get the question properly. So, I kept on asking the interviewer to clarify again.
• After I understood, I explained to him the brute force to check by placing the bomb at every 0.
• I was not able to code the solution properly.
• So, I asked if he could give me another question. He agreed and gave me another problem

Problem 2: https://www.w3wiki.org/count-pairs-in-array-whose-sum-is-divisible-by-k/

• I coded the brute force, then he asked me to optimize it.
• I could not give an optimized solution for this problem.

We almost reached the end so, he concluded the interview by asking if I had any questions for him.

Verdict: Reject

Previous Position – Software Engineer II

Previous Organization – Sabre

Location – Bengaluru, India

Years of Experience – 1.5 years of Experience

I had applied through Naukri.