Introduction To Dynamic Programming
In this video, Anuj Shah discusses the famous algorithmic paradigm known as dynamic programming..Anuj discusses how a programmer can use optimal substructure and overlapping subproblems are used in ways that help a programmer more efficiently solve complex challenges in iteration. Anuj then delves into the the concepts of bottom up iteration and memoization that are both used to dramatically decrease the time complexity of many iterative problems programmers face. Ultimately using the above techniques effectively is known as dynamic programming.
Project Members: Anuj Shah