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.
Basic academic and situational-based questions
Why do you know about Dash Hudson?
Why Pitchbook? Why Sales? Walk me through your resume
What is the Diamond Problem in OOPs?
What is graphs? how do we implement it? Give an algorithm to perform soduko
Please tell us about an interesting recent development in global affairs.
Tell me about a time you had to carry out a strategy and what was the outcome?
Viewing 3051 - 3060 interview questions