Round 1
Questions:
- Cut Wood - The interviewer asked to explain the brute force approach first and then optimize it. Time complexities for both approaches were discussed.
- Random Pick with Weight - Given a map of city names to their populations, return a random city name with weight. The interviewer requested not to use the bisectright method in Python and to implement it manually. Time complexity and space complexity were also discussed.
Candidate's Approach
- For the Cut Wood problem, started with a binary search solution after explaining the brute force method.
- For the Random Pick with Weight problem, implemented the solution without using the bisectright method, despite initial panic during the example run.
Interviewer's Feedback
No feedback provided.