# CDQ Divide And Conquer 3D Partial Order: Walkthrough
CDQ Divide And Conquer 3D Partial Order shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sort by the first coordinate, recurse on halves, then scan the left half against the right half with a Fenwick on the second coordinate to count the third.
## 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^2 n).
## Common mistake
Forgetting to restore the Fenwick tree after processing a mid split.
## 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 https://linkjob.ai.