algorithms
3 posts
When Regex Isn't Fast Enough
Building a Custom DFA for High-Traffic Validation
Two Sum — O(n) with a Hash Map
Classic LeetCode #1. One pass, hash map for lookups.
Binary Search Invariants: A Formal Treatment
Proving correctness of binary search through loop invariants.