You are given an unsorted array. Find the longest subarray with equal number of 0s and 1s. How would you approach this in an interview?

Convert 0 → -1 and use prefix sum with hashmap.

Transforming 0 to -1 reduces the problem to finding subarray with sum 0. Use prefix sum and store first occurrence to maximize length.