🧑🏻‍💻 LeetCode Dynamic Programming I

Introduction

This Repository contains my solutions to Dynamic Programming I study plan on LeetCode.

• I strongly advise you to try to solve problems on your own before looking at the solutions provided here.
• Solutions and approaches may not be optimal.
• All Solutions here are in C++.
• Checkout my LeetCode profile at michaelehab

Solutions

Day 1

• Fibonacci Number
• N-th Tribonacci Number

Day 2

• Climbing Stairs
• Min Cost Climbing Stairs

Day 3

• House Robber
• House Robber II
• Delete and Earn

Day 4

• Jump Game
• Jump Game II

Day 5

• Maximum Subarray
• Maximum Sum Circular Subarray

Day 6

• Maximum Product Subarray
• Maximum Length of Subarray With Positive Product

Day 7

• Best Sightseeing Pair
• Best Time to Buy and Sell Stock
• Best Time to Buy and Sell Stock II

Day 8

• Best Time to Buy and Sell Stock with Cooldown
• Best Time to Buy and Sell Stock with Transaction Fee

Day 9

• Word Break
• Trapping Rain Water

Day 10

• Arithmetic Slices
• Decode Ways

Day 11

• Ugly Number II
• Unique Binary Search Trees

Day 12

• Pascal's Triangle
• Pascal's Triangle II

Day 13

• Triangle
• Minimum Falling Path Sum

Day 14

• Matrix Block Sum
• Range Sum Query 2D Immutable

Day 15

• Unique Paths
• Unique Paths II

Day 16

• Minimum Path Sum
• Maximal Square

Day 17

• Longest Palindromic Substring
• Longest Palindromic Subsequence

Day 18

• Longest Increasing Subsequence
• Wiggle Subsequence

Day 19

• Is Subsequence
• Longest Common Subsequence
• Edit Distance

Day 20

• Coin Change
• Coin Change 2

Day 21

• Combination Sum IV
• Integer Break
• Perfect Squares