Contiguous Array (Leetcode 525) Solution | Longest Subarray with Equal 0's and 1's

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the Contiguous Array problem where we are required to find the longest subarray with equal 0's and 1's using hashmaps in java. In this problem,

1. You are given an array that contains only 0s and 1s.
2. You have to find length of the longest subarray with equal number of 0s and 1s.

To attempt and to submit this question, click here: https://www.pepcoding.com/resources/d...

For a better experience and more exercises, VISIT: https://www.pepcoding.com/resources/o...
#hashmaps #datastructure #algorithms

Have a look at our result: https://www.pepcoding.com/placements
Follow us on our FB page:   / pepcoding  
Follow us on Instagram:   / pepcoding  
Follow us on LinkedIn:   / pepcoding-education