maximum-subarray-with-equal-products

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 array of positive integers <code>nums</code>.

An array <code>arr</code> is called product equivalent if <code>prod(arr) == lcm(arr) * gcd(arr)</code>, where:

<ul>
	<li><code>prod(arr)</code> is the product of all elements of <code>arr</code>.</li>
	<li><code>gcd(arr)</code> is the GCD of all elements of <code>arr</code>.</li>
	<li><code>lcm(arr)</code> is the LCM of all elements of <code>arr</code>.</li>
</ul>

Return the length of the longest product equivalent subarray of <code>nums</code>.

&nbsp;
Example 1:

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

Output: 5

Explanation:&nbsp;

The longest product equivalent subarray is <code>[1, 2, 1, 1, 1]</code>, where&nbsp;<code>prod([1, 2, 1, 1, 1]) = 2</code>,&nbsp;<code>gcd([1, 2, 1, 1, 1]) = 1</code>, and&nbsp;<code>lcm([1, 2, 1, 1, 1]) = 2</code>.
</div>

Example 2:

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

Output: 3

Explanation:&nbsp;

The longest product equivalent subarray is <code>[3, 4, 5].</code>
</div>

Example 3:

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

Output: 5
</div>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= nums.length &lt;= 100</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10</code></li>
</ul>