I was referred by one of my friends. I received a call from their HR.

First, there was a HackerRank test, followed by four rounds of onsite interviews.

HR was very cooperative in scheduling the interviews for me.

Round 1: Hackerrank Test

• Q-1: Find if a number is represented by the power of some other number.
• Q-2: Minimum insertions to make a string into a palindrome.
• Q-3: I forgot.

Round 2:

Questions about recent projects.

Given a k-ary tree with weights at each node, find the path to a leaf with the shortest weight. I was asked to code this. What if this was a graph? Only time complexity was discussed for this.

Round 3:

Merge Sort on Magnetic Tapes.

Round 4:

Bar raiser, questions about how to fetch results at Indeed, specifically heuristics used.