523. Continuous Subarray Sum | Prefix Sums | Hash Map

[@ARYANMITTAL]

When are you ready for FAANG (Don't repeat these mistakes) - kzbin.info/www/bejne/nmiUiWSMgtRogJI

[@italk-gj5kk]

thanks bro for providing understable solution in 10-20 mins everyday... helps a lot

[@adnanemezrag3809]

Bro you really explained it very well. Thank you very much.

[@AnilKumar-d6y1l]

This Channel Deserves a lot of subscribers , but don't know , why it is on 41K , the quality of content is top notch in a short video length , without a lag , lots of respect brother.

[@youtubeuserlovesyoutube2207]

love you aryan, always love your intuitive solutions where you are not just explaining the code but arriving there ...

[@Aditya-tz5pi]

I tried the recursive and backtracking method but was able to pass only 94/99 testcases after that i thought for the hashing method but was clueless so landed here to know the intuition and was surprised to see the way you have explained it .

[@benzene___]

too good

[@ajayc815]

✌✌✌✌

[@IK-xk7ex]

The brute force approach won't work here because `nums.count == 1e9`, and we will receive TLE because of `n^2` time complexity.

[@lavanya_m01]

this solution is not brute force btw

[@SIDDHANTJAIN-tx7bo]

i stored the remainder inside the map and then checked

[@Samtoosoon]

Cont subarray sum

[@HarizibamV]

Hi, Kindly share codeforce contest solution.

[@ARYANMITTAL]

Yes sir, i really really wanted too, but truely speaking codeforces contests are mostly on weekdays at 8pm & i come back from office at 11pm, thus even if i plan to start it, it will be impossible to continue, as i can't cover everything in 1 weekend (and that too, it will be too late) 🥺🥹

[@dharyajasuja11]

@@ARYANMITTAL can you please share good resources for solutions instead of tutorial because its hard get intuition from tutorials of cf

[@NishantVerma-fj6sp]

Hi, Kindly check this out also class Solution { public: bool checkSubarraySum(vector& nums, int k) { int n = nums.size(), prefixSum=0; unordered_map mp; mp[0]=0; for(int i =0;i

[@abhiiiman]

Worst explanation

[@ITACHIUCHIHA-dr8sz]

skill issue

[@jevinmakwana6811]

bro don't take me wrong but if you practice dsa daily, at least your intuition regarding the topic is matched then no explanation will be Bouncer anymore. jump to solution only after getting little intuition else watch the video 2-3 times until you get it. Ya He's a bit level ahead of us so he has missed some basic explanations :)

[@abhiiiman]

@@jevinmakwana6811 thanks for this suggestion man, I do appreciate it. Also I've solved this on my own using prefix sum got 93/99 test case passed at first 10 mins of solving but I was missing the corner cases and got to know about the map approach too which is really helpful but the way this guy has explained I didn't liked it at all tbh that's why I felt commenting generally I don't do it often.