Prefix Sum Algorithm | Prefix Sum Array | Difference Array | Range Sum QueryO(1) | EP2

Prefix sum algorithm is mainly used for range query and the complexity of prefix sum algorithm is O(n).
This video explains the working of prefix sum algorithm.
This is the second part of the video and please watch the first part (why you must learn prefix sum algorithm) before watching this.
✅ Why you must learn prefix sum algorithm part one link : • Why You Must Learn Pre...
🙋 Problem to solve : • Array Manipulation Hac...
🔴 Subscribe for more and hit the bell 🔔🔔🔔 icon to get video updates:
/ @javaaidtutorials
👍 Like us on Facebook: / hackerranksolutiontuto...
💎Share this video with a TH-camr friend: • Prefix Sum Algorithm |...
✚ Join our community ►
👉 Coding interview preparation group: / codingip
👉 Telegram link for algorithmic tutorial: t.me/javaaid
👉 Telegram link for hackerrank solutions: t.me/hackerran...
✅ Recommended playlists ►
👉 All hackerrank solutions: • How To Master In Data ...
👉 New To JAVAAID ? Watch These Videos: • Prefix Sum Algorithm |...
👉 Algorithms Fundamental: • Algorithms Fundamental
👉 Coding Interview Questions: • Coding Interview Quest...
👉 Dynamic Programming Tutorial For Beginner: • Dynamic Programming Te...
👋 Let’s Connect ►
Git Hub: github.com/kan...
Twitter: / kanahaiyagupta
Linked in: / kanahaiya-gupta
Facebook: / coolkanahaiya
Instagram: / coolkanahaiya
#JAVAAID #HackerRankSolutions #HackerRankTutorials #implementation #prefixsum #HackerRank #JavaAidTutorials #Programming #DataStructures #algorithms #coding #competitiveprogramming #JavaAidTutorials #Java #codinginterview #problemsolving #KanahaiyaGupta #hackerrankchallenges

[@JavaAidTutorials]

Hello Coding Lover,
If you have any doubts , please let me know in comments.

[@MiketheCoder]

Damn. I did this in a codechef contest, and I didn't even know what it was :) !! Thanks for this!!

[@JavaAidTutorials]

most welcome..!! 😃

[@sridevipatil8565]

I saw your video on prefix algorithm

[@MiketheCoder]

@@sridevipatil8565 yay! Thank you!

[@hil449]

wow really? Thats so awesome, to come up with something real by yourself on the fly

[@bidishadas832]

Extremely well explained. Thank You So Much, Sir.

[@JavaAidTutorials]

most welcome..🙂

[@dimitriskaravias1427]

Liked before I even finished watching. So simply explained, slowly and well visualised, and you don't try to sound smart by complicating things. Thank you!

[@hil449]

Thank you so much man. This algorithm is sooo smart yet so simple. Its just mind blowing. And your explanation is very good. Thank you man, you should be proud of yourself because you're helping tons of people here

[@amangoel8724]

you made my day

[@JavaAidTutorials]

👍

[@blueline2694]

Wow, just awesome man... This thing will now solve every possible problem in an array within O(n) time like Maximum Subarray sum, and all.

[@visheshvaidya8625]

Range query formula will be valid when value of i>0 otherwise it gives out of array lower bound runtime error...
Thank you sir for providing such amazing lecture on prefix
sum.

[@akshat2808bspr]

nice one

[@JavaAidTutorials]

Thanks for the visit

[@vibekdutta6539]

This is an awesome channel, keep the videos coming sir, we need them!

[@JavaAidTutorials]

Thanks for the compliment Vivek. these kinds of comments really motivate me to do more and better.
thanks for watching and keep commenting ..:)

[@vibekdutta6539]

And these kinds of channel help us grow, thanks

[@JavaAidTutorials]

thanks@@vibekdutta6539Dutta. I really appreciate it.

[@yasirahmed4197]

Nice explanation

[@mdkashifraza2603]

Thanks for the clear explanation of this concept.

[@gkarthik55]

Excellent😃

[@lokeshp4164]

Well explained, thanks for the video.

[@hirunh4703]

You are better than my Professor at my university Thanks a lot

[@JavaAidTutorials]

Wow, thanks

[@emmanuelay3956]

Very useful, thank you for sharing.

[@saravinfotech]

I just stumbled up on your videos and this was the second video I watched after watching why Pre-fix algorithm. I really liked that you had first put up a video to say what is the difficulty the Algorithm is going to address and then explaining the alogrithm. Wonderful job, keep going.
Is there a specific order which you would recommend for us to follow though the datastructure course? Also can you please add the Hacker rank challenges which might use the specific algorithms which you explain. That would help us practice online on things you teach as well.
Appreciate your good work.

[@JavaAidTutorials]

Thanks a lot @Saravanan for your detailed feedback, I really appreciate the effort you have put in just to write this feedback which generally people ignore but trust me it really motivate us to do more for you all.
I can see you have query upon the video sequence which is a valid ask but i have chosen topic randomly for my channel to see which topic people are liking or getting views because my channel is very small, so need good amount of view for growing.
we have currently 55 videos on our channel but once we add couple of more videos, will define the proper track or playlist how a person should watch the content to gain most out of it. but for now you can pick any playlist or may be start with NEW TO JAVAAID playlist.
Will are trying to add some problems on video description, so that people can go and solve it after watching the tutorial.
Thanks for the appreciation...!!
If you find our content helpful please do share among your friends.

[@saravinfotech]

@@JavaAidTutorials will definitely do

[@JavaAidTutorials]

Thank you..!!

[@VugloTVTVVugloTVTV-jv8rk]

Many thanks sir for sharing 🙂

[@k_dash99]

Best video about this topic all across internet

[@Noone-kl6sc]

nicely explained

[@JavaAidTutorials]

Keep watching

[@preshitha169]

useful

[@sangeethak8866]

i understood it and i enjoyed :) learning this

[@mb77mb66]

Thank you sir for this video.

[@JavaAidTutorials]

Most welcome :)

[@boombot9615]

such good explaination, thank yoouuu

[@sanjeevkumar-iw2lz]

very good explanation, got it in one go🔥. Thank you

[@KevinTheDev2009]

Great video, you saved me tons of time!

[@Spider-Man_67]

Sir, I'm in love with your crystal clear explanation, MAZA AAGYA...GOING TO subscribe your channel now!!!!

[@amangoel8724]

Awesome Brother keep doing the good work

[@JavaAidTutorials]

Thanks you, for your feedback 😊

[@Spiegeldondi]

very good and detailed explanation!

[@praveenambati7804]

Watching your first video. Amazing ! Impressed of your explanation. Subscribed (Y) cheers !!

[@JavaAidTutorials]

Awesome, thank you!

[@surbhitamrakar1638]

Simple clear and accurate explanation..

[@JavaAidTutorials]

Glad it was helpful!

[@shashankdavalgiomprakash2109]

Amazingly explained!!

[@Rahulmohan-mv6nq]

Excellent expalanation!

[@CodeNCode-rm8ci]

Thank you so much sir......very nicely explained.

[@WijLoc]

nice, it's help me so much

[@quocthinh10a25]

keep doing the good work you helped me alot

[@Hariharan0606]

Gold!

[@senkumar17]

Best explanation! Thank you Bro

[@ankitkumarsingh9815]

God bless you Sir!... Thanks for these great tutorials. Please keep doing this, we all love the way you explain us.

[@JavaAidTutorials]

Thank you very much for your feedback..!!

[@ankitkumarsingh9815]

@@JavaAidTutorials please make this channel for competetive coding using JAVA. It would be really great for us.

[@JavaAidTutorials]

Yaa, i am trying my best to help people who is preparing for competitive programming.but without your support its not possible.
So please support us by sharing our Channel.

[@angkonnath-fw4wu]

thanks for this tuto

[@harishkulkarni7244]

Your explanation is very useful sir, and what a great algorithm!

[@yellaharshavardhan9851]

very well explained thnx

[@kevinwang3981]

Thank you so much! Now i got why A[i-1]!

[@mistershaya]

Thank you, it was very helpful.

[@sanjuktasharma00]

Amazing explanation!

[@The43rdDeveloper]

salute to you, improved my code, thank you

[@JavaAidTutorials]

Glad to hear that

[@dikatsogaleboe3640]

This was well explained. Thank you!

[@Pravasith]

This is the most brilliant example on the internet

[@pritisha1]

Very clear and helpful visuals, thank you

[@JavaAidTutorials]

Glad it was helpful!

[@shashankmishra001]

Great explanation ❤

[@ashwini6740]

grt explanation,tq

[@punithajeeva6702]

Thank you so much sir! Slowly & clearly explained !! Keep up the good work 😊

[@JavaAidTutorials]

Most welcome!

[@denismishin9836]

Good explanation, thanks!

[@sudheerpullagura1387]

thanks for making it easy sir

[@deeproy7292]

thanks man...never thought in such a way

[@JavaAidTutorials]

Glad to know that someone learnt something new from my channel. 🙂
Keep learning , keep growing.

[@polesetti]

loved the video, Thanks Javaaid

[@longhk24492]

Nice tutorial

[@MrTaekbeen]

Great explanation! You saved my life

[@JavaAidTutorials]

Glad it helped!

[@elernen9619]

Your videos are so good, I don't even skip the ads

[@JavaAidTutorials]

I appreciate that 😀

[@jabedomurrifat7498]

thanks for this video, it was usefull ...

[@gayatrikorbad2686]

You just clear my doubts very easy , Thank you sir
😇

[@ShreyaSingh-yl9ec]

Such a wonderful and easy explanation! Thank youu Sir.

[@nehemiahdevineedi2028]

Fantastic Explanation! Thank you, Sir.

[@Lucc51]

Nice

[@weaammohamed8992]

So clear thank you!

[@ajayreddytutorials]

Nice one bro 👍

[@JavaAidTutorials]

thank you..!!

[@muralikrish9515]

Thanks brother really i like your explanation.

[@JavaAidTutorials]

Thanks for the feedback 😊

[@vaibhavikhachane6225]

This is mind blowing algorithm

[@rdrahuldhiman19]

i found this very useful to solve array manipulation problem by watching urs that video

[@JavaAidTutorials]

Great 👍

[@vivekvitthalraopatil2775]

great job! this channel is going to cross 100k this year.

[@JavaAidTutorials]

Thanks a lot for your wonderful comment.
All goodies in your mouth.. 🙂
Let's see, but if you find my channel helpful, please share with others.

[@nilanjansarkar100]

Wonderful video. But it would have helped, if you had given an actual problem to demonstrate this technique like you did for the two pointer technique

[@JavaAidTutorials]

thanks, we have added one video link in the description which will help to understand how prefix sum algorithm can be used in actual coding problem.
🙋 Problem to solve : th-cam.com/video/hDhf04AJIRs/w-d-xo.html

[@nilanjansarkar100]

@@JavaAidTutorials Thanks!

[@abhinindroda3754]

your visualization makes everything easier brother thanks for videos

[@JavaAidTutorials]

Glad you like them!

[@antonu17]

Thank you for the explanation. Clear and concise!

[@JavaAidTutorials]

thanks for you feedback..🙃

[@thrivecoder1843]

To the point sir, thank you so much ✌️

[@JavaAidTutorials]

Most welcome!

[@surajpratapsinghsayar7282]

Explained very clearly ✔

[@hmswrth]

Just one word. CLEAN.

[@JavaAidTutorials]

Thank you for your clean feedback..:)

[@ЕвгенийСавицкий-й2щ]

Thanks a lot! Good explanation!

[@JavaAidTutorials]

Glad it was helpful!

[@monicaceisel3139]

Fantastic explanation! Thank you! Very understandable

[@JavaAidTutorials]

Thank you for nice feedback..

[@ashishdwivedi5190]

THANKS for this keep making more such videos

[@JavaAidTutorials]

most welcome @Ashish.
I am trying my best ..!!
mean while, if you find it useful , please share it among your friends..!!

[@persiankingish]

Thank you so much for publishing this video. It helped a lot. If you get the time then please upload more.

[@merhawifissehaye6307]

The significance of the algorithm is visible when you have m queries to make. Having an O(n) complexity just to calculate the sum of a range of elements is not better than using an ordinary for loop. Both have O(n) complexity. But for m queries , the ordinary for loop ha O(m*n) whereas the prefix sum has O(m + n) complexity. Better to close your video that way. Nice explanation though.

[@JavaAidTutorials]

Thanks for the feedback. will keep this thing in mind while making future tutorials.

[@ozzydemir2325]

i was looking for this comment

[@sagarock1012]

Awesome content !!
Sir, very good explanation with pictures understood it very better.
Thank You.

[@JavaAidTutorials]

Thanks a lot, @SagaRock101 for your compliment.

[@venpro8705]

Super bro

[@JavaAidTutorials]

thank you..:)

[@monicagerard900]

Thank you so much for all your videos. Your explanations are so clear and concise.

[@Joyddep]

Simple and clean explanation!

[@JavaAidTutorials]

Thanks a lot, Joydeep for appreciating.
Keep watching..!!

[@spindakiwi1127]

great video

[@dishanamdev2620]

Marvelous Explanation !!! Hats off

[@JavaAidTutorials]

Thanks a ton 🙏

[@nikolaibobrov7230]

Very clear! Thank you!

[@cadenphillips2244]

thank you for the explanation!

[@JavaAidTutorials]

You're welcome!

[@neerajagandla4366]

Very neat and great presentation

[@JavaAidTutorials]

Thank you! Cheers!

[@gowthamvbhat2463]

Thanks a lot. It was very helpful.

[@JavaAidTutorials]

Most welcome..😀

[@shubhammanecr7]

Thanks for posting!!

[@iamdopeasfcuk]

great video! my professor made this sound way more complicated than it is lol. now i need to learn how to do this applied to 2d arrays

[@krishnachandrasekhar]

This is really nice! Thanks for the clear explanation!

[@Anna_handcrafts]

thanks mate

[@JavaAidTutorials]

welcome.. 😊

[@Eng_Aya]

Thank you

[@JavaAidTutorials]

You're welcome

[@arkadiyshuvaev]

Well done, great work! I have been really impressed by your simple explanation :)

[@JavaAidTutorials]

Thanks you very much for your feedback.😊

[@yuewu3888]

Love your video, very clear explanation.

[@JavaAidTutorials]

Glad you enjoyed it!

[@sarthakyadav9950]

The explanation was very nice.But i have a query
So to after applying this algorithm we can access the sum of any index or range of indexes in O(1) time complexity but to find the prefix sum array the complexity is still going to be O(n) so how is this really optimised?

[@pedroadrianpereiramartinez6911]

In a situation where you have up to n queries for example, the algorithm will still be O(n) instead of O(n²) if you do the sum in normal way

[@codedecks]

This is really awesome channel.... thanks and keep up the good work !!!

[@JavaAidTutorials]

Thanks, will do!