Personal notes and implementations from my algorithm learning journey.
Code is mostly written in Go.
- Problems are grouped by the technique used to solve them.
- Each category folder contains a short explanation of the technique, followed by subfolders for specific problems.
- Each problem has its own folder with explanation and implementation.
-
Problems solved by exploring choices and undoing when stuck.
Includes: N‑Queens, subset sum, Knight's tour. -
Problems solved by breaking into overlapping subproblems.
Includes: Fibonacci, knapsack problem, longest increasing subsequence.