<p>Given a binary array <code>nums</code>, return <em>the maximum length of a contiguous subarray with an equal number of </em><code>0</code><em> and </em><code>1</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [0,1]
<strong>Output:</strong> 2
<strong>Explanation:</strong> [0, 1] is the longest contiguous subarray with an equal number of 0 and 1.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [0,1,0]
<strong>Output:</strong> 2
<strong>Explanation:</strong> [0, 1] (or [1, 0]) is a longest contiguous subarray with equal number of 0 and 1.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>nums[i]</code> is either <code>0</code> or <code>1</code>.</li>
</ul>

class Solution {
public:
    int findMaxLength(vector<int>& arr) {
        int N = arr.size();
        
        for(int i=0;i<N;i++){
            if(arr[i]==0) arr[i]=-1;
        }
        
        int count=0;
        int size = 0;
        int i=0;
        unordered_map<int,int>mp;
        int sum=0;
        
        while(i<N){
            mp[0]=-1;
            sum+=arr[i];
            if(!mp.count(sum)){
                mp[sum] = i;
            }
            else{
                count = i - mp[sum];
            }
            i++;
            size = max(size,count);
        }
        return size;
    }
};
88400