Recursion (Divide & Conquer)

Pro

Use when you want to build the solution recursively from the bottom up using the results of subproblems.

Keywords for identifying (Divide & Conquer) Problems

→ Build answer from left and right subtrees
→ Return value from recursion
→ Bottom-up / postorder
→ Height / depth / validity / path problems

Unlock the Recursion (Divide & Conquer) template

Get the full code template and worked LeetCode examples for Recursion (Divide & Conquer) — plus every other pattern in the library — with a one-time $29 lifetime upgrade.

Upgrade to Pro See free Binary Search template →