Dynamic programming Courses and Certifications

Dynamic Programming - I

672 ratings at Udemy

Master the art of solving Dynamic Programming problems and acing the Coding Interviews

• Udemy
• 2 hours 30 minutes
• On-Demand
• Paid Course

Dynamic Programming Algorithms Master Course

658 ratings at Udemy

Ultimate Specialisation on Recursion, Backtracking and Dynamic Programming for Competitive Coding & Interviews.

• Udemy
• 1 day 20 hours 25 minutes
• On-Demand
• Paid Course

Dynamic Programming: Applications In Machine Learning and Genomics

Learn how dynamic programming and Hidden Markov Models can be used to compare genetic strings and uncover evolution.

• edX
• 4 weeks, 8-10 hours a week
• On-Demand
• Free Online Course (Audit)

Dynamic Programming, Greedy Algorithms

248 ratings at Coursera

Explore algorithm design techniques like divide-and-conquer, dynamic programming, and greedy algorithms. Learn about intractability and optimization problem-solving using linear/integer programming solvers.

• Coursera
• 1 day 14 hours 15 minutes
• On-Demand
• Paid Course

The Road To Dynamic Programming: Java, JavaScript, & Python

220 ratings at Udemy

Recursion, Memoization, and Tabulation in Dynamic Programming

• Udemy
• 5 hours 32 minutes
• On-Demand
• Paid Course

Grokking Dynamic Programming Patterns: Coding Interviews

90 ratings at Udemy

Master the Art of Dynamic Programming: Learn Step by Step Approach to Solve any Dynamic Programming Problem

• Udemy
• 1 day 8 hours 47 minutes
• On-Demand
• Paid Course

EDUCBA

Master SAS Macros for Dynamic and Automated Programming

Discover how to automate SAS programming with macros, creating dynamic, reusable code through variables, functions, conditional logic, and iterative processing for efficient data workflows.

• Coursera
• 10 hours 12 minutes
• On-Demand
• Paid Course

Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms

6 reviews

Explore advanced graph algorithms, pattern matching, and dynamic programming techniques. Gain practical skills in implementing efficient solutions for complex computational problems.

• edX
• 5 weeks, 9-10 hours a week
• On-Demand
• Free Online Course (Audit)

Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges

Learn Dynamic Programming to solve complex algorithmic problems efficiently. Master memoization and tabulation techniques for optimizing solutions in JavaScript, applicable to various programming languages.

• freeCodeCamp
• 5 hours
• On-Demand
• Free Video

Dynamic Programming with Java – Learn to Solve Algorithmic Problems & Coding Challenges

Master dynamic programming in Java to solve complex algorithmic problems and coding challenges. Learn through practical examples and improve your problem-solving skills for technical interviews.

• freeCodeCamp
• 2-3 hours
• On-Demand
• Free Video

Dynamic Programming – 0/1 Knapsack Problem Tutorial

Learn to solve the 0/1 Knapsack Problem using dynamic programming and C#. Covers problem overview, algorithm explanation, coding implementation, and output generation for optimal item selection.

• freeCodeCamp
• On-Demand
• Free Video

CMU Database Group

Query Optimizer Implementation 3 - Advanced Database Systems

Explore advanced query optimization techniques, focusing on implementation strategies for complex database systems.

• YouTube
• 43 minutes
• On-Demand
• Free Video

CMU Database Group

Query Optimizer Implementation 2 - Advanced Database Systems - Lecture 14

Explore advanced query optimizer implementation techniques, focusing on cost models, plan enumeration, and optimization algorithms for complex database systems.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Video

Reducible

Simple Steps for Solving Dynamic Programming Problems

Learn a systematic approach to tackle dynamic programming problems, illustrated with examples like longest increasing subsequence and optimal box stacking.

• YouTube
• 21 minutes
• On-Demand
• Free Video

Applied Algebraic Topology Network

Computing Gromov-Hausdorff Distances Between Ultrametric Spaces

Explore efficient algorithms for computing Gromov-Hausdorff distances between ultrametric spaces, including complexity analysis and dynamic programming approaches.

• YouTube
• 28 minutes
• On-Demand
• Free Video