Skip to content

Ibraam-Nashaat/Leetcode-Dynamic-Programming-Study-Plan

1 Branch0 Tags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Ibraam-NashaatIbraam-Nashaat
Updated README.md
Aug 2, 2022
e850c73 · Aug 2, 2022

History

53 Commits
.gitignore
.gitignore
 
 
1.Fibonacci Number.cpp
1.Fibonacci Number.cpp
 
 
10.Maximum Subarray.cpp
10.Maximum Subarray.cpp
 
 
11.Maximum Sum Circular Subarray.py
11.Maximum Sum Circular Subarray.py
 
 
12.Maximum Product Subarray.cpp
12.Maximum Product Subarray.cpp
 
 
13.Maximum Length of Subarray With Positive Product.cpp
13.Maximum Length of Subarray With Positive Product.cpp
 
 
14.Best Sightseeing Pair.cpp
14.Best Sightseeing Pair.cpp
 
 
15.Best Time to Buy and Sell Stock.cpp
15.Best Time to Buy and Sell Stock.cpp
 
 
16.Best Time to Buy and Sell Stock II.cpp
16.Best Time to Buy and Sell Stock II.cpp
 
 
17.Best Time to Buy and Sell Stock with Cooldown.py
17.Best Time to Buy and Sell Stock with Cooldown.py
 
 
18.Best Time to Buy and Sell Stock with Transaction Fee.cpp
18.Best Time to Buy and Sell Stock with Transaction Fee.cpp
 
 
19.Word Break.cpp
19.Word Break.cpp
 
 
2.N-th Tribonacci Number.cpp
2.N-th Tribonacci Number.cpp
 
 
20.Trapping Rain Water.cpp
20.Trapping Rain Water.cpp
 
 
21.Arithmetic Slices.cpp
21.Arithmetic Slices.cpp
 
 
22.Decode Ways.cpp
22.Decode Ways.cpp
 
 
23.Ugly Number II.cpp
23.Ugly Number II.cpp
 
 
24.Unique Binary Search Trees.cpp
24.Unique Binary Search Trees.cpp
 
 
25.Pascal's Triangle.cpp
25.Pascal's Triangle.cpp
 
 
26.Pascal's Triangle II.cpp
26.Pascal's Triangle II.cpp
 
 
27.Minimum Falling Path Sum.cpp
27.Minimum Falling Path Sum.cpp
 
 
28.Triangle.cpp
28.Triangle.cpp
 
 
29.Matrix Block Sum.cpp
29.Matrix Block Sum.cpp
 
 
3.Climbing Stairs.cpp
3.Climbing Stairs.cpp
 
 
30.Range Sum Query 2D - Immutable.cpp
30.Range Sum Query 2D - Immutable.cpp
 
 
31.Unique Paths.cpp
31.Unique Paths.cpp
 
 
32.Unique Paths II.cpp
32.Unique Paths II.cpp
 
 
33.Minimum Path Sum.cpp
33.Minimum Path Sum.cpp
 
 
34.Maximal Square.cpp
34.Maximal Square.cpp
 
 
35.Longest Palindromic Substring.cpp
35.Longest Palindromic Substring.cpp
 
 
36.Longest Palindromic Subsequence.cpp
36.Longest Palindromic Subsequence.cpp
 
 
37.Longest Increasing Subsequence.cpp
37.Longest Increasing Subsequence.cpp
 
 
38.Wiggle Subsequence.cpp
38.Wiggle Subsequence.cpp
 
 
39.Is Subsequence.cpp
39.Is Subsequence.cpp
 
 
4.Min Cost Climbing Stairs.cpp
4.Min Cost Climbing Stairs.cpp
 
 
40.Longest Common Subsequence.cpp
40.Longest Common Subsequence.cpp
 
 
41.Edit Distance.cpp
41.Edit Distance.cpp
 
 
42.Coin Change.cpp
42.Coin Change.cpp
 
 
43.Coin Change 2.cpp
43.Coin Change 2.cpp
 
 
44.Combination Sum IV.cpp
44.Combination Sum IV.cpp
 
 
45.Integer Break.cpp
45.Integer Break.cpp
 
 
46.Perfect Squares.cpp
46.Perfect Squares.cpp
 
 
5.House Robber.cpp
5.House Robber.cpp
 
 
6.House Robber II.cpp
6.House Robber II.cpp
 
 
7.Delete and Earn.cpp
7.Delete and Earn.cpp
 
 
8.Jump Game.cpp
8.Jump Game.cpp
 
 
9.Jump Game II.cpp
9.Jump Game II.cpp
 
 
README.md
README.md
 
 

Repository files navigation

Leetcode-Dynamic-Programming-Study-Plan

  • This repository represents my solutions to Leetcode Dynamic Programming Study Plan 1.
  • You can find the complete study plan here.

The Study Plan:

Day 1:

Day 2:

Day 3:

Day 4:

Day 5:

Day 6:

Day 7:

Day 8:

Day 9:

Day 10:

Day 11:

Day 12:

Day 13:

Day 14:

Day 15:

Day 16:

Day 17:

Day 18:

Day 19:

Day 20:

Day 21:

About

Leetcode Dynamic Programming study plan solutions.

Topics

leetcode-solutions dynamic-programming leetcode-dynamic-programming dynamic-programming-study-plan

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages