By name: leet-code description: Algorithmic problem solving — DSA toolbox, LeetCode and contest patterns, complexity communication.
leet code
Category skill (blueprint pack). The description above is the only thing the
router sees — broad and generic on purpose. The fat detail lives in the
blueprints below; open the one that matches and read it in full.
Governs its own form per .claude/rules/rules-are-small-carved-sentences-pointing-to-docs.md
and .claude/rules/mirror-beacon-register-discipline.md (carved sentence = hub /
Beacon; blueprint = satellite / Mirror). The directory is an independent shipping unit.
Blueprints
leet-code-complexity-interview— "Interview complexity communication — big-O, amortized analysis, master theorem, space-time tradeoffs, misstatements."leet-code-contest-patterns— Competitive programming — segment trees, HLD, suffix arrays, FFT/NTT, max-flow, 2-SAT, centroid decomp; Codeforces/ICPC.leet-code-dsa-toolbox— "DSA interview primitives — union-find, trie, heap, segment tree, Fenwick tree, monotonic stack/deque, LRU cache, BST."leet-code-patterns— "LeetCode patterns — two-pointers, sliding window, BFS/DFS, DP, binary search, greedy, topological sort, heaps, bits."