Given an integer array nums and an integer m, return the maximum product of the first and last elements of a subsequence of nums that has a length of at least m.

Note: A subsequence is a sequence obtained by deleting zero or more elements from the array without changing the relative order of the remaining elements.

Constraints:

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

• $-10^5 \leq$ nums[i] $\leq 10^5$

• $1 \leq$ m $\leq$ 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.