Given an array containing only 1s and 0s, find the largest subarray with an equal number of 1s and 0s.

Question

Accepted Answer

Find largest subarray with equal number of 1s and 0s

Use a hashmap to store the count of 1s and 0s encountered so far
If the count of 1s and 0s is equal at any point, calculate the length of subarray
Keep track of the maximum length subarray found so far

Accepted Answer

def find_largest_subarray(array):

max_length = 0

prefix_sums = {0: -1}

count = 0

for i, num in enumerate(array):

count += 1 if num == 1 else -1

if count in prefix_sums:

length = i - prefix_sums[count]

max_length = max(max_length, length)

else:

prefix_sums[count] = i

return max_length

2 nd programming

array = [0, 1, 0, 1, 1, 0, 1, 0]

largest_subarray_length = find_largest_subarray(array)

print(largest_subarray_length)