An element $x$ of an integer array arr of length $m$ is considered dominant if its frequency satisfies $ ext{freq}(x) imes 2 > m$, where $ ext{freq}(x)$ is the number of occurrences of $x$ in arr.

You are given a $0$ indexed integer array nums of length $n$ that contains exactly $1$ dominant element.

A split at index i divides nums into two contiguous subarrays: nums[0 \dots i] and nums[i + 1 \dots n - 1], where $0 \leq$ i $< n - 1$. The split is considered valid if both subarrays nums[0 \dots i] and nums[i + 1 \dots n - 1] have the same dominant element as nums.

Return the minimum index i of a valid split. If no valid split exists, return $-1$.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^9$

• nums has exactly $1$ dominant element.

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.