maximum-product-of-first-and-last-elements-of-a-subsequence

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code> and an integer <code>m</code>.

Return the maximum product of the first and last elements of any subsequence of <code>nums</code> of size <code>m</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [-1,-9,2,3,-2,-3,1], m = 1

Output: 81

Explanation:

The subsequence <code>[-9]</code> has the largest product of the first and last elements: <code>-9 * -9 = 81</code>. Therefore, the answer is 81.
</div>

Example 2:

<div class="example-block">
Input: nums = [1,3,-5,5,6,-4], m = 3

Output: 20

Explanation:

The subsequence <code>[-5, 6, -4]</code> has the largest product of the first and last elements.
</div>

Example 3:

<div class="example-block">
Input: nums = [2,-1,2,-6,5,2,-5,7], m = 2

Output: 35

Explanation:

The subsequence <code>[5, 7]</code> has the largest product of the first and last elements.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-105 &lt;= nums[i] &lt;= 105</code></li>
	<li><code>1 &lt;= m &lt;= nums.length</code></li>
</ul>