Recursion & Backtracking | DSA For Placements | Basics To Ace It | Ep 6 | Mohammad Fraz | CodeChef

[@CodeChef1]

Guys, Are you liking the DSA For Placement series ?
Codechef is the place to hone your coding & programming skills.
Click here bit.ly/2Wbt6Dw to register yourself on Codechef for the coding practice problem & CodeChef Monthly Programming Contests - Long Challenges, Cook-Offs, Lunchtimes & Starters.

[@himanshmishra9101]

yes great series
I will join all contests once i feel confident in solving question

[@CodeChef1]

@@himanshmishra9101 Great! Till then go to the practice section www.codechef.com/practice.

[@darshand775]

Yes thanks a lot

[@aryankhandelwal15]

to simplify this there r 2 ways to reach top since you can climb at max 2 steps so suppose u r at s step (s

[@aryankhandelwal15]

this is what i have concluded

[@ritesh1211]

Codechef is doing really a good job....the best we can do is.... watching all the videos and sharing it with our friends.....we need to push such a beautiful content....well organised course...

[@aryankhandelwal15]

so if u can climb at max 3 steps then you have to do this way1(x+1)+way2(x+2)+way3(x+3)

[@rajranjan5131]

thank you soo much for such a great content

[@CodeChef1]

Thanks a lot, keep watching and keep sharing👍

[@tahamuneeb5039]

What about this cost array : [5,10,20,30,5,10,5] ?
With your approach it will give 45, however there is lesser combination available if we start from 10 -> 20 ->5->5 = 40.

[@MidnightSpecter43]

30:31 what is maximum size of stack !?
And if infite loop hoga to wo pura ram use kar lega !!?

[@darshand775]

Thank you so much

[@CodeChef1]

You're most welcome, keep watching

[@aryankhandelwal15]

sir +1 smj aata he aapne +2 kyu liya

[@aryankhandelwal15]

kyu ki at-max 2 hi chdh skta hu?

[@missmehar3310]

Thanks fraz bhaiya .You are an excellent 👨‍🏫 teacher @leadcoding