Lecture 112: Perfect Squares Problem || DP Series

[@mohd.irfanlohar4544]

we can also put ans = INT_MAX rather than n it is quite easy to relate with the minimum situation

[@tejasshaha6629]

Bhaiya tabulation wale approach mai line no 49 pe instead of for(int j=1;j*j for(int j=1;j*j

[@MittuRohith]

If you have come this far watching this videos.... Congratulations you are in top 10% keep putting your efforts ,you will get success... thanks you love barbar for your efforts

[@narendra-mahto7649]

Paid course lene ke bad Bhi yahi lectures dekhne ka man krega.....Bhai ❤ Thanks Bhaiya❤

[@vishalgarna4580]

This series never forget in education life ❤❤❤

[@barnikroy5244]

achanak kuch mahine me aap dsa dunia ka badshahh ban gaye.......kudos bhaiya

[@shubhamtripathidev]

Recurrence code int minimumSquareNumber(int num , int target){ if(target == 0) return 0; if(num < 1) return INT_MAX; int take = INT_MAX; if(target >= num * num){ take = 1 + minimumSquareNumber(num , target - num * num);} int notTake = minimumSquareNumber(num - 1 , target); return min(notTake, take) ; } int MinSquares(int n) { int num = sqrt(n); int res = minimumSquareNumber(num, n); return res; }

[@udaytewary3809]

Really maja aa gya bhaiya maine abhi tk dp.padhi nhi haa lekin kuch kuch samaj me aya mujhe iske liye thankyou bhaiya 😇😊🙏🙏🙏

[@sukhjitsingh959]

Babbar Sir Watching all of your DSA Series until now and doing practice But still pending DSA video to practice .. so Thanks for all these series to Crack Top company jobs

[@vedantraut256]

// COMPLETE CODE WITH COMMENTS class Solution{ public: int solve(int n){ // base case if(n == 0) return 0; int ans = n; for(int i=1; i*i

[@rockkids8932]

Garda Uda Diye hai , Bhaiya

[@sachin6525]

Lots of love Bhaiya from Odisha ❤

[@mriduljain6809]

Loving this Series Bhaiya!! #BelieveinBabbar

[@lucario4399]

@3:00 Code @9:11

[@codingisfun-pranayharishch3001]

bhaiya apna khud ka course bechte h pr dusro ki promotion bhi krte h 😂 well jokes apart, bhaiya ne mast dp padhaya thank you bhaiya ♥

[@codewith_ayushluthra5248]

Best Placement course ♥

[@codingindisguise]

Enjoying thisss at next level🔥

[@RahulKumar-wt9qc]

Still in backtracking but came here to support you bhaiya 🥰🥰🥰

[@kashishchawla2754]

😂

[@abd9641]

I'm Starting your DSA course bhaiya wish me good luck, i assure you within 2 months I'll complete this...

[@gajendralabana4006]

Bhaiya DP pr to Bhool Bhulaiya 3 bn jayegi love u love

[@shoaibkhan6022]

I can say with confidence that this is the one of the best DSA course in the world. Love from Pakistan 🇵🇰❤️ bhaiya

[@alexrcrew1975]

man dsa also matters in pakistan

[@shoaibkhan6022]

@@alexrcrew1975 haha yeah bro ❤️

[@dakshsinghrathore9584]

nice to see we can unite through Technology..... btw do FAANG companies have their offices in Pakistan ??

[@shoaibkhan6022]

@@dakshsinghrathore9584 no bro 🥺

[@dakshsinghrathore9584]

@@shoaibkhan6022 ooh

[@chiragagrawal4041]

thank u bhaia u are a one of the best teacher

[@rohitjadon7268]

a lot of thanks for this amazing free content

[@piyushk_071]

Amazing explanation bhaiya🔥🔥

[@nishankdeep3084]

thank you bhaiya maza aa gaya bhaiya

[@jeetdesaimusic]

Great explanation! Thank you bhaiya🙏

[@iteself_me]

81✅completed 👍Liked 2:55

[@dEviL_bIsWaJiT]

Love you bhaiya ❤️

[@Carnage-X]

use j

[@shreyashdubey5989]

Thank you Bhaiya, Just keep going... More strength to you . This is helping us a lot✨✨✨✨

[@sachin6525]

Thoda feel lene ke liye yaha aaya tha .. Just completed Bsc and about to take admission in MCA

[@alexrcrew1975]

which clg

[@oqant0424]

Thank you Bhaiya

[@glaciar_range3270]

respect = INT_MAX;

[@pragyaverma2105]

Thank u ji ❤

[@KACodes]

400k 🤩🎉🎉🎉

[@shristisethiya4433]

Great explanation

[@jyotiradityayadav6247]

Mza aa gya Bhaiya

[@codeforlifehere]

Day 4 of DP

[@sagnikmodak4178]

Thanks sir

[@shubhamtripathidev]

I think we wiil

[@ANSHIKAJAINPCE21IT009]

you are amazing

[@nopecharon]

Nice explanation

[@HarshRaj-kp7gk]

#love bhaiya ❤️❤️

[@dipakkumarsingh.7151]

very good

[@shubhamtripathidev]

tabulation code int num = sqrt(n); vectordp(num+1, vector(n+1, -1)); for(int idx = 1; idx < num + 1; idx++) dp[idx][0] = 0; for(int col = 0; col < n + 1; col++){ dp[0][col] = INT_MAX; } for(int row = 1; row < num + 1; row++){ for(int target = 1; target < n+1; target++){ int take = INT_MAX; if(target >= row * row){ take = 1 + dp[row][target - row * row];} int notTake = dp[row - 1][target]; int temp = min(notTake, take); dp[row][target] = temp; } } return dp[num][n]; }

[@KratosProton]

Great explaination

[@fazerugbrug439]

loved it

[@rafalefighter6207]

thanks you bhaiya

[@RandomGuy-xq1hk]

Nice video 😇😇😇

[@atharvgupta4218]

Leetcode 279

[@tannubansal1718]

Thankyou bhiya ❤️❤️❤️

[@shivatrivedi6964]

he is not Bhaiya....... he is LOVE....

[@vikassahu6002]

Awesome 👍👍👍

[@sarangkale6761]

Liked👍🏻

[@premsingh6967]

[@premsingh6967]

[@bhuppidhamii]

Accenture ASE is asking this Q's 🙃

[@alishaverma4071]

cant we optimize using a shortcut? like using float after cal under root of target number and then subtracting it with the sq of the whole no it comes closest to??

[@mohammadatif1235]

I have learnt alot from your lectures.Thank you bhaiya for this amazing dp series.

[@saurabhmishra-nn5xs]

Sir please arrange also contest sir

[@amitnagdev7061]

Bhaiya apne 5 ka example liya tha usme answer 2 aana chiye n kyuki hame 1 aur 2 ka square utilise karna pad rha hai?.

[@Geetanjalichawla]

🔥🔥🔥🔥

[@rahuls1147]

Just completed Trees now will revise once & then start 🔥🔥

[@aniketambat6334]

understand++

[@B-NikhilRichhariya]

done

[@AbhishekKumar-vl3cb]

🙏

[@shreyaghosh4233]

bhaiya dp sheet ki link bhej do

[@shachisinghal8856]

Sir i cant think logic on my own. Pls guide 🙂

[@shubhamtripathidev]

can we write the code without using for loop

[@shoebsifat6]

Love you brother, Love from Bangladesh 🇧🇩

[@dakshsinghrathore9584]

kamon acho dada ?? am from WB btw 😅

[@abhijeetbasfore6816]

bhaiya notes update krwa do

[@akhilpanwar6974]

swad++

[@KratosProton]

a

[@ayaz.unstoppable]

Bhaiya keep doing it

[@mayureshveeramallu7023]

AWESOME CONTENT BHAIYA WATCHED EVERY VIDEO OF YOURS AND TH EXPLANATION IS TOP NOTCH. CAN YOU PLEASE MAKE A SIMILAR PLACEMENT PREARATORY COURSE ON SYSTEM DESIGN PLEASE!!

[@KratosProton]

t

[@lakshyabaliyan7917]

Bhaiya leetcode par qus solve nhi ho rha hai.....anyone help😭

[@kushalchakraborty6970]

Start with easy questions. Try atleast for an hour. Still if you can't figure out the solution . First see editorials. Still if you can't figure out , then watch a solution video on yt. But at first try to get a strong base in DSA . I hope this will help.🙏🏻

[@lakshyabaliyan7917]

@@kushalchakraborty6970 bro lekin leetcode pr to qus ka format hi blkl change hota h krne ka kuch smj hi ni aata

[@alexrcrew1975]

time lagega bhai dhire dhirr hone lgega

[@KratosProton]

e

[@souravmehraniya2832]

bhaiya orkitne videos baki ha is course me ? i mean kitne or videos me compelete ho ajega ye course ?

[@vishalsinghshekhawat6921]

1st view

[@KhushiKavya-py1yj]

2/10 consistency++

[@Busyvlog46]

Thank you bhaiya

[@SouravKumar-rg4yj]

🔥🔥🔥

[@souravmehraniya2832]

bhaiya orkitne videos baki ha is course me ? i mean kitne or videos me compelete ho ajega ye course ?

[@elektrofreaks1982]

🔥🔥🔥🔥

[@souravmehraniya2832]

bhaiya orkitne videos baki ha is course me ? i mean kitne or videos me compelete ho ajega ye course ?