Round 1
Questions:
PROBLEM 1
Given data = [2,1,2]
The perms would be 1 to n so [1,2,3], [2,1,3], etc...
Find the best perm to maximize the sum.
PROBLEM 2
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
PandaGuru