meta | Software Engineer Intern | Interview Experience
Interview Date: Not specified
Result: Rejected
Difficulty: Not specified
Interview Process
The interview consisted of two coding questions. The first question asked for a function to determine the maximum depth of balanced parentheses in a given string. The second question involved calculating the diameter of a binary tree, with a follow-up on how to generalize it for an n-ary tree. The candidate initially encountered a bug in the second question but corrected it after receiving hints. The interview was conducted by a male interviewer, and the candidate felt the discussion was positive overall.
Technical Questions
- Maximum Nesting Depth of the Parentheses (string, parentheses depth)
- Diameter of Binary Tree (binary tree, depth-first search, recursion)
Tips & Insights
The candidate felt that the coding questions were not particularly difficult, but the initial mistake in the second question may have affected the overall impression. They expressed a desire to improve for future opportunities.