Indeed Software Engineer I interview questions

Round-1 Hackerrank Test Q-1: Find if number is represented by power of some other number. Q-2: Minimum insertions to make 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 path to leaf with shortest weight. I was asked to code for this. What if this is a graph? Only time complexity was done for this. Round-3 Merge Sort on Magnetic Tapes Round-4 Bar raiser, questions about how to fetch results at indeed, as in heuristics used.