Skip to content

Practice Best Sightseeing Pair

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1014
LeetCode Problem

Best Sightseeing Pair

ArrayDynamic Programming

Problem Statement

You are given an integer array values where values[i] represents the value of the ith sightseeing spot. Two sightseeing spots i and j have a distance j - i between them. The score of a pair (i < j) of sightseeing spots is values[i] + values[j] + i - j: the sum of the values of the sightseeing spots, minus the distance between them. Return the maximum score of a pair of sightseeing spots.

Source: Best Sightseeing Pair on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
values = [8,1,5,2,6]
Output
11

# Example 2

Input
values = [1,2]
Output
2

Constraints

2 <= values.length <= 5 * 10^4
1 <= values[i] <= 1000

Related LeetCode Problems

Practice more problems similar to Best Sightseeing Pair.

1 Two Sum Easy4 Median of Two Sorted Arrays Hard5 Longest Palindromic Substring Medium10 Regular Expression Matching Hard11 Container With Most Water Medium
← Previous Partition Array Into Three Parts With Equal SumNext → Smallest Integer Divisible by K

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free