Round 1
Questions: I was given a n-ary tree and was asked to find the path with minimum cost to a leaf node. The total cost for the path would be the summation of the values of all nodes. I was asked to implement the class, take input, and return the path as well.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions: The question was about a Welsh dictionary, wherein you are given a dictionary and you have to sort the words based on the order of that dictionary. The follow-up was that we don't know the maximum length of an alphabet/string in the dictionary.
Candidate's Approach
Explained the approach and made changes to the code.
Interviewer's Feedback
No feedback provided.
Round 3
Questions: This was a system design interview where I had to design a system showing the top N news articles.
Candidate's Approach
No approach provided.
Interviewer's Feedback
Had back and forth discussion with a senior engineer but didn’t clear it.