You are given a binary array nums containing only $0s$ and $1s$. Your task is to find the maximum length of a contiguous subarray in which the number of $0s$ and $1s$ is exactly equal.

Return the length of the longest such subarray.

Constraints:

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

• nums[i] is either $0$ or $1$.

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 on how to solve this problem.

Implement your solution in the following coding playground.