Skip to content

Practice Minimum Number of Operations to Make Elements in Array Distinct

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

Easy#3396
LeetCode Problem

Minimum Number of Operations to Make Elements in Array Distinct

Problem Statement

Given nums, an operation removes its first three elements, or all remaining elements if fewer than three remain. Return the smallest number of operations after which all remaining values are distinct. An empty array has distinct values.

Source: Minimum Number of Operations to Make Elements in Array Distinct on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,2,3,4,2,3,3,5,7]
Output
2

# Example 2

Input
nums = [4,5,6,4,4]
Output
2

# Example 3

Input
nums = [6,7,8,9]
Output
0

Constraints

1 <= nums.length <= 100
1 <= nums[i] <= 100

Related LeetCode Problems

Practice more problems similar to Minimum Number of Operations to Make Elements in Array Distinct.

Review your practice with PhantomCodeAI

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