easyArrayEnumerationMathNumber TheorySliding Window 0 views
Maximum Subarray With Equal Products
You are given an array of positive integers nums.
You are given an array of positive integers nums.
An array arr is called product equivalent if prod(arr) == lcm(arr) * gcd(arr), where:
Return the length of the longest product equivalent subarray of nums.
Example 1
Input: nums = [1,2,1,2,1,1,1]
Output: 5
Explanation: The longest product equivalent subarray is [1, 2, 1, 1, 1] , where prod([1, 2, 1, 1, 1]) = 2 , gcd([1, 2, 1, 1, 1]) = 1 , and lcm([1, 2, 1, 1, 1]) = 2 .
Example 2
Input: nums = [2,3,4,5,6]
Output: 3
Explanation: The longest product equivalent subarray is [3, 4, 5].
Example 3
Input: nums = [1,2,3,1,4,5,1]
Output: 5
Constraints
- 2 <= nums.length <= 100
- 1 <= nums[i] <= 10
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.