Best Sightseeing Pair: Max Score In O(n) Time
Maximize sightseeing score: values[i] + values[j] - (j-i). Use single-pass approach with maxI and maxScore. O(n) time complexity, O(1) space complexity.
1014. Best Sightseeing Pair Difficulty: Medium Topics: Array, Dynamic Programming 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. Example 1: Input: values = [8,1,5,2,6] Output: 11 Explanation: i = 0, j = 2, values[i] + values[j] + i - j = 8 + 5 + 0 - 2 = 1...