# Garsia Wachs Optimal BST: Interview Notes

Garsia Wachs Optimal BST shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Find the rightmost pair that locally violates the Hu-Tucker condition, combine it, and slide the new node left until the sequence is restored, which yields the same shape as an optimal alphabetic tree.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log n) with careful rightmost-violation searches.

## Common mistake

Sliding the combined node past a lighter neighbor, which builds a tree whose weighted path length is no longer optimal.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at linkjob.ai.