When you enroll through our links, we may earn a small commission—at no extra cost to you. This helps keep our platform free and inspires us to add more value.

SkillShare logo

Dynamic Programming: Java, JavaScript, and Python

Unlock creativity with Skillshare! Learn acrylic painting, AI writing, graphic design, and photography.

     0 |
  • Reviews ( 0 )
Free

This Course Includes

  • iconskillshare
  • icon0 (0 reviews )
  • icon5 hours 6 minutes
  • iconenglish
  • iconOnline - Self Paced
  • iconcourse
  • iconSkillShare

About Dynamic Programming: Java, JavaScript, and Python

Introduction

Requirements

Fibonacci Sequence

Memoization

Tabulation

Minimum Number Of Bills to Return an Amount

Pseudo-Code of the problem

Minimum Number Java Implementation

Minimum Number JavaScript Implementation

Minimum Number Python Implementation

Number Of Ways To Return An Amount

Number Of Ways Pseudo-Code

Number Of Ways Java Implementation

Number Of Ways JavaScript Implementation

Number Of Ways Python Implementation

Knapsack Problem

Knapsack With Repetition

Knapsack With Repetition Pseudo-Code

Knapsack With Repetition Java Implementation

Knapsack With Reptition JavaScript Implementation

Knapsack With Repetition Python Implementation

Knapsack Without Repetition

Knapsack Without Repetition Pseudo-Code

Knapsack Without Repetition Java Implementation

Knapsack Without Repetition JavaScript Implementation

Knapsack Without Repetition Python Implementation

Number Of Subsets that Add Up to A Specific Number

Improved Number Of Subsets Solution

Number Of Subsets Java Implementation

Number Of Subsets JavaScript Implementation

Number Of Subsets Python Implementation

Longest Common Subsequence

Longest Common Subsequence Pseudo-Code

Longest Common Subsequence Java Implementation

Longest Common Subsequence JavaScript Implementation

Longest Common Subsequence Python Implementation

Longest Increasing Subsequence

Longest Increasing Subsequence Pseudo-Code 1

Longest Increasing Subsequence Java Implementation

Longest Increasing Subsequence Javascript Implementation

Longest Increasing Subsequence Python Implementation

Project

Conclusion

What You Will Learn?

  • In this course, you are going to learn about one of the most popular programming topics, dynamic programming. This topic is known as one of the most difficult topics in the programming world. However, in this course, we are going to simplify it and deeply learn the basis on which it stands..
  • What we are going to do is to start by introducing and defining dynamic programming, and present two popular techniques that are generally used which are memoization, and tabulation. We are going to learn about the differences between them, and when and where to use each one of them..
  • Then, we are going to solve some of the most famous dynamic programming problems by a detailed explanation of the problem, followed by an example walkthrough. Then, we come up with a pseudo-code, and finally we implement our code using three languages, Java, JavaScript, and Python..
  • This course contains multiple quizzes and coding exercises that will help you deeply understand each of the topics presented..
  • With that being said, I hope you enjoy this course, and I would love to help you make your dynamic programming experience more fun, and enjoyable as much as possible! .
  • Good Luck and Enjoy!.