Pre-Computation Techniques Basics & Hashing | Competitive Programming Course | EP 12

[@iamluv]

at 4:42 , i forgot to take modulo when storing factorial in array, line number 21 at 4:42 should be fact[i] = (fact[i-1] * i ) % M;

[@unityleveldesign4878]

Mai bhi yahi comment karne ke liye aya tha per dekha ki appne pahle hi comment me pin kar ke rakkha hai, salute you LUV Bhaiya.

[@quirtt]

@@unityleveldesign4878 orz

[@005lemdshahbazkhan2]

Bro dry run krk btaya kro yrr

[@psibarpsi]

15:21 Why can't we just have a local hash array with size n (input by user)? It would have a better space complexity as compared to the given code.

[@darshantawte7435]

@@psibarpsi It is basically done to avoid passing arrays to functions which is a hassle. And in reality companies never use global arrays in software development but in competititve programming no one cares to optimize space if your answer is accepted by the coding platform.

[@mohitshrivastava8897]

Bro, The content is so good that I felt guilty of skipping the ad. so I played the entire 2 ads of 2 min each :D. I urge every one to do the same as a gesture of appreciation and gratitude. Thnx again!

[@iamluv]

Haha.. I earn well from my Full Time job, i don't do youtube for money, The ad revenue whatever little it is there is used to improve content quality on youtube. Thanks for your support ❤️

[@mohitshrivastava8897]

@@iamluv I know Directi pays well but just my token of respect towards you❤️

[@rishikaarora8267]

​@@mohitshrivastava8897 Directi pays him for his job. There was no sense of mentioning this in comment that you skipped ads or not. You don't know how hard he is actually working for managing this youtube channel along with job. If you genuinely said that for any kind of support then it's good. But if that was for discouraging him then it's better you make a new playlist for us without ads. :)

[@mohitshrivastava8897]

@@rishikaarora8267 Wow... Amazing how one can find the comment as discouraging ( specially when Luv replied with "haha", and acknowledged the comment)🙄. Stop looking at everything through a cynical lens, the world will be a better place... Trust me. Peace ✌️

[@prashantdwivedi1736]

@@mohitshrivastava8897 Mai bhi vahi soch raha tha....isme kya offend hua ye

[@harikrishnan204]

bro i am loving your CP series..keep up the great work! Looking forward to more videos in this series

[@itz_me_imraan02]

🔥 wish this playlist becomes the best for CP

[@vivekshelke9788]

This is

[@rickk3300]

Bro, this is the best playlist ever for CP

[@priyeshtandel2101]

Building more interest...😇

[@vaibhavis1]

You are doing nice work buddy, unlike other KZbinrs of similar type. Be like this, natural, direct, and no nautanki. :)

[@darshantawte7435]

The best thing about this course is the structured format. I never knew when to use precomputation until now.

[@devilgaming6182]

Practice Question 9: bool containsDuplicate(vector& nums){ map mp; for(int i = 0;i < nums.size();i++){ mp[nums[i]]++; if(mp[nums[i]] > 1) return true; } return false; }

[@amanrubey]

So many people's future is resting on your shoulders. Thank you sir. It is making an impact.

[@HDbIce-oj3wv]

Top Notch ❤

[@anshupandey1782]

kal hi contest me pre-computation ka question nahi hua aaj aapka video aa gya :)

[@saismrutik8101]

Your explanations are priceless bhai Keep going and please complete this series whatever happens♥️

[@devilgaming6182]

Practice Question 11: const int N = 6e4 + 1; int singleNumber(vector& nums){ int ans, ash[N] = {0}; for(int i = 0;i < nums.size();i++) ash[nums[i] + 30000]++; for(int i = 0;i < nums.size();i++) if(ash[nums[i] + 30000] == 1) ans = nums[i]; return ans; }

[@abhishekhorton79]

It's something called memoization which is used to solve DP problems Apart from that, I'm enjoying your playlist you're doing great work for students like me, please complete this series ☺

[@codeguy21]

bro i have a doubt why are we taking long long fact[N] outside int main why not inside ?

[@uraharakisuke5305]

@@codeguy21 cause the number of elements you can store inside an array which is declared locally in some function is of the order of 10^5, whereas if you declare array globally, then the number of elements you can store is around 10^7.

[@suyashrahatekar4964]

Bhai itna organised aur quality CP / c++ course shayad hii koi provide kar sake.

[@darshantrivedi5390]

Thanks bhai You are great 💯💯

[@yourbestie4138]

Today is Guruvar and your our favorite Guru(teacher)💗😍👌

[@nityasingh8276]

Oh god i was about to learn pre computation and here comes your video. 🌻

[@Siddharth_Nayak_official]

Really loved your content luv...u r helping me...thanks biro❤❤❤

[@EhsaasMohabbat]

great voice aur samjhane ka level bohot hi badiya hai sir apka! impressed.. first time watching but now onwards i will watch all videos of yours to learn competitive programming..

[@de_ansh]

I started late with competitive programming , but your videos have been great help . Thank you so much sir

[@letsOpenOurEyes3]

at 17:25, code run time in terminal showing 7.0 sec instead of run within 1 sec ?How? Does it depends upon system?Please explain sir.

[@shaantyagi2187]

dimag khul gya bhai maja aa gaya. Well done and thanks !

[@bikramdas3157]

Best tutorial for CP luv vaiya. Lots of love for you vaiya❤️

[@iRafi077]

it was this moment I realized why cp in actually imp. thank you! take love from Bangladesh!.

[@abhishekvishwakarma9045]

Ek number bhai 🔥🔥👌 best video on pre-computation for beginners lage raho😎

[@shawonhussain07]

15:15 const int N = 1e5+10; am i right? BTW love from BD

[@syedmunawaralirazvi2002]

You teach really in a fantastic way....................FAN of your teaching skills 👌

[@stevefox2318]

Going to become best KZbin channel for CP

[@DashingChannel]

Your content is gem 💎

[@kinggamer11006]

Isme function bna kr while t-- me passs bhi to kr skte the

[@sahilDa997]

you are a genius bhaiya keep doing this..

[@aayush5474]

Explanation is best!

[@devilgaming6182]

Practice Question 4: const int N = 1e6 + 1; long long int pf[N]; int sumSubSubarray(vector& arr, int k){ long long int ans = 0; for(int i = 1;i

[@anmol3]

You can use "hashmap" instead of hash arrays if the value exceeds 10^7

[@vibhorgautam9928]

Great video bhaiya!!

[@VikashKumar-uy9ge]

Amazing explanation

[@abhaychaturvdi]

best tutorial for cp

[@kishanpatel3354]

Too good, thanks man!

[@iamdj8540]

bro same hashing technique, we use in count sort for sorting array

[@vedantgolash6084]

amazing luv bhai 👌🏻

[@manishkasera8584]

Ek number

[@surjeetsingh-cp6hn]

Quality content as always

[@navendraagrawal]

I was using hashing from a long time and didn't knew that it is called hashing 😂

[@JesanKhan-gc6sr]

Same bro

[@developskills9253]

one day u get the luv 💓 from whole world

[@attadaramprasad1228]

Sooo nice explanation bro...

[@oyeeyedhaikilokahathh3370]

Bhai you are legend ❤️

[@AgnivaBanerjee6]

Thank you!

[@entertainmentworld5276]

Awesome.. ♥️♥️

[@shivamkumarmahato3409]

Awesome Explanation. Love you from Nepal 💗😍👌

[@rahulkadam6655]

Thanks a lot 💯😄

[@dakshnaik476]

Thank you!!!👌🏻👌🏻👍🏻

[@ShubhamPandey-st4nn]

Superb

[@VaishnaviNigam]

LIKE SERIOUSLY ??? SO CLEAR SO CONCISE I MEAN SPEECHLESS ......... HATS OFF LUV SIR 😍😍😍 BESTEST EVER PLAYLIST FOR CP

[@sahilnegi2789]

Bhai apsa ek bar life ma milna chahenga apna meri bhut help ki hai . thnks again

[@joeljacob4685]

Nailed it👍🏻

[@devilgaming6182]

15:45 what if a[i] is negative.

[@SumanKumar-mx1cq]

Thank you

[@irfanquader3944]

great content bhaiya

[@stocks4Trading]

Love You Luv Bhaiya

[@reetpriye8807]

Thanks bro🙏💕

[@atharvakulkarni3007]

Mast explanation 😍

[@brandedmunda6281]

Best vieeo for beginners

[@AmitKumar-zm3vt]

In the hashing question discussed, since range of array is positive , if it will be negative then, how to calculate it ?

[@sagnikdas1780]

Thank you bhaiya

[@TheBold-je8ci]

N ki value upr "1e5" h toh fir program likhta vhkt const int N ko " 1e7 + 10 " ku declare Kiya? Timing : 15:15

[@babarazam56569]

you are joss vai!🥰

[@mohdaasimqureshi7115]

keep going bhaiyya

[@sushmapandey7145]

12:36 we can use map also

[@iamluv]

Firstly i havent taught map untill this lecture hence not using it, secondly its faster to use array based hashing whenever its possible to do so, its faster than using maps.

[@sushmapandey7145]

@@iamluv thanks bhaiya for this information.

[@Nirala_414]

Simply great work Bhaiya... Mere ko pata na kitna khusi ho Raha aapke channel milne se .... Thankyou for your hard work

[@ankurpandey_0122]

Thanks bro

[@prathameshkinagi3720]

Thanks

[@nolan9546]

Bhai Finally I got the exact medicine as I decided to follow your tutorial. Lots of Love Bhai.

[@md.annahianprince9180]

In 2024 this is very good video for programmers!😍

[@Faisal_89]

best bhai

[@yutaitadori7318]

Wow♥️🔥

[@siddharthsahu7185]

love you bro

[@Raj-fi5ui]

Map also do the same work as hashing right?? Calculating frequency of elements ?

[@KCOMohammadRehmaan]

Bhai please playlist ko beech me adhoora mat chhodna we all are really loving it please isko continue rakhna.

[@zafdell8170]

Mja aa gya 😀😃🤣☺

[@october3518]

I am quite overwhelmed ryt now.... this is the third time I have found a treasure in my programming journey! truly sparking my curiosity and intrest in cp ! Thankyou for the good content :-)

[@maycodes]

Please do a video on CP templates

[@rahulbera454]

Thanks bro 🔥🔥🔥 amazing video

[@aryanverma7800]

pls upload practise problems also sir

[@iamluv]

next video me daal dunga

[@Agent_Ax]

Bhaiya Maine Map Use Kia Aur map[n]+=1; Then Printing map[n] question ke lie ye chalega kya?

[@iamluv]

haa vo bhi chlega.. is point maps ke btaya hai furure ki videos me jha map pdhaya vha ye sab bhi btaya hai also for hashing its better to use unordered_map as compared to normal map. Watch maps videos for details

[@FaisalKhan-oy4zz]

🔥

[@kamalkumar945]

bhaiya please ye series continue rakhna ICPC level tak

[@kiku_to_herself]

Loved ittttttt

[@deviltvpublication922]

Best explanation about precomputation technique🔥

[@romanrai2507]

Well , This is the Best series watched till now.

[@GANESHSINGH-oe2wy]

🙏🏻 🙏🏻Sir, aap padhate waqt highlight krne ke liye konsa softwate use krte ho (jo laser jaisa dikhta hai phir apne aap gayab ho jata hai) 🙏🏻🙏🏻

[@sbndBhanu546]

yes sir but in this case space compexity increase know to O(n) so then is it good in cp

[@adarsh6109]

🔥🔥🔥🔥🔥🔥🔥

[@shajidulislam2783]

I just wanted to know if the problems given in the description can be solved with the technics shown in this video or do I need to watch other precomputation technics too?

[@Rahulkumar-op9lu]

Bro if size of care is 1e9+ then what will u r approach for that....for 0(n) ....

[@iamluv]

if you want o(n) in those cases then your have to write custom hash functions or you can use unordered maps which do the same.

[@aadityasharma6855]

Loving your videos, please continue this series. Thanks a lot

[@SumanKumar-mx1cq]

Sir good typing

[@devilgaming6182]

Practice Question 10: const int N = 26; int te; cin >> te; string s, t; while(te--){ cin >> s >> t; int S[N] = {0}, T[N] = {0}, steps = 0; for(int i = 0;i < s.size();i++) S[s[i] - 'a']++; for(int i = 0;i < t.size();i++) T[t[i] - 'a']++; for(int i = 0;i < N;i++) steps = steps + abs(S[i] - T[i]); cout

[@veerusingh1981]

Bhiya pre computation Kay liya hum COUNT() function nhi use kr saktey ??? Last hashing wale question may

[@devilgaming6182]

Practice Question 2: const int N = 1e5 + 10; class Solution{ public: vector findMissing(vector& a, vector& b){ int ash[N] = {0}; vector ans; for(int i = 0;i < b.size();i++){ ash[b[i]]++; } for(int i = 0;i < a.size();i++){ if(ash[a[i]] == 0){ ans.push_back[a[i]]; } } } };