This linear-time triangle-finding algorithm will imply subquadratic solutions for many 3SUM-hard problems, as triangle detection is 3SUM-hard and reductions preserve time complexity under plausible conjectures.



This content originally appeared on DEV Community and was authored by Frank Vega


This content originally appeared on DEV Community and was authored by Frank Vega