25 DSA Patterns — Go Study Notes

Playlist: Master DSA using 25 DSA PATTERNS by Itsruntym.

Every chapter in each video now has its own explanation, dry run, and Go implementation — not just one featured problem.

Notes	What is covered
01_linear_patterns.md	L1–L6 every two-pointer, cycle, window, prefix, interval, and binary-search problem
02_data_structures.md	L7 all five sorts plus heap sort; hashmap internals; stack/queue/heap/k-way parts
03_trees_graphs.md	L14–L19 traversals, DFS/BFS problems, matrix/list, Dijkstra, DFS topo + Kahn
04_advanced.md	L20–L25 trie, greedy trio, all 3 DP styles, backtracking, every bit problem

Compilable code:

File	Contents
`solutions.go`	shared types plus the original featured functions
`l01_l06_more.go`	remaining L1–L6 problems
`l07_sorting.go`	bubble, selection, insertion, quick (merge is in `solutions.go`)
`l08_l12_more.go`	hashmap, stack, two-stack queue, teaching heap, k-way extras
`l14_l25_more.go`	traversals, graph reps, topo, 3 DP styles, backtracking extras

cd dsa_25_patterns_go
go test -v .

Browse the notes locally:

python3 site/build.py
python3 -m http.server 8765 --directory site

Then open http://127.0.0.1:8765/.

Public site: https://asepsetyawan.github.io/dsa-25-patterns-go/ (source repo)

The playlist has 24 videos. Lessons 11 and 13 share one heap/top-k video. Union Find appears in the creator’s written list but has no dedicated video here.