You are given a $0$ indexed integer array nums.

An array is considered beautiful if it satisfies the following conditions:

• The length of the array is even.

• For every even index i such that $0 \leq i <$ nums.length $- 1$, nums[i] != nums[i + 1].

You may delete any number of elements from nums. Whenever an element is deleted, all elements to its right shift to the left by $1$ position, and the length of the array decreases by $1$.

Return the minimum number of elements that must be deleted from nums to make it beautiful.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.