Posts
-
[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
-
Recurrent Neural Networks
-
[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
subscribe via RSS