Zest·Data Scientist·Technical Phone Screen
- Find the maximum depth of a binary tree, where depth is the number of nodes along the longest root-to-leaf path.
- Given a list of meeting time intervals, find the minimum number of conference rooms needed to hold all meetings without overlap. Meetings are half-open intervals so back-to-back meetings don't conflict.
“Went with recursion right away, base case returns 0 for null nodes and you just take the max of left and right subtree depths plus one.”