<aside> <img src="https://super.so/icon/dark/key.svg" alt="https://super.so/icon/dark/key.svg" width="40px" /> Recursion may seem counter intuitive at first, but once you are comfortable with “trusting the recursion” and finding subproblems, you will find them slightly easier to deal with.

Still hard tho >:(

</aside>

$\star$ Divide & Conquer Problems

Divide & Conquer

Summary & Patterns

  1. Divide: Make the problem smaller.

    Make sure we eventually hit the base case and include enough base cases.

  2. Delegate: Let the recursion do its thing.

    If we did step 1 correctly, this will work. Just trust it.

  3. Combine: Recursion is done, now combine the results from recursive calls.


Go to next:

◈ Recursive Backtracking