# Schnyder Wood Planar Realizer: Study Guide

Schnyder Wood Planar Realizer shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A partition of a triangulated planar graph into three trees rooted at the outer triangle supports a straight-line grid drawing on an (n-2) by (n-2) grid.

## 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) to compute and draw.

## Common mistake

Counting paths in only two trees when assigning coordinates, which collapses a vertex onto an edge.

## 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 AI job interview answers in real time.