FRA_UAS DUPL 4 - Dynamic Programming
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Longest Increasing Subsequence | 0/0 (0%) | -- | -- |
| B | Knapsack | 0/0 (0%) | -- | -- |
| C | Palindrome Names | 0/0 (0%) | -- | -- |
| D | Divisible Subsequences | 0/0 (0%) | -- | -- |
| E | A1 Paper | 0/0 (0%) | -- | -- |
| F | Catalan Numbers | 0/0 (0%) | -- | -- |
| G | Wood Cutting | 0/0 (0%) | -- | -- |