Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Number of Pairs Satisfying Inequality
Bookmark
Brute Force
Merge Sort
BIT
Input
Standard
Example
All Same
Larger
Custom
nums1
=
[3, 2, 5]
,
nums2
=
[2, 2, 1]
,
diff
=
1
arr
0
1
2
pair = -
count = 0
arr
0
1
2
pair = -
count = 0
arr
1
0
0
1
4
2
pair = -
count = 0
arr = nums1 - nums2
arr
1
0
0
1
4
2
pair = (0, 1)
count = 0
arr[0] - arr[1] = 1 - 0 = 1
arr
1
0
0
1
4
2
pair = (0, 1)
count = 1
1 <= 1, count = 1
arr
1
0
0
1
4
2
pair = (0, 2)
count = 1
arr[0] - arr[2] = 1 - 4 = -3
arr
1
0
0
1
4
2
pair = (0, 2)
count = 2
-3 <= 1, count = 2
arr
1
0
0
1
4
2
pair = (1, 2)
count = 2
arr[1] - arr[2] = 0 - 4 = -4
arr
1
0
0
1
4
2
pair = (1, 2)
count = 3
-4 <= 1, count = 3
arr
1
0
0
1
4
2
pair = -
count = 3
3 valid pair(s)
algo
master
.
io
Step:
Count pairs (i, j) with i < j and nums1[i] - nums1[j] <= nums2[i] - nums2[j] + diff, rewritten as arr[i] - arr[j] <= 1
0 / 8
Input
Standard
Example
All Same
Larger
Custom
nums1
=
[3, 2, 5]
,
nums2
=
[2, 2, 1]
,
diff
=
1
0 / 8
algo
master
.
io
Step:
Count pairs (i, j) with i < j and nums1[i] - nums1[j] <= nums2[i] - nums2[j] + diff, rewritten as arr[i] - arr[j] <= 1
