Round 1
Questions:
- Determine if a target string can be constructed by characters in a source string.
- Given the root of a binary tree containing integers, print each column from left to right, and within each column print the values from top to bottom.
Candidate's Approach
- For the binary tree question, the candidate was initially confused about using DFS and BFS but received a hint from the interviewer. After the hint, the candidate was able to write the correct code in 5 minutes.
Interviewer's Feedback
No feedback provided.