Choosing algorithms and data structures v1.0.0

Files

• AGENTS.md13.4 KB
• assets/templates/_template.md1.3 KB
• LICENSE1.1 KB
• metadata.json1.3 KB
• NOTICE-PALATEKIT.md0.5 KB
• references/_sections.md3.1 KB
• references/comp-amortize-instead-of-worst-casing.md2.5 KB
• references/comp-derive-recurrences-via-master-theorem.md2.1 KB
• references/comp-pick-algorithm-class-from-input-bound.md1.8 KB
• references/comp-prefer-iterative-builders-over-string-concatenation.md1.9 KB
• references/comp-treat-space-complexity-as-first-class.md2.1 KB
• references/comp-watch-for-quadratic-blowup-from-membership-in-list.md1.7 KB
• references/divide-meet-in-the-middle-for-subset-problems.md2.5 KB
• references/divide-merge-sort-pattern-for-counting-inversions.md2.4 KB
• references/divide-quickselect-vs-quicksort-partitioning.md3 KB
• references/divide-watch-recursion-depth-and-stack.md2.6 KB
• references/dp-bitmask-for-small-set-states.md2.7 KB
• references/dp-define-state-precisely.md2.8 KB
• references/dp-knapsack-pattern.md2.7 KB
• references/dp-memoize-overlapping-subproblems.md2.4 KB
• references/dp-prove-optimal-substructure-before-coding.md2.7 KB
• references/dp-tabulate-when-recursion-depth-or-order-matters.md2.7 KB
• references/ds-balanced-bst-or-sorted-container-for-range-queries.md2.3 KB
• references/ds-deque-for-both-end-operations.md2.1 KB
• references/ds-fenwick-or-segment-tree-for-mutable-range-queries.md2.2 KB
• references/ds-hash-map-for-keyed-lookup.md2 KB
• references/ds-heap-for-top-k-and-priority-queues.md2.1 KB
• references/ds-prefix-sums-for-repeated-range-sums.md2.2 KB
• references/ds-set-for-uniqueness-and-membership.md2 KB
• references/ds-union-find-for-dynamic-connectivity.md2.8 KB
• references/graph-bfs-for-unweighted-shortest-path.md2.9 KB
• references/graph-detect-cycles-during-dfs.md2.8 KB
• references/graph-dijkstra-for-non-negative-weights.md2.9 KB
• references/graph-kruskal-or-prim-for-mst.md3.1 KB
• references/graph-represent-as-adjacency-list-not-matrix.md2.8 KB
• references/graph-topological-sort-for-dependency-order.md3.1 KB
• references/greedy-huffman-and-priority-queue-greedies.md2.7 KB
• references/greedy-interval-merge-and-sweep-line.md3 KB
• references/greedy-prove-exchange-argument-before-using.md3 KB
• references/greedy-sort-by-the-right-key-for-scheduling.md2.9 KB
• references/scale-aho-corasick-for-multi-pattern-search.md5.1 KB
• references/scale-bloom-filter-for-probabilistic-membership.md3.3 KB
• references/scale-consistent-hashing-for-distributed-sharding.md4.3 KB
• references/scale-count-min-sketch-for-frequency-estimation.md4.2 KB
• references/scale-external-merge-sort-for-out-of-memory-data.md4.1 KB
• references/scale-hyperloglog-for-cardinality-estimation.md3.9 KB
• references/scale-minhash-lsh-for-near-duplicate-detection.md6.2 KB
• references/scale-reservoir-sampling-for-streams.md4 KB
• references/srch-binary-search-on-sorted-data.md2.7 KB
• references/srch-counting-and-radix-sort-for-bounded-integer-keys.md2.3 KB
• references/srch-quickselect-for-k-th-element.md2.3 KB
• references/srch-two-pointers-on-sorted-data.md2.4 KB
• references/srch-use-builtin-sort-not-hand-rolled.md2.3 KB
• references/str-kmp-or-builtin-find-not-naive-search.md2.6 KB
• references/str-rolling-hash-for-multiple-substring-comparisons.md2.8 KB
• references/str-suffix-array-or-automaton-for-substring-queries.md3.2 KB
• references/str-trie-for-prefix-queries.md3.2 KB
• SKILL.md13 KB