Go (Micro)
Master the tiny Go code shapes that combine into full algorithms and data-structure solutions.
Values & Types
A sorted variable shelf, zero values, numeric conversions, constants, and types.
Arrays & Slices
Fixed dimensions, slice growth and copying, range, indexes, and mutation.
Maps & Sets
Map CRUD, presence checks, sets, frequencies, and nested maps.
Control Flow
Scoped branches, every form of for, two pointers, and sliding windows.
Functions & Recursion
Explicit signatures, multiple returns, slice parameters, closures, base cases, and memoization.
Structs & Pointers
Bare trees, linked nodes, nil-safe traversal, methods, receivers, and interfaces.
Stacks & Queues
Conditional push/pop, slice-backed LIFO, BFS queues, and monotonic deques.
Sorting & Searching
Standard sorting helpers, custom comparators, and monotonic binary search.
Heaps & Union-Find
Bare min/max heaps, priority queues, path compression, and union by size.
Graphs & Traversal
Adjacency lists, BFS families, recursive DFS, and topological order.
DP & Backtracking
Tables, rolling states, memoized recursion, safe snapshots, and undo steps.
Bits, Math & Strings
Masks, wide arithmetic, bytes, runes, parsing, I/O, errors, and tests.
Course checkpoint
Verify the small Go code shapes used in complete algorithm implementations.