2170. Minimum Operations to Make the Array Alternating

LeetCodeArrayHash TableGreedyCountingOpen on judge ↗

You are given a 0-indexed array nums consisting of n positive integers. The array nums is called alternating if: - nums[i - 2] == nums[i], where 2 <= i <= n - 1. - nums[i - 1] != nums[i], where 1 <= i <= n - 1. In one operation, you can choose an index i and change nums[i] into any positive integer. Return the minimum number of operations required to make the array alternating. Example 1:

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI