Pre-Computation using Prefix Sum in 1D/2D Arrays | Competitive Programming Course | EP 13

[@iamluv]

at 18:37 its pf[i][j-1] instead of pf[j][i-1]

[@Raj_Tanvar]

Isi mistake ko point out karne ke liye मैं comment section me aaya tha... But as always आपने पहले ही pin kar rakha tha... Mujhe chance नहीं मिला 😂😂😒

[@EhsaasMohabbat]

u already made us understood very clearly, so now u can code it !

[@vinit5289]

at 3:13 how can we store something at a[n] at i=n

[@adarshchaudhary7811]

@@vinit5289 take a[N] . its not a[n]

[@rajeeell]

@@Raj_Tanvar wow so funny maza a gaya😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂

[@exam_dost]

your first 10 videos are enough for whole competitive programming course. I have seen lots of competitive programming tutorial but the specific cp tricks are shown by you only. Amazing man. IIIT guys are known for their deep knowledge is real.

[@TheArchit1]

🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣

[@vinit5289]

at 3:13 how can we store something at a[n] at i=n

[@sougatasingha9587]

@@vinit5289 bro he create a global array called "a" and its size was 10^7 a[N] where N=10^7 and he took "n" as user input so he can store upto 10^7 element in that array

[@vinit5289]

@@sougatasingha9587 thanks

[@itz_me_imraan02]

Your videos are addictive 🔥

[@EhsaasMohabbat]

yes really!!! same here..

[@rickk3300]

Correct bro..😂😊👍

[@shrishtijain3788]

Same here🔥🔥

[@sarvaswamohata9693]

2 years and still it remains the best available resource for cp over the internet❤❤

[@yourbestie4138]

always on time - your video uploading time complexity is O(1) and space complexity is O(full of knowledge)😁

[@abhishekanantharam645]

Kya baat hai😂 Kal hi I encountered a 2D prefix sum based problem in a test. Appreciate your effor bro thanks💥

[@aviralsrivastava3409]

Best. Course. Ever.

[@TheArchit1]

😂😂😂😂😂😂😂

[@husandeepsingh3616]

i started this playlist a week ago I really learned a lot until now and will keep learning more from this channel really liked the lectures

[@sawandeepgavel54]

That prefix sum of 2-D array was tricky and you explained it ingeniously...... ❤️❤️

[@barnikroy5244]

Btw......bhaiyyaaa ye course 2 lakh ka he because of tutoring plus problems......total package......aap please paisa ka matt sochna......aap ke job aisahi bohot paying he.......ye aapke couse aapke liye poor students ko gift he........you are one of those best persons still prevailing on this earth

[@aryanverma7800]

bro you will not get such course even after paying money.......its not about rich poor........if you can buy a laptop, pay engineering fees then you can also pay 10-15k for a good course

[@silverzero9524]

@@aryanverma7800 laptop aur fees bhara isliye hi paisa nahi bacha lol bohot high fees hai yaar engineering college ki aur education bilkul worth nahi utna

[@jhashivam28]

Bestest ever competitive coding course on the internet 🔥👍

[@AshokKumar-ix4nf]

Bhaiya aapke karan mujhe Cpp se pyar ho gya thanks.... Yt me bahut saare lectures h but aapke explanation ka koyi jawab nhi isi tarah video's bnate rahye.. 🤗🤩

[@ShubhamChhimpa]

Must say you explained this in the best way.

[@TheArchit1]

🤣🤣🤣🤣🤣

[@kartikforwork]

@@TheArchit1 🤣🤣🤣🤣🤣🤣🤣

[@subratkumar1001]

Happy new year sir, it's new year night and i'm watching your lectures. these lecture qualities are way above than others. please sir continue the lecture series for advanced CP (acm icpc, etc). you are amazing sir.

[@thegreekgoat98]

My heart cries when educator like this aren't famous enough. Man, I challenge everybody here, if anybody show me better coding teacher than him, I will change my name..

[@Rafiqul.Islam4]

Your videos are awesome... You not only help Indian students but also Bangladeshi students... One of my Indian cousin recommended me your playlist. And your way of teaching is on point. And I also shared it to my friend zone & they also liked it. Please continue this & we really enjoy your teaching.....

[@harshitrathi3077]

Was Waiting For This Video..... Thankyou Bro.... Keep On uploading more videos on CP

[@mohammadAmmar71]

bro you are the pioneer of cp for me,,btw God bless u..love from Bangladesh/

[@AppaniMadhavi]

At 7:20 luv proved that he is a logical thinker.👏👏

[@uditkatyal5090]

those who are getting confused with size of prefix array - for 1 based approach u must take N+1 size of array to accomodated nth index unless it will give segmentation fault (accessing the memory which we don't have)

[@riyayadav2362]

8:30 He had already taken N greater than the given value of N So we can access the nth index of pf without the segmentation fault. It had taken my 15 min to understand 😵‍💫

[@stevefox2318]

just amazing you're doing great luv

[@TheArchit1]

😂😂😂😂😂

[@shridharsarraf2188]

Luv bro, explains the most important things in the most easiest way. I'm observing growth in my CP skills, just in a week😄

[@sidhantnahak4481]

Literally after watching your videos confidence is getting high towards cp

[@AsuBeats]

Crystal Clear Explanation! Best for Beginners to grab the concept!

[@TheArchit1]

😂😂😂😂😂😂

[@vinit5289]

at 3:13 how can we store something at a[n] at i=n

[@lakshmisravyak5517]

you are gem,really informative ,you helped me alot in improving my problem solving approach

[@swapnilkashyap3188]

Really appreciate the kind of hard work you have put to compile such high quality videos, n that too free. Hats off man.

[@sagarbarpanda8749]

I am loving the course. Just a minor comment in this: In 1d array prefix sum, you have taken elements as int pf[n]. I think it should be long long int pf[n] as taken for 2d. It can exceed the int values.

[@good114]

Thank you Bhaiya 🙏🙏🙏♥️♥️

[@funenjoynilaypatel4553]

IIIT guys are known for their deep knowledge is real.

[@shreyasnaphad3284]

Wow! This is awesome man!!! Keep on making videos on CP.

[@Aditya_singh413]

11:44 didnt get how the loop will go from a to c and b to d????????????????????????

[@mdshadan-7312]

Your channel is on of the best programming hindi channel

[@TheArchit1]

🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣

[@towhidhasan7426]

I am from bangladesh, you video is very much informative and clear to understand. Thank you so much. Go ahead

[@itsmesohit]

Great explanation brother 💙

[@ManishKumar-px1wv]

Love to watch this video. Thanku very much

[@tarunchauhan1025]

I love the way you teach and explain..... Thanks Bhaiya..... Keep uploading video .....

[@moonwalkingdancer8369]

i shud agree man that after watching this i solved 5 leet codes on my own thnks a lot

[@tusharsaxena8239]

keep up the good work bhaiya, maza aa gaya

[@shivamkumarmahato3409]

Bhaiya please start vector ASAP... Qki avi tak itna vector ka video dekh liya hu concept clear nhi hua hai.....m damn sure ki aapki video se ache se clear ho jayega... Isliye so excited for that topic... The way of ur teaching awesome.... Even nit/IITian teacher failed... 🥰🥰 Love u from Nepal 🇳🇵 ❤❤❤

[@iamluv]

krke bhai stl shuru krne sephle basics kaafi cover krne hai.. nhi to ache se smj nhi ayega sbko

[@shivamkumarmahato3409]

@@iamluv ok bro.. Nop problm... Itna kar rahe ho yeah v kaafi hai... Aur please ek baar topic ka ek sample sa roadmap bata do taaki aapki video aane se pehle woh topic ko leke todha google kar k padhlu basics knowledge le lu phir aapka video dekhu taaki uss time aur v ache se samajh aaye... Bas ek baar bata do aap kaun kaun si topic cover karoge...?? Please🙏🙏🙏

[@ujwalapatil650]

Thanks for giving valuable knowledge

[@Mrbestvlog2012]

Very much addictive videos and much better than paid platform

[@SHASHANKRUSTAGII]

I dont you know, you guys noted the time , but i did, great improvement from 6 seconds to 5.1 seconds. :) @22:24

[@tusharagarwal5306]

Point?

[@codekiller3061]

wow...thank u so mch bhaiya.....i jst love your content .....u r doing gr8...i am learning a lot from u❤❤

[@MayurZinc]

very underated channel. Please support him guys

[@kshitijmishra2716]

i am addicted to your videos

[@devenderkumar-pr6ig]

best video for cp

[@gigachadkartik]

Sir please also teach maps, sets and various STL types

[@rishantkumar2408]

everytime he says "aise hin naam diya hai aisa kuch khaas hai nahi" i am like ---Gajab (it makes me feel that yeah it is easy )

[@Amansingh-il9rn]

owesome method of teaching , bhaia keep it up , we always be with you in learning process.

[@magnifyknowledge746]

luv bro i love you yaar great explanation . Fantastic video.

[@ENGCS_chetanr]

Sir ur awsome the explanation is on next level keeping giving us these type of knowledge Love u ❤️❤️❤️❤️

[@sujitpatil8373]

why did you not create the prefix sum array size (n+1) * (n+1) ? You said that you will be adding 1 horizontal and 1 vertical row to handle array index out of bounds cases?

[@abhishek04204]

After yesterday's cc lunchtime I saw this very helpful ❤️

[@yashmishra3898]

at 21:47 i am not understanding why the prefix sum of(c,b-1) does not contain the point (a-1,d) and (a,b ) also ....i mean it will calculate sum of each element till that index

[@iamluv]

suppose a 2 d array 1 2 3 4 5 7 prefix sum array of this 2 d array is 1 3 6 5 12 22 (you can try calculating by. the formulae i discussed before) Assuming 1 based indexing, here (2,2) with values has sum (1,1),(1,2),(2,1),(2,2) = 1+ 2 + 4 + 5, it doesnt have 3 (1,3), so if 2,2 doesnt have 1,3 why would (c,b-1) will have (a-1,d) in 2 d prefix sum array a cell (i,j) is storing sum of all the squares lying in the rectangle formed by (1,1) and (i,j), hope this explains

[@ahmmedabdullahsaquif559]

Thank you Sir.. love your teaching way

[@kunalkeshavsinghsahni6861]

most of the questions in descriptions use hashmap more than pre computation. It would be great if you could upload some relevant pre comp problems there.

[@yourbestie4138]

Bro I have doubt that is google does visit our college to hire for cloud engineer but after joining for it can we make a switch to SDE at google if yes how tough is it ...or is it best to join Morgan Stanley(on campus) as SDE compared to google cloud engineer

[@vishalchaurasia3386]

This is awesome!!!

[@kbwsoikat]

I appreciate your effort!

[@harshagarwal1218]

Great Explanation🔥🔥

[@souvik5560]

@Luv No praise is enough for this initiative. Just a small query :- pf[0] may contain some garbage value, which would get added to p[1]. so, should we initialize pf[ ] array with 0 ?

[@iamluv]

i had declared pf arrays globally, global array in c/c++ by default have all values as 0. if you would initialise locally then you would have to initialise whole array as zero as it will contain garbage but not in case of global arrays as i did.

[@manikantasai6118]

Nice Teaching with great energy /...............bro

[@Anshika.Agrawal]

Very nice and easy explanation 👍🏻

[@imran4935]

Bro you are so incredible 😭

[@sujoyseal195]

Video kaafi achha lga .

[@rudranshnemade6299]

Best Video 🌈🌈🌈 Thank you 🌸

[@saminisrak5506]

Very Helpful videos.. Thank you..

[@merlin2012]

Awesome Explanation

[@ankityadav-xd5ld]

Amazing lecture

[@kiku_to_herself]

Mashallah Bahut acha h

[@MehedihasanRaj-cz8zv]

Brother, you are awesome. From Bangladesh

[@jatinaggarwal2671]

Nice Explanation bro! Thanks a lot.

[@abhishekvishwakarma9045]

Ek number🔥🔥

[@ItsRavinderSinghh]

Awesome explaination

[@RitikKumar-bk6pj]

Muje toh bahut bhadiya lga bhaiya

[@dhruvjain2209]

damn ... very well explained .. Respect!!

[@aradhyapandey1489]

very well explained, thank you bhaiya.

[@dhritisingh9595]

Really nice explanation

[@yashmishra3898]

at 16:02 also sum till (2,3) will not contain elements like 2,4 and 2,5 or 1,4 and 1,5

[@iamluv]

that is exactly what i said in video

[@rounakagarwal1600]

video was very good and thanks for giving practice question

[@jay8389]

Great explanation!!

[@codeAsCoder]

😀 mast 💯💯💯

[@abhishekmorla1]

best

[@elemento8763]

Awesome video, once again Sir, in fact today only, I came across a question based on Prefix Sum in 2D array, thanks a lot, Sir!

[@govindsharma7696]

East or west Luv bhaiya is the best :) Lots of love amd respect for u bhaiya .

[@almoontasirmoon933]

awesome tutorial bro

[@pansgami8954]

Nice Explanation bro...

[@adarshdubey1784]

U nailed it 🔥...bro make 1 video to find out time complexity of recursive Function ..I always face difficulty while finding time complexity of recursive Fun

[@sahilchhabra2391]

Nicely explained sir

[@vedantkulkarni9098]

Can you please do or suggest a video on range query in 2D array like how you have done in 1d array where we had to add integer k from l to r in constant time

[@arafathdhroba8897]

thank u very much sir!!

[@kiku_to_herself]

Good one Thanks sir

[@lily5469]

Hi, Is there English version of your course?

[@Learner010]

very nice explanation

[@GauravKumar-uu9lg]

Bhaiya aap 1000 sal jiyo

[@bibekanandanayak8839]

I love you bro please keep it up

[@sanketatmaram]

good explaination

[@rahulkadam6655]

Thanks a lot 💯

[@mohan_792]

at 9:42 On line 23, pf[i] = pf[i-1] + a[i-1]; hona chahiye na Nahi to array index out of range chala jaayega

[@sit33darshanpagar16]

Prefix sum array should be of long long type? 🤔🤔