Dynamic Programming

LeetCode solutions for dynamic programming problems

Home / LeetCode Solutions / Dynamic Programming

Dynamic Programming Problems

This section contains solutions to LeetCode problems involving dynamic programming techniques.

Climbing Stairs (Problem 70)

Count the number of ways to climb n stairs.

View on GitHub
Python Easy Dynamic Programming

Coin Change (Problem 322)

Find the fewest number of coins needed to make up a given amount.

View on GitHub
Python Medium Dynamic Programming

Longest Increasing Subsequence (Problem 300)

Find the length of the longest strictly increasing subsequence.

View on GitHub
Python Medium Dynamic Programming Binary Search