Skip to content

Practice Minimum Stability Factor of Array

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3605
LeetCode Problem

Minimum Stability Factor of Array

Problem Statement

You are given an integer array nums and an integer maxC. A subarray is called stable if the highest common factor (HCF) of all its elements is greater than or equal to 2. The stability factor of an array is defined as the length of its longest stable subarray. You may modify at most maxC elements of the array to any integer. Return the minimum possible stability factor of the array after at most maxC modifications. If no stable subarray remains, return 0.

Source: Minimum Stability Factor of Array on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [3,5,10], maxC = 1
Output
1

# Example 2

Input
nums = [2,6,8], maxC = 2
Output
1

# Example 3

Input
nums = [2,4,9,6], maxC = 1
Output
2

Constraints

1 <= n == nums.length <= 10^5
1 <= nums[i] <= 10^9
0 <= maxC <= n

Related LeetCode Problems

Practice more problems similar to Minimum Stability Factor of Array.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.