SNo | Name | Difficulty | Question | Solution |
---|---|---|---|---|
1 | Subset Sum Problem | Medium | view | view |
2 | Perfect Sum Problem | Medium | view | view |
3 | 0 - 1 Knapsack Problem | Medium | view | view |
4 | Knapsack with Duplicate Items | Easy | view | view |
5 | Rod Cutting | Medium | view | view |
6 | Longest Common Subsequence | Medium | view | view |
7 | Longest Common Substring | Medium | view | view |
8 | Longest Palindromic Subsequence | Medium | view | view |
9 | Shortest Common Supersequence | Medium | view | view |
10 | Form a palindrome | Medium | view | view |
11 | Minimum number of deletions and insertions | Easy | view | view |
12 | Edit Distance | Medium | view | view |
13 | Wildcard Pattern Matching | Medium | view | view |
14 | Longest Bitonic subsequence | Medium | view | view |
15 | Burst Balloons | Hard | view | view |
16 | Matrix Chain Multiplication | Hard | view | view |
17 | Boolean Parenthesization | Hard | view | view |
18 | Palindromic Partitioning | Hard | view | view |
19 | Partition Array for Maximum Sum | Medium | view | view |
Geeksforgeeks
Folders and files
Name | Name | Last commit date | ||
---|---|---|---|---|
parent directory.. | ||||