Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Best Sightseeing Pair
Bookmark
Brute Force
Running Maximum
Input
Classic
Increasing
Multiple Peaks
Complex
Custom
values
=
[8, 1, 5, 2, 6]
0
1
2
3
4
8
1
5
2
6
0
1
2
3
4
8
1
5
2
6
best =
8
0
1
2
3
4
8
1
5
2
6
j
i
score =
8
+
1
+
0
-
1
=
8
new best
best =
11
0
1
2
3
4
8
1
5
2
6
j
i
score =
8
+
5
+
0
-
2
=
11
new best
best =
11
0
1
2
3
4
8
1
5
2
6
j
i
score =
8
+
6
+
0
-
4
=
10
≤ best 11
best =
11
0
1
2
3
4
8
1
5
2
6
j
i
score =
1
+
5
+
1
-
2
=
5
≤ best 11
best =
11
0
1
2
3
4
8
1
5
2
6
j
i
score =
1
+
2
+
1
-
3
=
1
≤ best 11
best =
11
0
1
2
3
4
8
1
5
2
6
j
i
score =
1
+
6
+
1
-
4
=
4
≤ best 11
best =
11
0
1
2
3
4
8
1
5
2
6
j
i
score =
5
+
6
+
2
-
4
=
9
≤ best 11
best =
11
0
1
2
3
4
8
1
5
2
6
j
i
score =
2
+
6
+
3
-
4
=
7
≤ best 11
best =
11
0
1
2
3
4
8
1
5
2
6
Best pair score =
11
algo
master
.
io
Step:
Score = values[i] + values[j] + i - j. Try every pair i < j and keep the maximum.
0 / 11
Input
Classic
Increasing
Multiple Peaks
Complex
Custom
values
=
[8, 1, 5, 2, 6]
0 / 11
algo
master
.
io
Step:
Score = values[i] + values[j] + i - j. Try every pair i < j and keep the maximum.
