NJIT Meeting 8 - Dynamic Programming
Problems
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Longest Increasing Subsequence | 100/4 (25) | 1.33 | 1.00 |
| B | Cent Savings | 100/1 (100) | 1.00 | 1.00 |
| C | Tetration | 200/5 (40) | 1.25 | 1.00 |
| D | Train Sorting | 0/1 (0) | 1.00 | -- |
| E | Tri Tiling | 300/3 (100) | 1.00 | 1.00 |