Count Number of Nice Subarrays | Leetcode 1248

[@_hustler_boy]

aapne kitne coding questions kre the and kya important topic pe jyada focus kiya tha

[@097mazharsaifi8]

Hey ma'am, I have a doubt about the code you posted for finding a subarray with sum 𝑘. Why are you checking if the sum is present in the map before or not, and then initializing it with 1 if it's not present and incrementing it if it is? There's no need to initialize it; just increment it without checking because the map already maps it to 0. i solved this one doing this and finds no error...if(m.find(sum)!=m.end()){ m[sum]++; }else{ m[sum]=1; } here's your code

[@yashmundra8497]

Was waiting for your video, but had solved on my town this time🤭🔥🔥

[@AyushiSharmaDSA]

that's awesome :)

[@rushidesai2836]

Congrats for Microsoft Ayushi!

[@AyushiSharmaDSA]

thank you :)

[@rishiraj2548]

👍👍