Learn how to use Dynamic Programming to solve complex programming problems in this course. The course covers topics such as memoization and tabulation, with a focus on solving algorithmic problems and coding challenges. The course uses JavaScript as the primary programming language, but the concepts taught are applicable to other languages. The teaching method includes visual aids like images and animations to help understand problems conceptually before solving them. The course is designed for beginners looking to enhance their problem-solving skills, especially in the context of data structures and algorithms.
Overview
Syllabus
) course introduction.
) fib memoization.
) gridTraveler memoization.
) memoization recipe.
) canSum memoization.
) howSum memoization.
) bestSum memoization.
) canConstruct memoization.
) countConstruct memoization.
) allConstruct memoization.
) fib tabulation.
) gridTraveler tabulation.
) tabulation recipe.
) canSum tabulation.
) howSum tabulation.
) bestSum tabulation.
) canConstruct tabulation.
) countConstruct tabulation.
) allConstruct tabulation.
) closing thoughts.
Taught by
freeCodeCamp.org
Related Courses
-
Dynamic Programming with Java – Learn to Solve Algorithmic Problems & Coding Challenges
-
Grokking Dynamic Programming Patterns: Coding Interviews
-
The Road To Dynamic Programming: Java, JavaScript, & Python
-
Algorithmic Design and Techniques
3.7 -
Dynamic Programming – 0/1 Knapsack Problem Tutorial
-
Algorithmic Toolbox
3.6
