[LeetCode] Maximum Linear Stock Score

2898. Maximum Linear Stock Score 1>prices`, where `prices[i]` is the price of a particular stock on the `ith` day, your task is to select some of the elements of `prices A selection indexes, where indexes``k which is a subsequence of the array [1, 2, ..., n] For every 1 < j <= k, prices[indexes[j]] - prices[indexes[j - 1]] == indexes[j] - indexes[j - 1]. A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining...

Submit