Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Max Value of Equation
Bookmark
Brute Force
Max-Heap
Monotonic Deque
Input
Example 1
Example 2
Example 3
Custom
points
=
[[1,3],[2,0],[5,10],[6,-10]]
,
k
=
1
1
3
2
0
5
10
6
-10
0
1
2
3
try every pair i < j with xj − xi ≤ 1: yi + yj + (xj − xi)
1
3
2
0
5
10
6
-10
0
1
2
3
try every pair i < j with xj − xi ≤ 1: yi + yj + (xj − xi)
maxValue =
−∞
1
3
2
0
5
10
6
-10
0
1
2
3
j
right point
j = 1
maxValue =
4
xj − xi = 1
1
3
2
0
5
10
6
-10
0
1
2
3
i
j
(0, 1):
3
+
0
+
1
=
4
new max
maxValue =
4
1
3
2
0
5
10
6
-10
0
1
2
3
j
right point
j = 2
maxValue =
4
xj − xi = 4
1
3
2
0
5
10
6
-10
0
1
2
3
i
j
xj − xi = 4 > 1
— out of range
maxValue =
4
1
3
2
0
5
10
6
-10
0
1
2
3
j
right point
j = 3
maxValue =
4
xj − xi = 5
1
3
2
0
5
10
6
-10
0
1
2
3
i
j
xj − xi = 5 > 1
— out of range
maxValue =
4
xj − xi = 4
1
3
2
0
5
10
6
-10
0
1
2
3
i
j
xj − xi = 4 > 1
— out of range
maxValue =
4
xj − xi = 1
1
3
2
0
5
10
6
-10
0
1
2
3
i
j
(2, 3):
10
+
-10
+
1
=
1
maxValue =
4
1
3
2
0
5
10
6
-10
0
1
2
3
max value =
4
algo
master
.
io
Step:
Brute force: try every valid pair i < j with xj − xi <= 1.
0 / 10
Input
Example 1
Example 2
Example 3
Custom
points
=
[[1,3],[2,0],[5,10],[6,-10]]
,
k
=
1
0 / 10
algo
master
.
io
Step:
Brute force: try every valid pair i < j with xj − xi <= 1.
