69 CS651 Lecture Notes - Lecture 53: Dynamic Programming, Microeconomics, Memoization
1 Mar 2023
Department
Course
Professor
Document Summary
Lesson 53 | dsa in java | @codingninjasindia. This video is a part of our new playlist of videos on data structures and algorithm in java by coding ninjas The link of the playlist is given in the description below. if you have not yet watched the previous videos go ahead and watch the earlier videos. subscribe to the coding ninja. Youtube channel and hit the bell icon so that you get notified for every new video. dynamic programming is just a part of enhanced recursion and it reduces time complexities very very good like from exponential. You can see some of the programs that take minutes to solve on one lack of data set. So i can say like to um like to break it to you for the recursion biot. If you are having multiple choice, you must be overcoming many of the scenarios where you are again solving for a particular choice like again and again
