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

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.

#hashmaps #datastructure #algorithms

[Social]

i try it to understand at 4 more channels but u explain it best, Thanks !

[umangkumar]

this i s most beautiful playlist after doing 2 3 questions i started my own

[AnandKumar-uynn]

Sir Kindly add the CPP snippets for the level 2 questions on the website :)

[tarungupta]

Excellent logic sir ❤ but can you provide the code in c++ bcz nobody tell this in c++ it would be great help for c++ coder if you provide code in c++ as well

[samyak]

Just got this asked in Infor interview.

[RAHULKUMAR-fnfj]

first like and ist view 😂😂😂 always excited to watch videos of pepcoding

[rohansachan]

Sir, the way you explain is just amazing.

[apurvwaghmare]

1st line me h samaj gya jab aapne bola 0 ko -1 karo aur phir humne ye wala question to kiya h longest subarray with sum 0

[rohanaurangabadkar]

Hey I loved your explaination but I have a doubt why at the beginning u considered 0:-1 in hashmap

[shikharsrivastava]

This approach is good, but is there any other approach?

[aviralsrivastava]

sir leetcode pe python se solve karne se TLE aa rha hain