Skip to content
/ ultimate-dp-I Public

All solutions to the problems in "Dynamic Programming I", the LeetCode dynamic programming study plan - I.

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

mndxpnsn/ultimate-dp-I

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
1014. Best Sightseeing Pair/src
1014. Best Sightseeing Pair/src
 
 
1137. N-th Tribonacci Number
1137. N-th Tribonacci Number
 
 
1143. Longest Common Subsequence/longest-common-subsequence
1143. Longest Common Subsequence/longest-common-subsequence
 
 
118. Pascal's Triangle/pascals-triangle
118. Pascal's Triangle/pascals-triangle
 
 
119. Pascal's Triangle II/pascals-triangle-II
119. Pascal's Triangle II/pascals-triangle-II
 
 
120. Triangle
120. Triangle
 
 
121. Best Time to Buy and Sell Stock/sell-stock
121. Best Time to Buy and Sell Stock/sell-stock
 
 
122. Best Time to Buy and Sell Stock II
122. Best Time to Buy and Sell Stock II
 
 
1314. Matrix Block Sum/src
1314. Matrix Block Sum/src
 
 
139. Word Break
139. Word Break
 
 
152. Maximum Product Subarray
152. Maximum Product Subarray
 
 
1567. Maximum Length of Subarray With Positive Product
1567. Maximum Length of Subarray With Positive Product
 
 
198. House Robber
198. House Robber
 
 
213. House Robber II
213. House Robber II
 
 
221. Maximal Square
221. Maximal Square
 
 
264. Ugly Number II
264. Ugly Number II
 
 
279. Perfect Squares
279. Perfect Squares
 
 
300. Longest Increasing Subsequence/longest-increasing-subsequence
300. Longest Increasing Subsequence/longest-increasing-subsequence
 
 
304. Range Sum Query 2D - Immutable
304. Range Sum Query 2D - Immutable
 
 
309. Best Time to Buy and Sell Stock with Cooldown
309. Best Time to Buy and Sell Stock with Cooldown
 
 
322. Coin Change
322. Coin Change
 
 
343. Integer Break
343. Integer Break
 
 
376. Wiggle Subsequence
376. Wiggle Subsequence
 
 
377. Combination Sum IV
377. Combination Sum IV
 
 
392. Is Subsequence/is-subsequence
392. Is Subsequence/is-subsequence
 
 
413. Arithmetic Slices/src
413. Arithmetic Slices/src
 
 
42. Trapping Rain Water
42. Trapping Rain Water
 
 
45. Jump Game II
45. Jump Game II
 
 
5. Longest Palindromic Substring
5. Longest Palindromic Substring
 
 
509. Fibonacci Number
509. Fibonacci Number
 
 
516. Longest Palindromic Subsequence/longest-palindromic-subsequence
516. Longest Palindromic Subsequence/longest-palindromic-subsequence
 
 
518. Coin Change 2
518. Coin Change 2
 
 
53. Maximum Subarray/max-subarray
53. Maximum Subarray/max-subarray
 
 
55. Jump Game/jump-game
55. Jump Game/jump-game
 
 
62. Unique Paths/unique-paths
62. Unique Paths/unique-paths
 
 
63. Unique Paths II/src
63. Unique Paths II/src
 
 
64. Minimum Path Sum/min-path-sum
64. Minimum Path Sum/min-path-sum
 
 
70. Climbing Stairs
70. Climbing Stairs
 
 
714. Best Time to Buy and Sell Stock with Transaction Fee/src
714. Best Time to Buy and Sell Stock with Transaction Fee/src
 
 
72. Edit Distance
72. Edit Distance
 
 
740. Delete and Earn/delete-and-earn
740. Delete and Earn/delete-and-earn
 
 
746. Min Cost Climbing Stairs
746. Min Cost Climbing Stairs
 
 
91. Decode Ways
91. Decode Ways
 
 
918. Maximum Sum Circular Subarray
918. Maximum Sum Circular Subarray
 
 
931. Minimum Falling Path Sum/src
931. Minimum Falling Path Sum/src
 
 
96. Unique Binary Search Trees
96. Unique Binary Search Trees
 
 
.DS_Store
.DS_Store
 
 
.gitignore
.gitignore
 
 
README.md
README.md
 
 

Repository files navigation

ultimate-dp-I

All solutions to the problems in "Dynamic Programming I", the LeetCode dynamic programming study plan - I. All solutions are implemented in Java or C++.

About

All solutions to the problems in "Dynamic Programming I", the LeetCode dynamic programming study plan - I.

Topics

algorithms leetcode edit-distance stock-market binary-search-tree leetcode-solutions dynamic-programming longest-common-subsequence pascals-triangle coin-change leetcode-java leetcode-cpp longest-increasing-subsequence maximum-subarray longest-palindromic-substring longest-palindromic-subsequence coin-change-2 ultimate-dp-study ultimate-dp-i house-robber

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •  

Languages