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
Make pointer changes explicit
Reverse a singly linked list in place. Draw the pointers after each step and explain how you preserve the remaining list.
What a strong answer demonstrates
Correct pointer ordering, empty and single-node cases, and constant auxiliary space.
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.