Meta E4 Phone screen interview

• For the first question, the candidate used for loops and string manipulation to solve the problem.
• The initial time and space complexity was O(n) and O(1).
• After discussing with the interviewer, the candidate made changes to the code, resulting in a time complexity of O(log(n)^2).
• For the second question, the candidate created a helper function to handle the zigzag traversal but faced some difficulties in understanding the problem initially.
• The candidate communicated their thought process but struggled with iteration and explaining their approach clearly.
• They acknowledged forgetting to consider edge cases due to time constraints.

No feedback provided.