❴x|x ∉ x❵
Posts
-
IBM Ponder this 2025 06 solution
-
How smart are LLMs? The BrainF test
-
A Recursive Geometric Proof of 1962 IMO Problem 6
-
Traversing a Tree with Adjacecncy Sums - LeetCode H2872. Maximum Number of K-Divisible Components, H3203. Find Minimum Diameter After Merging Two Trees
-
The limit of an averaging sequence
-
IBM Ponder this 2024 04 solution
-
A nice identity of the sum of a certain fraction series
-
IBM Ponder this 2024 03 solution
-
IBM Ponder this 2024 02 solution
-
A Formula for Accumulated XOR Operations in a Continuous Range (LC E268)
-
IBM Ponder this 2024 01 solution
-
IBM Ponder this 2023 12 solution
-
Maximum Product Difference Between Two Pairs, but with a twist
-
IBM Ponder this 2023 11 solution
-
IBM Ponder this 2023 09 solution
-
Probability of line segments intersecting - A surprisingly simple result
-
The long journey from O(n^2) to O(n^1.5), Leetcode H1269. Number of Ways to Stay in the Same Place After Some Steps
-
Leetcode M808 Soup Servings Convergence Analysis
-
Leetcode M1318 Minimum Flips to Make a OR b Equal to c, E1351 Count Negative Numbers in a Sorted Matrix
-
Leetcode M1091 Shortest Path in Binary Matrix, M2101 Detonate the Maximum Bombs, E1232 Check If It Is a Straight Line
-
Tuscaridium cygneum and the maximum 8 vertex polyhedron -Follow up
-
Tuscaridium cygneum and the maximum 8 vertex polyhedron -A curious shape
-
Leetcode M1140 Stone Game II - Push it to the limit
-
Leetcode M934 Shortest Bridge Optimization
-
Leetcode M347 Top K Frequent Elements Optimization
-
Leetcode M399 Evaluate Division
-
Leetcode M2466 Count Ways To Build Good Strings Optimization
-
Leetcode E2215 Find the Difference of Two Arrays, M1456 Maximum Number of Vowels in a Substring of Given Length, E1572 Matrix Diagonal Sum Optimization
-
Leetcode E1822 Sign of the Product of an Array Optimization
-
An algorithm to iterate through all perfect matchings on a complete graph (Chord diagram)
-
Random Subarray Algorithm
-
New York Times Digits Solver
-
Finding flaws in an algorithm and constructing the counterexamples
-
Efficient Solution to Range Minimum Query (RMQ) and Lowest Common Ancestor (LCA) problems with O(1) query and O(n) preprocessing
-
The ultimate recaptcha
-
Introduction
-
Puzzle game
subscribe via RSS