Algorithm Design

Optimization, greedy decisions, and overlapping subproblems

2 topics 8 problems 0 completed Read about Algorithm Design →

Dynamic Programming

Used when optimal answers are built from smaller overlapping states

4 problems

House Robber

Small-state DP where each choice affects the next allowable step.

Coin Change

A common minimum-cost style DP with reusable subproblems.

Longest Common Subsequence

A foundational 2D DP for sequence comparison.

Edit Distance

Classic sequence-transformation DP used in matching systems.

Local decisions that are good enough because the structure allows it

4 problems

Assign Cookies

Greedy matching after sorting two sequences.

Jump Game

Reachability using a locally best farthest-reach choice.

Candy

Greedy local constraints resolved across an ordered pass.

Non-overlapping Intervals

A standard interval-selection greedy strategy.