3Blue1Brown-style explainer of a faster 3SUM algorithm
3SUM in O(n²) via sort + two pointers looked optimal for decades. Alman & Vassilevska Williams just beat it: O(n^1.9992), with the core algorithm found by Claude. I had Claude Opus 5.5 make a 3Blue1Brown-style explainer: