Meta·Software Engineer·Onsite - Coding / Algorithms
- Given the root of an N-ary tree and two target nodes, find their lowest common ancestor. If either node doesn't exist in the tree, return null.
- You have two separately sorted lists of non-overlapping intervals. Merge them into a single sorted list with no overlapping intervals.
- Given a list of lowercase words, find the largest subset where no letter appears more than once across all chosen words combined. Return the total character count of that subset.
“The null case is what trips people up here.”