1st question was a DP 0-1 Knapsack problem similar to houserobber, leetcode medium - hard. Must be a DP bottom-up solution or you will get TLE if you solve it recursively. 2nd question had you write a JSON parser in 30 minutes, you know something that would take you a few hours or days at the minimum
What was a challenge you faced and overcame?
Asked to write an algorithm that passes through an array and returns a metric regarding the characters in the array.
Why do you know about Dash Hudson?
What is the Diamond Problem in OOPs?
What is graphs? how do we implement it? Give an algorithm to perform soduko
MERN Stack questions, React etc
what excites you? what frustrates you?
A question about randomizing lists, a question about breadth first search, questions about time complexities.
First round: minimum common ancestor
Viewing 1621 - 1630 interview questions