Leetcode 322. Coin Change [Java] | Amazon coding interview question

Check out how to solve the leetcode 322 coin change question in Java. This is one of Amazon's most commonly asked coding interview questions according to Leetcode. In this video, you will see a dynamic programming approach with a very detailed explanation of how it works. The time complexity of this approach is O(S*n) and the Space complexity if O(S), where S is the amount and x is the number of coins.

Please write in the comments below which leetcode problem you want me to solve next.

And remember, a leetcode a day keeps unemployment away!

Thanks for watching!
#leetcode322

[BogdanHladiuc]

Thank you for the explanation. You made it easy to understand.

[aaronye]

Honestly this video is absolutely amazing! def helped me alot!

[devonhurd]

really horrible explanation. its clear you dont understand it well