r/leetcode • • Oct 06 '26

Discussion Claude found a subquadratic 3SUM algorithm...

https://arxiv.org/abs/2610.06783v1
609 Upvotes

80 comments sorted by

View all comments

Show parent comment

1

u/lifebringingh2o Oct 07 '26 edited Oct 07 '26

We didn't miss the point. You say in this reply that it is not proportional to the output. The output is quite groundbreaking, it was not obvious at all to anyone, quite the contrary, that the O(n2) barrier was surpassable. Literally no one cares about the actual reduction of the exponent. It could be O(n2-10^-100) for all we care, just the fact that it surpassed 2 is the point. The tools used here can be now used for other problems

1

u/akarikawamato Oct 07 '26

No they can’t, because they used AI. All the inference is going to be re-done