Minimum Operations to Reduce X to Zero | Live Coding with Explanation | Leetcode

[@AlgorithmsMadeEasy]

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!! Questions you might like: ✅✅✅[ Tree Data Structure ] : kzbin.info/aero/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls ✅✅✅[ Graphs Data Structure ] : kzbin.info/aero/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C ✅✅✅[ December Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA ✅✅✅[ November Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e ✅✅✅[ August Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe ✅✅✅July Leetcoding challenges: kzbin.info/aero/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC- ✅✅✅June Leetcoding challenges: kzbin.info/aero/PLJtzaiEpVo2xIfpptnCvUtKrUcod2zAKG ✅✅✅May Leetcoding challenges: kzbin.info/aero/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e ✅✅✅Cracking the Coding Interview - Unique String: kzbin.info/aero/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE Struggling in a question?? Leave in a comment and we will make a video!!!🙂🙂🙂

[@Marvin-om7iu]

I watched several videos and this was the best explanation I seen (I followed the prefix sum approach). Thank you!

[@palashvij7935]

To be honest,I love your content. Please keep up the good work 😀. Your video presentation is by far the best.

[@AlgorithmsMadeEasy]

Thanks !! We are glad you like it !!!

[@akashverma_8343]

Thanks for providing everyday leetcode solutions

[@AlgorithmsMadeEasy]

👍 Happy coding !!

[@shivamd23]

Nice Solution 😊😊😊😊😊

[@AlgorithmsMadeEasy]

Glad you like it !!

[@AdityaKumar-rs5jn]

Thanks for the awesome explanation.

[@AlgorithmsMadeEasy]

Most welcome!! 😍😍

[@anirudhhasinghpanwar682]

i am still stuck at containskey part is that a new method you created i keep getting error for " no member named 'containsKey' in 'std::unordered_map'" (using c++)

[@ComputerScienceSimplified]

Awesome video, keep up the incredible work! :)

[@AlgorithmsMadeEasy]

Thanks !!!

[@weaponkid1121]

please use better examples in the future. the example for the first solution didn't show the concept very well because the subarray was only of length 1, i.e. [20]

[@satraprathore5349]

Does the sliding window work for -ve numbers?

[@AkshayKumar-xh2ob]

The explanation is good but you have not given the intuition behind the first soln.

[@PensivePortraits]

Great content! Thanks a lot ...

[@AlgorithmsMadeEasy]

Thanks

[@hariprasadg123]

can you please explain why are you setting target = -x? because before the code when you explain you don't seem to mention that..

[@AlgorithmsMadeEasy]

you can set it to 0 and then, add another step to update target to sum-x. I am doing it to skip calculation of sum-x by already setting target to -x.

[@bharathkalyans]

Nice

[@rads-jv1le]

Why initiializing map to (0,-1). Please explain this

[@AlgorithmsMadeEasy]

0,-1 says that the at index -1, the sum is 0. This is done so that we get the start of subarray in cases it starts from 0th index.

[@abhishekprasad265]

can u please explain what does for(int i : nums) means?

[@AlgorithmsMadeEasy]

It means, for each int i in nums do the following.

[@abhishekprasad265]

@@AlgorithmsMadeEasy so we are adding i to target by this loop

[@javidasgarov]

@@abhishekprasad265 You are adding each number from the array to target, as been said in the video you need sum - target. So this is the sum of all the number in the array, then (-target)