-4
-1
-1
0
1
2
[0][1][2][3][4][5]
Brute force
▸1given arr2for i ← 0 to n − 3:3 for j ← i + 1 to n − 2:4 for k ← j + 1 to n − 1:5 if arr[i] + arr[j] + arr[k] == 0:6 record (i, j, k)7dedupe results
state
- target0
- n6
warming up the animation
Given an integer array, find all unique triplets that sum to zero, with no duplicate triplets in the result.
▸1given arr2for i ← 0 to n − 3:3 for j ← i + 1 to n − 2:4 for k ← j + 1 to n − 1:5 if arr[i] + arr[j] + arr[k] == 0:6 record (i, j, k)7dedupe results
Find every unique triplet (a, b, c) in arr with a + b + c = 0.