##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
The trap
Check all triplets with three nested loops. Compute each sum, collect those equal to zero.
With , you have roughly triplets. That's far too slow.
Beyond speed, you'd generate duplicate triplets. For [-1, -1, 0, 1], the triplet [-1, 0, 1] appears twice using different -1 values.
