-
Notifications
You must be signed in to change notification settings - Fork 139
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Browse files
Browse the repository at this point in the history
1 parent
5041010
commit a594f6d
Showing
1 changed file
with
36 additions
and
0 deletions.
There are no files selected for viewing
36 changes: 36 additions & 0 deletions
36
blog/2021-06-15-dynamic-programming/dynamic-programming-problems.md
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,36 @@ | ||
--- | ||
slug: dynamic-programming-problems | ||
title: Dynamic Programming Problems | ||
authors: [Anshika] | ||
tags: ["30daysofcpp", "arrays", "practice-problems","leetcode","geeksforgeeks"] | ||
--- | ||
|
||
- [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/description/) | ||
|
||
- [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/description/) | ||
|
||
- [Minimum Number of Operations to Satisfy Conditions](https://leetcode.com/problems/minimum-number-of-operations-to-satisfy-conditions/description/) | ||
|
||
- [N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/description/) | ||
|
||
- [Is Subsequence](https://leetcode.com/problems/is-subsequence/description/) | ||
|
||
- [Counting Bits](https://leetcode.com/problems/counting-bits/description/) | ||
|
||
- [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/) | ||
|
||
- [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/description/) | ||
|
||
- [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/description/) | ||
|
||
- [Maximum Product Subarray](https://www.geeksforgeeks.org/problems/maximum-product-subarray3604/1?page=1&category=Dynamic%20Programming&sortBy=submissions) | ||
|
||
- [Perfect Sum Problem](https://www.geeksforgeeks.org/problems/perfect-sum-problem5633/1?page=1&category=Dynamic%20Programming&sortBy=submissions) | ||
|
||
- [Subset Sum Problem](https://www.geeksforgeeks.org/problems/subset-sum-problem-1611555638/1?page=1&category=Dynamic%20Programming&sortBy=submissions) | ||
|
||
- [Minimum sum partition](https://www.geeksforgeeks.org/problems/minimum-sum-partition3317/1?page=2&category=Dynamic%20Programming&sortBy=submissions) | ||
|
||
- [Nth catalan numbe](https://www.geeksforgeeks.org/problems/nth-catalan-number0817/1?page=2&category=Dynamic%20Programming&sortBy=submissions) | ||
|
||
- [Word Break](https://www.geeksforgeeks.org/problems/word-break1352/1?page=2&category=Dynamic%20Programming&sortBy=submissions) |