Round 1
Questions:
- Vertical Order Traversal of a Binary Tree
- Given an int array find the second highest value after arranging the numbers in such a way that they form the largest possible concatenated number. Eg: input = [1,2,3,4,5] output = [5,4,3,1,2]
Candidate's Approach
I was able to solve the first question, but it took up the majority of my time. I barely had any time to discuss the second question.
Interviewer's Feedback
No feedback provided.