You are given a $1$ indexed integer array prices, where prices[i] represents the price of a given stock on day i.

A sequence of chosen indices $i_1 < i_2 < \dots < i_k$ is considered linear if for every index $j$ where $1 < j \leq k$, the following condition holds:

prices$[i_j] -$ prices$[i_{j - 1}] = i_j - i_{j - 1}$

The score of a linear selection is the sum of prices$[i]$ for all selected indices.

Return the maximum possible score of a linear selection.

Constraints:

• $1 \leq$ prices.length $\leq 10^5$

• $1 \leq$ prices[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.