@@abhay.shukla_ gud to hear! I am currently in 3rd yr do u think this playlist is perfect to crack a core company?.. I have been following this frm beginning and placements are near.
In case of option1 and option2, suppose in any of the case, i comes 1, we have dp[i] as INT_MAX as initialised, so the option becomes cost[1] + INT_MAX. Should not this give integer overflow for any value of cost[i] >= 1 ? Please answer if any body knows. Thanks bhaiya for the videos. These are very helpful.
bro due to your slow uploading i have to shift to other dp playlist we expect atleast 1 video every day coz we dont have much time left for our placements
bro its not just 26 min video he atleast have put around 2 hrs to research , teach, record, edit. hope u understand and all the best u will crack a good company ❤️
yrr bhaiya august mein placements...thoda jaldi video nhi daal skte aap?? I know it's difficult for you but bhaiya try kijiye daily 1 video ka....it's a Humble request...
Unsubscribed !! This wasn't expected from babbar Bhaiya... Initially he said that he'll complete the course by 17th March. He didn't stand on his commitment, really disappointed.
Bhaiya Please Jldi Jldi Videos Daalo Thoda😅😅i Know Its Hard... But Bhaiya I am waiting for the last topics.Bit Manipulation+Dp And All.. Khin or han H Nhi... So Please Cover them First If Possile Or Cover the series fast if possible
Bhaiya is Computer Science and Communication Engineering good? Does it deals with coding ? Is it a IT branch? Do we become a software engineer after completing it?
best playlist of dsa as all topics are covered smoothly and we don't have to switch on different resources ..thanks alot bhaiya 👍
Best dsa course on planet..
Bhaiya, you are amazing and your course is much better than other courses
Thanks bhaiya for well structured and placement oriented course
Bhaiya, jabhi mera man harne lagata tab humko dekhte hi mera man phir se energy bhar jata hain. thank you 3000
kya bol rha h bhai?
bhaiya u r really doing a great job!!!! blessings to you ❤️
we can use binary search to update the index+7 days and index+30 days
Loving the series ❤️❤️❤️❤️❤️❤️❤️❤️
thank you bhaiya
maza aa gaya
happy and safe journey bhaiya
Great video bhaiya 🥰🥰
Really helpful series even for 4 year experience software engineers like us. who did not give a damn to data structures in college
Aap kaha placed ho abhi?
@@deepjay9472 Currently in Headstrong. M serving NP. Trying to switch.
@@abhay.shukla_ gud to hear! I am currently in 3rd yr do u think this playlist is perfect to crack a core company?.. I have been following this frm beginning and placements are near.
@@deepjay9472 Are you able to solve atleast leetcode medium by yourself?
@@deepjay9472 yeah, no comapany will ask more than whats their in this course for DSA. Thanks to Love Babbar bhai for this great favour.
Thanku so much for u r hard working ♥️♥️
great bhaiya 💓💓
bhaiya u are legend , literal one
Love bhaiya ✨✨✨
Bhaiya aap abut achhe se samjhate ho pura samjh me aa jaata hai
Please make a playlist on Kali Linux.
God bless you 💖
Sir Discord link invalid show ho rahi hai. Can you update it please.
Its helping me a lot bhaiya . You are the best
best free of cost dsa course
That was one of the best and intrsting question so far
love you sir ❤, thanks for everything
153 ✅completed 👍Liked 04:14
2:17 bhaiya ye aap kya rhe hai?? 😀
bhyia..mera ye dp ka first time series hai..means ki pahali baar kr ra hu...lkein dar v lagra h ki..kya mujhe samjh m aara h ki nahii....
Dry Run:
2 Solutions Possible: Days [ 1, 3, 4, 5, 7, 8, 20]; Costs[ 2, 7, 15]
Solution 1:
{
index = 0 1 2 3 4 5 6
Costs = 1 3 4 5 7 8 20
At index 0 Take Option1 -----> Cost[0] + At Index 1 Take Option2 ----> Cost[1] + Now we are at Index 6 Take Option1 ------> Cost[0]
Illustrated Below: ->
Days[0] ------------Option1------> 2 + Days[1] ------Option2------>7 + Days[6]---------Option1------>2
Days[0] Cost[0]
Illustrated Below: ->
Days[0] ---------Option2 ---------> 7 + Days[5] ------Option1------>2 + Days[6]---------Option1------>2
Days[0]
Great work!! Keep it up
In case of option1 and option2, suppose in any of the case, i comes 1, we have dp[i] as INT_MAX as initialised, so the option becomes cost[1] + INT_MAX. Should not this give integer overflow for any value of cost[i] >= 1 ?
Please answer if any body knows.
Thanks bhaiya for the videos. These are very helpful.
love from maharashtra❤❤
anyone please tell after DP this series will be completed or some more topics are left.
Greedy Complete hogaya kya??
3:20 recursion
This helped a lot thank you.
You are doing well
Too good 👌👌👌
bro due to your slow uploading i have to shift to other dp playlist
we expect atleast 1 video every day
coz we dont have much time left for our placements
🖤
bro its not just 26 min video he atleast have put around 2 hrs to research , teach, record, edit. hope u understand and all the best u will crack a good company ❤️
Waiting for more videos , All lectures completed !!!🙌🙌
Always ready!!
bhaiya vidio number 22 me kam samaj aaraha hai .
lekin bhaiya koi baat nahi 2 time dekh luga.
aap bus aasehi padhate rahiye
❤❤❤
Great explaination
anyone please tell after DP this series will be completed or some more topics are left.
thank u bro
thank you
bhaiyaa ye kese pata chalega ki konsa prblm DP se krna aur konsa kisi aur technique se ?
Thanks sir
Bhaiya me direct tabulation wala soch nhe pata recursion ke help se soch pata ho
kya karo ?
bhayia ab intezaar nhi hota aur videos kab ayengi 🙏
Bhayia Please teach Word Wrap Problem with DP approach. Not memoization one
Thank you bhaiya but may I know how much video or topics are remaining?
@Fierce thanks bro
great bhaiya
Bhaiya aap koi web development ka course laane ka plan kar rahe ho kya ???
Please do reply......
nice video😇😇😇
this question came in my placement
Then?
kya hum tabulation mein -7 and -30 nhi karenge??
Keep it up bhaiya ✨
Bro reshuffle this video in playlist.
Your videos are awsm keep doing the great work!
anyone please tell after DP this series will be completed or some more topics are left.
osssm content
20:05
Why do we need space optimisation? Our dp array can have at max 365 + 1 size right? Isn't it constant?
Sir plz finish the dp series fast.It would be very helpful
anyone please tell after DP this series will be completed or some more topics are left.
@@imshivendra More topics are left.
🔥🔥🔥🔥
Please start a System Design Course... Much needed for placements >>>>>
Bhaiya please thoda frequency increase kar do🥲🥲
Awesome lecture...
Keep going 👍
anyone please tell after DP this series will be completed or some more topics are left.
Bhaiya continue. And start a seperate in detail c++ language course that's it
yrr bhaiya august mein placements...thoda jaldi video nhi daal skte aap?? I know it's difficult for you but bhaiya try kijiye daily 1 video ka....it's a Humble request...
bhai hua ya nhi??
@@syndaxlevenis6785 han bhai lggyi placement but inki video se nhi khud paddh ne se
Bhaiya total kitne Lectures honge
60
@@alexrcrew1975 mere bhai kaha so rahe ho 60 toh kabke ho gaye
8 din hogye no video !😥
Unsubscribed !! This wasn't expected from babbar Bhaiya... Initially he said that he'll complete the course by 17th March. He didn't stand on his commitment, really disappointed.
swad aa gya bhaiya
thanks bhaiya
Done!
Sir aapka lecture 1 se kha se milega
Bhaiya notes upload Kar do phle ke pls bhaiya
Chal rha h kaam dost
@@lovebabbar8280 ye kon hai 6 subscribers wala😂😂. This is not main channels Babbar bhaiya I guess...
Bhaiya jo relevel platform mein questions puche jate hai ve kaise. Solve kare
loved it
Maza aa raha hai bhaiya
we'll use 3 var
thx bhaiya
How many lectures are left for dp???
Bhaiya Please Jldi Jldi Videos Daalo Thoda😅😅i Know Its Hard... But Bhaiya I am waiting for the last topics.Bit Manipulation+Dp And All.. Khin or han H Nhi... So Please Cover them First If Possile Or Cover the series fast if possible
really helpful
hello, babbar bhaiya, ap dp kab tk kara doge?
65 questions
Bhaiya ye playlist puri karana
why we are taking extra variable i and storing index ,why we can not write
solve(n,days,cost,index+7) and solve(n,days,cost,index+30)
Because days consecutive nahi ho sakte like 1,2,3,4. Days may be in random order like 1,3,7,100 thats why doing like this..
helpful
amazinggg
bring more videos!!
completed the series till now
anyone please tell after DP this series will be completed or some more topics are left.
Bruh TF man
None of the comments are fun to read.
All of them are either appreciating the author or begging the author.
No space for light humor ig.
Bhaiya I am unable to join the discord server plz anyone suggest any solution
Bhaiya is Computer Science and Communication Engineering good? Does it deals with coding ? Is it a IT branch? Do we become a software engineer after completing it?
honestly speaking i didn't understand the tabulation approach of this question
sed :(
Is this course sufficient for competitive programming?
yahan tak aa gaye aur abhi tak nahi pata chala.😂😂😂😂😁😁😁😁
Bhayia AAP bhii toh Aman dattarwal Ko jaantey ho na achey se batao kon sahi hai please
mtlb ? kon shi he what ?? kiss perspective me baat kar rhe ho ?
If we don't take (n+1) size of vector then also it may work only(n) is enough
anyone please tell after DP this series will be completed or some more topics are left.
@@imshivendra somebody told only some topics are left now
Yes, we require only n for memoization but (n+1) for tabulation in this case.
Next vid
Bhai videos consistent kro thodi.. Placements sir pe ha dp khtm krva do jldi se
understand++
Memoisation wala code hi paas hi nahi hua leetcode pe, SMH
Can you Help Me How to Download All Video Notes Direct One click ?
Download the playlist
bhaiya please complete the series of python 15 videos series it has only 11 parts please complete that series asap 🙏🙏🙏😭
mat rowo. kahin aur se dekh lo.😞😞🥺🥺
Bhaiya hame DSA kaun si language karni chahiye please bataiye jo interview ke according sahi ho . Please bataiye
Bhai tre job interview kb se shuru hoo rhi hai ?
java me kro
android or backend dono me kaam aayegi
bhaiya consistency nahi arhi he coding me kese solve kre is issue ko
Just check this video description and you will find your answer
@@RahulKumar-wt9qc i got it thanks 🙏
@@anonymous.u.s.e.r are you in lecture 113 ??
bhaiya bade dino se live nhi aaye yt pe 🌚