Tags
reinforcement_learning
java
data_structures
concurrency
memory_model
competitive_programming
- [LeetCode] Weekly Contest 516 — Valid K-Unique Subarrays I: Mo's algorithm, and where the √N actually comes from
- [AtCoder] ABC472 E — Odd Cycle: depth parity, and two bugs in reconstructing the cycle
- [CodeChef] Starters 252 — Tree Counting: a parity invariant, Scoins' formula, and a DP state I got wrong
- [yukicoder] Contest 509 — Product: the answer is always 2^k times 2^k-1
- [LeetCode] Weekly Contest 515 — Maximum Gap Between Stations: greedy extremes, and the max-of-max trap
- [LeetCode] Weekly Contest 515 — Elevator Requests III: Held–Karp, a poisoned sentinel, and a duplicate-floor scare
- [Competitive Programming] Number Theoretic Transform
- [AtCoder] ABC471 D — Chargers: subtract the common term
- [Competitive Programming] Number Theory
- [Competitive Programming] Dynamic Programming
- [CodeChef] Starters 108 — Clan Expansion: the largest gap between sources
- [AtCoder] ARC226 A — Meeting Division: when the constraint is the solution
- [LeetCode] Weekly Contest 514 — Maximum Area of Two Non-Overlapping Square Submatrices: only the extremes can witness a valid pair
- [AtCoder] ABC470 C — Inc, Dec, Xor: the "pay with tokens you already minted" trick
- [CodeChef] Starters 106 — Reach Anywhere: finding shortest odd and even parity distances
- [CodeChef] Starters 250 — Subsequence 2: Counting windows, one threshold at a time
- [CodeChef] Starters 250 — Subsequence 1: Chains, not cuts
- [CodeChef] Starters 105 — Wishcraft
- [Leetcode] Biweekly 188 — Minimum Possible Maximum Waiting Time
- [Leetcode] Biweekly 188 — Fence Width Optimization: From O(n³) to O(n²)
- [AtCoder] ABC469 E — Pro Exam Eligibility
- [CodeChef] Starters 115 — Make All Zero: Only Prefix Minima Can Be Eliminated
- [Codechef] Starters 248 — Merging Parity
- [Codechef] Starters 248 — Deleting Elements (Easy)
- [Codeforces] Round 2239 D1 — XOR Sorting (Easy)
- [Codeforces] Round 1103 (Div. 3) E — Friendly Gifts: Disjoint Value Intervals
- [Codeforces] Round 267 (Div. 2) C — George and Job: DP on Fixed-Length Segments
- [Codeforces] Round 1103 (Div. 3) F2 — Elections in Saransk (Hard Version): Sum-minus-Max DP
- [CodeChef] Starters 247 — Red Blue Swaps: From Swaps to Buckets (A DP Pattern)
- [CodeChef] Starters 247 — Fair Flipping (Easy): What This Constructive Proof Taught Me
- [AtCoder] ABC466 C — Count Close Pairs
- [Codeforces] Round 1103 (Div. 3) F1 — Elections in Saransk (Easy Version): Prime-wise Counting
- A primer on Python
- [Codeforces] Round 179 (Div. 1) B — Greg and Graph: Learning to Think in Reverse
- [Codeforces] Edu Round 192 B — A Small Algebra Trick That Turns an O(n²) Idea into O(n)
- [Codeforces] Edu Round 192 D — From Merging Digits to Longest Common Subsequence
- [Repovive] Starter Round 4 D — Distant Transfers: Deriving Invariants Instead of Constructing Moves
- [Repovive] Starter Round 4 C — Corner Meeting: Minimizing the Max of an Increasing and a Decreasing Function
- [Leetcode] Weekly 509 — Subsequence After One Replacement: Did You Consume the Matched Character?
- [Leetcode] Weekly 509 — Palindromic Subarray Sum with Rolling Hashes
- [Leetcode] Biweekly 186 — Count Distinct Ways to Form Target from Two Strings
- Backtracking — The Art of Systematic Undoing
- [Competitive Programming] Two Pointers
- [Competitive Programming] Möbius Function
number_theory
- [Competitive Programming] Number Theory
- [Competitive Programming] Dynamic Programming
- [Codeforces] Round 1103 (Div. 3) F2 — Elections in Saransk (Hard Version): Sum-minus-Max DP
- [Codeforces] Round 1103 (Div. 3) F1 — Elections in Saransk (Easy Version): Prime-wise Counting
- [Competitive Programming] Möbius Function
two_pointers
- [LeetCode] Weekly Contest 515 — Maximum Gap Between Stations: greedy extremes, and the max-of-max trap
- [AtCoder] ABC469 E — Pro Exam Eligibility
- [AtCoder] ABC466 C — Count Close Pairs
- [Leetcode] Weekly 509 — Subsequence After One Replacement: Did You Consume the Matched Character?
- [Competitive Programming] Two Pointers
arrays
comparator
streams
functional_programming
python
project_setup
productivity
backtracking
ssh
tunnelling
port_forwarding
javascript
basics
mental_models
decision_making
llm
transformers
distributed_training
deep_learning
windows
remote_development
startups
tech
ideas
dynamic_programming
- [CodeChef] Starters 252 — Tree Counting: a parity invariant, Scoins' formula, and a DP state I got wrong
- [LeetCode] Weekly Contest 515 — Elevator Requests III: Held–Karp, a poisoned sentinel, and a duplicate-floor scare
- [Competitive Programming] Dynamic Programming
- [LeetCode] Weekly Contest 514 — Maximum Area of Two Non-Overlapping Square Submatrices: only the extremes can witness a valid pair
- [CodeChef] Starters 250 — Subsequence 2: Counting windows, one threshold at a time
- [CodeChef] Starters 250 — Subsequence 1: Chains, not cuts
- [Leetcode] Biweekly 188 — Minimum Possible Maximum Waiting Time
- [Codechef] Starters 248 — Merging Parity
- [Codeforces] Round 267 (Div. 2) C — George and Job: DP on Fixed-Length Segments
- [Codeforces] Round 1103 (Div. 3) F2 — Elections in Saransk (Hard Version): Sum-minus-Max DP
- [CodeChef] Starters 247 — Red Blue Swaps: From Swaps to Buckets (A DP Pattern)
- [Codeforces] Edu Round 192 D — From Merging Digits to Longest Common Subsequence
- [Leetcode] Biweekly 186 — Count Distinct Ways to Form Target from Two Strings
leetcode
- [LeetCode] Weekly Contest 516 — Valid K-Unique Subarrays I: Mo's algorithm, and where the √N actually comes from
- [LeetCode] Weekly Contest 515 — Maximum Gap Between Stations: greedy extremes, and the max-of-max trap
- [LeetCode] Weekly Contest 515 — Elevator Requests III: Held–Karp, a poisoned sentinel, and a duplicate-floor scare
- [LeetCode] Weekly Contest 514 — Maximum Area of Two Non-Overlapping Square Submatrices: only the extremes can witness a valid pair
- [Leetcode] Biweekly 188 — Minimum Possible Maximum Waiting Time
- [Leetcode] Biweekly 188 — Fence Width Optimization: From O(n³) to O(n²)
- [Leetcode] Weekly 509 — Subsequence After One Replacement: Did You Consume the Matched Character?
- [Leetcode] Weekly 509 — Palindromic Subarray Sum with Rolling Hashes
- [Leetcode] Biweekly 186 — Count Distinct Ways to Form Target from Two Strings
distributed_systems
saga
distributed_writes
repovive
binary_search
- [LeetCode] Weekly Contest 515 — Maximum Gap Between Stations: greedy extremes, and the max-of-max trap
- [LeetCode] Weekly Contest 514 — Maximum Area of Two Non-Overlapping Square Submatrices: only the extremes can witness a valid pair
- [Leetcode] Biweekly 188 — Minimum Possible Maximum Waiting Time
- [AtCoder] ABC469 E — Pro Exam Eligibility
- [CodeChef] Starters 115 — Make All Zero: Only Prefix Minima Can Be Eliminated
- [Repovive] Starter Round 4 D — Distant Transfers: Deriving Invariants Instead of Constructing Moves
greedy
- [yukicoder] Contest 509 — Product: the answer is always 2^k times 2^k-1
- [LeetCode] Weekly Contest 515 — Maximum Gap Between Stations: greedy extremes, and the max-of-max trap
- [LeetCode] Weekly Contest 515 — Elevator Requests III: Held–Karp, a poisoned sentinel, and a duplicate-floor scare
- [CodeChef] Starters 108 — Clan Expansion: the largest gap between sources
- [CodeChef] Starters 250 — Subsequence 1: Chains, not cuts
- [CodeChef] Starters 105 — Wishcraft
- [CodeChef] Starters 115 — Make All Zero: Only Prefix Minima Can Be Eliminated
- [Repovive] Starter Round 4 D — Distant Transfers: Deriving Invariants Instead of Constructing Moves
tokenizer
unicode
utf_8
nlp
language_modeling
n_grams
neural_networks
embeddings
word2vec
codeforces
- [Codeforces] Round 2239 D1 — XOR Sorting (Easy)
- [Codeforces] Round 1103 (Div. 3) E — Friendly Gifts: Disjoint Value Intervals
- [Codeforces] Round 267 (Div. 2) C — George and Job: DP on Fixed-Length Segments
- [Codeforces] Round 1103 (Div. 3) F2 — Elections in Saransk (Hard Version): Sum-minus-Max DP
- [Codeforces] Round 1103 (Div. 3) F1 — Elections in Saransk (Easy Version): Prime-wise Counting
- [Codeforces] Round 179 (Div. 1) B — Greg and Graph: Learning to Think in Reverse
- [Codeforces] Edu Round 192 B — A Small Algebra Trick That Turns an O(n²) Idea into O(n)
- [Codeforces] Edu Round 192 D — From Merging Digits to Longest Common Subsequence
prefix_sums
- [AtCoder] ARC226 A — Meeting Division: when the constraint is the solution
- [LeetCode] Weekly Contest 514 — Maximum Area of Two Non-Overlapping Square Submatrices: only the extremes can witness a valid pair
- [AtCoder] ABC469 E — Pro Exam Eligibility
- [Codeforces] Edu Round 192 B — A Small Algebra Trick That Turns an O(n²) Idea into O(n)
graphs
- [AtCoder] ABC472 E — Odd Cycle: depth parity, and two bugs in reconstructing the cycle
- [CodeChef] Starters 106 — Reach Anywhere: finding shortest odd and even parity distances
- [Codeforces] Round 2239 D1 — XOR Sorting (Easy)
- [Codeforces] Round 179 (Div. 1) B — Greg and Graph: Learning to Think in Reverse
shortest_paths
typing
protocols
descriptors
generators
interactive
atcoder
- [AtCoder] ABC472 E — Odd Cycle: depth parity, and two bugs in reconstructing the cycle
- [AtCoder] ABC471 D — Chargers: subtract the common term
- [AtCoder] ARC226 A — Meeting Division: when the constraint is the solution
- [AtCoder] ABC470 C — Inc, Dec, Xor: the "pay with tokens you already minted" trick
- [AtCoder] ABC469 E — Pro Exam Eligibility
- [AtCoder] ABC466 C — Count Close Pairs
constructive_algorithms
codechef
- [CodeChef] Starters 252 — Tree Counting: a parity invariant, Scoins' formula, and a DP state I got wrong
- [CodeChef] Starters 108 — Clan Expansion: the largest gap between sources
- [CodeChef] Starters 106 — Reach Anywhere: finding shortest odd and even parity distances
- [CodeChef] Starters 250 — Subsequence 2: Counting windows, one threshold at a time
- [CodeChef] Starters 250 — Subsequence 1: Chains, not cuts
- [CodeChef] Starters 105 — Wishcraft
- [CodeChef] Starters 115 — Make All Zero: Only Prefix Minima Can Be Eliminated
- [CodeChef] Starters 247 — Red Blue Swaps: From Swaps to Buckets (A DP Pattern)
- [CodeChef] Starters 247 — Fair Flipping (Easy): What This Constructive Proof Taught Me
machine_learning
resources
system_design
bit_manipulation
xor
invariants
- [CodeChef] Starters 252 — Tree Counting: a parity invariant, Scoins' formula, and a DP state I got wrong
- [AtCoder] ABC471 D — Chargers: subtract the common term
- [LeetCode] Weekly Contest 514 — Maximum Area of Two Non-Overlapping Square Submatrices: only the extremes can witness a valid pair
- [Codechef] Starters 248 — Deleting Elements (Easy)