# PQ Tree Consecutive Ones: Explained

PQ Tree Consecutive Ones shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Reduce a PQ-tree by the sets that must appear consecutively so a permutation with the consecutive-ones property is represented compactly, if it exists.

## 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 + m) with careful node templates.

## Common mistake

Replacing a P-node with a Q-node (or vice versa) during a reduce, which forbids a still-legal order.

## 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 tool for job interviews.