Dynamic Programming 🔥| Coin Change Problem Leetcode | C++ | Java | DSA-One Course #86
Vložit
- čas přidán 20. 08. 2024
- Hey guys, In this video we'll learn about the simple steps to solve any Dynamic Programming Problem. We have been told that solving Dynamic Programming problems is hard But Today I'll show you how you can learn Dynamic Programming with a simple technique.
Link to the code: github.com/Anu...
Practice more questions from here: www.techiedeli...
🚀 Follow me on:
Instagram: / anuj.kumar.sharma
Linkedin: / sharma-kumar-anuj
Twitter: / realanujbhaiya
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
🥳 Join our Telegram Community:
Telegram channel: t.me/coding_en...
Telegram group: t.me/dsa_one
💸 Visit www.educative.... to avail discount on all courses on Educative!
📚 Complete DSA Playlist: • DSA-One Course - The C...
Complete Android Development Playlist: • Android Development Tu...
Hashtags:
#anujbhaiya #dynamicprogramming
Track: Chris Henry - Flash
Ignore these tags:
dynamic programming
dynamic programming problems
coin change dynamic programming
dynamic programming java
coin change problem
anuj bhaiya
dynamic programming in java
coin change
what is dynamic programming
making change problem using dynamic programming
coin change problem dynamic programming
dynamic programming tutorial
how to solve dynamic programming problems
dynamic programing
dynamic programming algorithm
dynamic programming c++
anuj kumar sharma
dynamic programming in hindi
anuj
coin change leetcode
anuj bhaiya java
dp
java dynamic programming
making change problem
dynamic
dynamic programming playlist
dynamic programming coin change problem
minimum coin change problem
dynamic programming python
java
dp problems
anuj bhaiya dynamic programming
knapsack problem
coin problem dynamic programming
dynammic programming
anuj bhai
coin exchange problem
dynamic programming geeksforgeeks
greedy algorithm
dynamic programming anuj bhaiya
dynamic programming interview questions
anuj bhiya
apni kaksha
dynamic programming coin change
java anuj bhaiya
coin change dp
dynamic programming hindi
making change problem using dynamic programming in hindi
apni kaksha java
knapsack problem using dynamic programming
anuj kumar
dp programming
freecodecamp
how to master dynamic programming
learn dynamic programming
make change problem dynamic programming
322. coin change
coin problem
java apni kaksha
minimum coin change problem dynamic programming
algorithms
data structures and algorithms
graph data structure
android development
dp tutorial
dynamic programming for competitive programming
dynamic programming in python
dynamic programming questions
graph
how to solve dp problems
longest palindromic substring
recursion
0-1 knapsack problem dynamic programming
aditya verma dynamic programming
anuj apni kaksha
bfs
coin exchange problem in dynamic programming
coin tower
dynamic programming anuj
dynamic programming javascript
graphs
java by apni kaksha
knapsack
leetcode 322
python dynamic programming
recursion in java
sieve of eratosthenes
unbounded knapsack problem
This is my best work so far. I've broken down the core concepts of Dynamic Programming and then connect the dots in a real Problem. I hope you watch the full video and learn how to solve Dynamic Programming problems.
PS: I will be announcing an Android series in the next video so keep supporting and keep learning 🤗
U are lit bhaiya!!
Bhaiya web development ya fir graphic designing kara do plz...
Bhaiya plzz create a seperate a telegram channel as well as a perfect time and table jissey k revision bhi ho aur new concepts bhi sikh sake plzzz❤️❤️
bhaiya it seems your hardwork was justified in this video 🔥🔥🔥
Kyu time waste kar rahe bhaiya..yeh sare videos pehle se hi available hain CZcams pr kaafi achhe tarike se smjhaya unme bhi..kuch aisa banao jo easily available naa ho.Thanks
Believe me ... I just finished learning Trees from your last two videos ... bhaiya apka frequency zabar dast ho gaya hai ... keep going !
Ratinho insiano kkkkkskssn
I was not getting the concept of Greedy & Dynamic Programming, was feeling scared to do any of those questions. This video helps a lot to understand the concepts of both methodologies. Appreciate it. Thanks a lot.
ye banda sabko cse ke master bna kr hi manega :) huge respect brother!!
In One video three algorithmic techniques explain thank you bhayya
First 40 seconds....easiest & powerful approach I've ever found....
Why did I not stumble upon this channel before ?
I would have gotten way ahead , If I had watched it earlier.
Your explanation is so easier to understand. 🔥
Really, a nice content which aims at removing the fear of DP from a student's mind, love you, bhaiya!
yeh banda bohot hoshiyar hai yrr , itne clear concepts. bhai wahhh
Bhaiya plzz release a perfect time table for dsa series
no time table is perfect bro ,just keep practicing things
Please bhaiya make perfect time table
Pls bhaiya DS+ALGO lekar video banao na 🙏
Hsa भैय्या @anuj
Yes
U have that kind of trust of mine which I find hard to even give to my own college teachers, everything seems so easy when you teach it, a huge thanks for that, u rock bhaiya🔥🔥
Bhai kya explain kiya hai 😍, esi video CZcams pe kahi bhi nahi milegi ✔️, keep it up bro we are with you always.
Legend watching udemy coursera
Ultra legend watching anuj's bhaiya 💞
Bhayya ek ultimate guide to competitive coding and development needed very badly.
Thanks bhaiya
Bhaiya mujhe aaj malum chala ki
You are open a new channel
And there are many friends in my circle who don't know about this.
I will definitely inform them.
Bas ab aap kahi mat jana yu hamlogo ko akela chhor k...
You are my ideal bhaiya.
Bro tomorrow my exam is there , exam will consist of coding question in Java. Dynamic programming also there can you help me for exam .
And again YOUR CHANNEL WILL DEFINITELY GROW🥳🥳❤❤
@The Random Bro samaj ja bhai aisa kyu ho skta h😂
@@HarshKumar-nh6be but kyu btao to
@@ravidhundhara4761 aman dhattarwal was running apni kaksha and after that you can understand..😁$$$$$
@@HarshKumar-nh6be free me Kam nhi Kar rahe the , milta hoga unko bhi 💰
@@tapmachine7885 kaam to paiso me hi tha lekin km mil rha tha
Wow... The first 40 seconds of the video 🔥🔥🔥
Hiii nenu vamsi
For those who don't know, yesterday was Anuj Bhaiya's birthday! :)
@@ayushsrivastava617 kyu aman bhaiya aise kya hai
lol ka huya
@@ayushsrivastava617 😏km se km woh 5 log jyada acche hai joh Anuj Bhaiya ko khud support kr rahe un 500 logo se joh bs Aman Bhaiya ke Karan inko support kr rahe hai...Samaje burwak🌚
@@ayushsrivastava617 If you think so, then you should check his LinkedIn's post of his Birthday. You will surely get roast 🔥
Pla continue java placement course...🙂
Yes please
is video se dynamic programming ka concept clear hua he
Bhaiya plz make a video on bit manipulation....... and you one of the best teachers i ever seen ❤
I think that question is a variation of unbounded knapsack...
East or west Anuj Bhaiya is the best♥️🙏🏼👑
Anuj bhaiya you are the best....And i know apni kaksha stands only because of your effort.Best decision to leave apni kaksha...best of luck...👍
heavy explanation dude! cool......I really like the way you teach. Teaching is an art and you are the best artist.
Bro tomorrow my exam is there , exam will consist of coding question in Java. Dynamic programming also there can you help me for exam .
@@lionelmesssi2959 at the time of exam or now? You mean I will teach you. Isn't it? Or help you to cheat in exan?
@@Abhay.Bhandari help me to cheat in exam ...
@@lionelmesssi2959 😆😆 LMAO
@@Abhay.Bhandari if you can't say it. Bro 7 lakh package hai
I wouldn't have got the concept of dp , if I hadn't watched your video 🙏🙏
Very nice and simplified explanation
may one more more way to avoid call at entry control
if(dp[n-a[i]] != -1) {
subAns = dp[n-a[i]];
}
instead of this , just add at beggining of fun
if(n == 0) return 0;
if (dp[n] != -1)
return dp[n];
Bhai.... there are various data structure and algorithm paid courses are available but those students who are not financially strong are not able to buy that course......but bhai your channel and your content are very much stronger than the paid coachings and available for every one which makes you different from others. Keep it up bhai we always support you and yaah Bhai I am waiting for more videos related to array, searching, sorting.......
Really nicely explained ..Ab tak Dp ek fancy word lag raha tha ..Per it's not actually.. ye aapne prof kiya ...Thanks a lot...
Bhaiya ek video mai vo sab topics smjha do jo ek fresh Android Developer se puche jate hai interview mai
Excellent explanation bro...
This is one of my favourite channel
Good explanation. But the code fails for the below input
[2]
3
Exactly!
Nice explanation bhaiya! understood it very well..
just in 1 case it fails, ( leetcode )
array=[2]
n=3 (amount)
expected ans=-1;
code is giving garbage value (INT_MAX value)
how to handle this case?
try this .................. if(a[i]
the code will not work
yes, even I am stuck with this case anyone, please help
if(amount==0){
return 0;
}
if(coins.length==1 && (amount
Bhaiya data structures and algorithm pr lectures arrange karo 🙋
Great video. I watched all the English speaking ones and could not understand this DP bakwas. Glad I came across your video.
I couldn't understand what he is saying, there is no subs in last video.. (
bhai aap ka content sabs ebest hain ..thnks u so much anuj bhaiyia
finally got it using java, thanks for making this video
for everyone who is confused about time complexity of O(m^n) and O(3^n) just like I was when I first watched this, the actual complexity is O(2^n) here 2 will never scale to m. when you do all combinations, because for every coin we have 2 options, either we include it or exclude it so if we think in terms of binary, its 0(exclude) or 1(include).
For example if we have 2 coins, options will be 00, 01, 10, 11. so its 2^2.
For n coins , it will be 2^n. In all these options we will be checking whether that selection has made the change which is required.
Correct me if I'm wrong.
Your knowledge helps me a lot. Now I am feeling like a coder.😊
Thank you
Man gye guru...🙏🙏🙏 osm concept of dp.
Best explanation.
Masterji: Kuch bhi kaho kekin Anuj ke daant bilkul motiyon jaise chamak rahey hain!!!
Anuj : Kyon na ho Master jee main roz top down aur bottom up method se daant saaf karta hoon.
😃😃😃😃😃
Cringe*100
Recursion are hard to understand without stack trace calls , it would have been crystal clear if you would have added the Stack calls .
Ds and Algo in java complete pls....
Yes please
Bhaiyya you are legend, you are op.... kya samjhae, dp ki to big O hi maar liye aapne. Thankyou bhaiyya
Anuj bhai plz complete this *DS n Algo course* first with graphs,greedy etc and all the possible algorithms with interview questions..thank you
bhaiya ye hui na baat yahi video ka intzaar tha : aisehi saare algos sikha do bhaiya . you are great
*Just a little correction sir at **21:35*
When in end it's 0 it'll return 0, then +1 +1....And in the end we added +1 in answer to get the final answer!
Bhaiya ji algorithm full course par bhi videos bna digiye plzzz 🙏🙏🙏🙏
while True:
print("thanks for this !")
Aap bahut acche tarike se explain karthe hai bhaiya. Thankyou sooo much....
Thank you so much ! you cleared my concept on dynamic programming.
Flutter vs Android ??? Which one ??? Will you please elaborate... Pros & Cons
Please come live soon bhaiya. Lot of us are waiting to interact. Thank you. ❤️
Bro pls make vedio on competitive programming for beginners , from where we can basically start if interested in hackathons then from where we can start???
Bhaiya please make a video about Linked List and the questions to practice to master the topic.
Inside loop recursion very imp concepts 🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥
Anuj bhaiya please continue and complete this java + ds + algorithm course it is really helpful for us students .Thank you.😊
This program works only for a list of coins that contains 1.. Try {7,5,2}=>Wont work and {1,4,9} => Will work
Did I miss any assumptions in the program?
Boht sahie Bhai ....aap thoda pehle Milne Chahiye the ...concepts aur achese clear hote the 👍❤️
Energy is superb man
Plz Anuj bhai ye DS n Algo course ko sequence mein fully complete kardo phle plz ..aur youtube par nahi h theek se random topics hain ,jo apni kaksha wala choda h usko pura kardo yaha par..its helps alot of students
And I thought am never gonna understand dynamic programming . brother u r a blessing for students .keep up the good work .💓💓
Bhai Apnikaksha ki java series best thi ! Abhi DSA ke important questions and concepts asked in Interview ki playlist.
Bhaiya playlist bana di yaar.
Mai aajtak sirf playlist se padta tha jisme dp ni tha.
To bhaiya please arrange kar do ki find karne me easy ho🙏
Bhaiya, DSA n ALGO ka launch kr do poora please.....🙏🙏🙏
Glad you made english subtitles this video is gold thx you 👍
Very well explained ANUJ BHAIYA👌👌
Wow dp explained so beautifully!
Amazing video bhaiya 😍😍
I am from commerce stream and currently learning programming concepts. This video helped me a lot. Thank you so much.
you just simplified these topics easily.Thank you bhaiya
Hello bhaiya main apke shool se padha hun rpvv A6 paschim vihar I think aap NEHRA sir, SUNITA TREHAN. Mam ko jante hi honge.😍😍🤩 Bhaiya aap video full knowledge full bna rhe ho👍👍👍🤩😍😍🤩
445 likes and 0 dislike..power of anuj bhaiya.. ❤
Bhaiya please make complete playlist on algorithms. You are literally the most amazing teacher I’ve seen, Helping almost all students from tier 3 colleges. Such content for free implies such a kind heart. Thank you bhaiya. May God always bless youuuu ❤️❤️❤️❤️. Love from Hyderabad.❤️
These videos are very helpful and really descriptive that is easy to learn.
Keep this consistency bhaiya and thank you for helping us out in our CP journey.
Hope to hear your name in some of the testimonials of coders in future.
Belated Happy Birthday Anuj Bhaiya ........Waiting for Android Dev Series...........
There is a better way to solve it.
Anuj your way is optimal. But we can optimise further more.
We don't have to store value.
How?
If we have array [1,8,5]
We don't compute addition if it is done before.
What I mean is.
1,1,5 = 1,5,1=5,1,1
So if I compute all nodes from 1 branch then when I reach 3 branch i don't have to look towards 1 or any previous number before 5.
This way we will eliminate the storing and our computation will be much faster.
Bhaia, isse simple mujhe kabhi smjh nahi aaya❤
Give this man a raise!
Pure Concepts only...The Best...
Thanks for explaining DP beautifully in 1 single video....thankyou so much sir!!
Since then, Dynamic Programming felt easier....
Thank you for this video 🙏 God bless you sir 😇 your are growing
Bhaiya I've been a huge fan and seen many of your coding videos. I'm about to give my JEE in September and after that I want to start coding from scratch as for the past 2 years I've done bits but nothing proper as it wasn't one of my subjects and I had been preparing for JEE. After the exams and before college starts I think there will be a few months so I would request you to make a video covering how to start coding and resources to use and which topics to study.
Brother make video on recursive function.... Please
To develop a dynamic-programming algorithm, follow a sequence of four steps:
1. Characterize the structure of an optimal solution.
2. Recursively define the value of an optimal solution.
3. Compute the value of an optimal solution, typically in a bottom-up fashion.
4. Construct an optimal solution from computed information.
In short, there are two hallmarks of dynamic programming problems:
1. An optimal solution to a problem containing optimal solutions to subproblems.
2. Overlapping subproblems, which can be solved recursively (in most cases).
First like
Bhaiya please c++ m hi video banaya kijiye.
Amazing explanation. Please make more videos
Your teaching skills is abnormal🔥
Sab samajh aa jata hai
thanks sir, very helpful tutorial
Bhaiya plzz ap algorithms ka contintution kardoo na isme.....
Beautifully explained
Thats very great and easiest explanation of DP 🤩
The examples you give to explain complex problems are just amazing
Acchi qualities he videos ki.
Hereforth I dub u thee... Jeetu bhaiya of programming
OP Bhai. Ekdam mast explain kiya hia 💥💥
Subans wala smj hi nhi aa rha
Bhaiya Ji . Awesome thanks for yor efforts, very well explained 🙏
Wow sir the first 40 seconds is💥💥💥