Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
4Sum
Bookmark
Brute Force
Two Pointers
With Pruning
kSum Recursion
Input
Example 1
All duplicates
Single quadruplet
No solution
Custom
nums
=
[1, 0, -1, 0, -2, 2]
,
target
=
0
target = 0
0
1
2
3
4
5
-2
-1
0
0
1
2
target = 0
0
1
2
3
4
5
-2
-1
0
0
1
2
target = 0
0
1
2
3
4
5
-2
-1
0
0
1
2
i
j
k
target = 0 sum = -2
0
1
2
3
4
5
-2
-1
0
0
1
2
i
j
k
l
target = 0 sum = 0
0
1
2
3
4
5
-2
-1
0
0
1
2
i
j
k
l
target = 0 sum = 0
0
1
2
3
4
5
-2
-1
0
0
1
2
i
j
k
l
target = 0 sum = 1
0
1
2
3
4
5
-2
-1
0
0
1
2
i
j
k
l
target = 0 sum = 1
0
1
2
3
4
5
-2
-1
0
0
1
2
i
j
k
l
target = 0 sum = 1
0
1
2
3
4
5
-2
-1
0
0
1
2
i
j
k
l
target = 0 sum = 2
0
1
2
3
4
5
-2
-1
0
0
1
2
i
j
k
l
target = 0
0
1
2
3
4
5
-2
-1
0
0
1
2
algo
master
.
io
Step:
Find every quadruplet summing to 0 (array is sorted)
0 / 39
Input
Example 1
All duplicates
Single quadruplet
No solution
Custom
nums
=
[1, 0, -1, 0, -2, 2]
,
target
=
0
0 / 39
algo
master
.
io
Step:
Find every quadruplet summing to 0 (array is sorted)
