Subarray Sum Equals K | Leetcode | Medium | Java | O(n) | HashMap

preview_player
Показать описание
This is a medium level problem and can be solved if you've already tried some more problems related to array. The intuition is not a very easy one but can be made if you think closely.

Рекомендации по теме
Комментарии
Автор

Thank you so much for this video. It really helps when you code it in leetcode after explaining as in other tutorials they just explain and then i get stuck while submitting my code in leetcode.

abhisheksharma
Автор

Do you have a hash function for love? Because you're mapping perfectly to my heart, and I think we've got a match made in algorithmic heaven!

blah
Автор

We can do it in order of n tc and order of 1 space ?

shriganeshgaming
join shbcf.ru