0130 min suggested
Tree traversal under pressure
Return a binary tree in level order. Compare an iterative queue with recursion and test an empty tree and a long chain.
What a strong answer demonstrates
A correct traversal, bounded auxiliary memory, and a clear explanation of the trade-off.
0230 min suggested
Find the right array pattern
Merge two sorted arrays. Then adapt your solution when one array has enough unused space to hold both. Explain how you avoid overwriting unread values.
What a strong answer demonstrates
A maintained invariant, correct boundary handling, and justified complexity.
0320 min suggested
Behavioral storytelling
Describe a technical decision you changed after receiving feedback. Explain your contribution and the outcome.
What a strong answer demonstrates
Specific actions, honest reflection, and measurable impact.