3Sum with optimisation from O(n^3) to O(n^2)
Filed under Tiger Analytics
The question
A 3Sum problem; brute-force triplet generation was O(n^3) and the interviewer asked for optimisation, solved with two pointers in O(n^2).
No write-up yet. Related questions below have one.
Related Tiger Analytics questions
Collected from public candidate posts and coding forums. Updated Nov 2026.