Round 1
Questions:
The question was similar to the second question in this discussion, with the added complexity that there could be p different strategies instead of just two.
Is it possible to achieve a better time complexity than O(pn log n)?
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.