Blog
Tutorials, guides, and insights to help you become a better developer.
LeetCode 621 has two unrelated correct solutions — a heap simulation and a one-line formula — so running them against every task multiset up to size 14 crossed with every cooldown from 0 to 40 is a stronger test than any example you would write by hand.
AdminSeptember 17, 20266 min read
The XOR and popcount tricks behind Single Number, Missing Number and Counting Bits are small enough to verify exhaustively, so this runs them over every input they claim to cover and reports the exact value at which each one stops being correct.
AdminSeptember 3, 20268 min read