You are given an integer array nums.

A subarray is defined as balanced if the count of distinct even numbers in the subarray is equal to the count of distinct odd numbers in the subarray.

Return the maximum length of a balanced subarray in nums.

Constraints:

• $1 \leq$ nums.length $\leq 1500$

• $1 \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.