You are given an integer array nums ($0$ indexed) and an integer k.

The score of a subarray (i, j) is defined as $\min($nums[i], nums[i + 1], $\dots$, nums[j]$) \times (j - i + 1)$.

A subarray (i, j) is considered good if $i \leq k \leq j$.

Return the maximum possible score of a good subarray.

Constraints:

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

• $1 \leq$ nums[i] $\leq 2 \times 10^4$

• $0 \leq$ k $<$ nums.length

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.