# Uncategorized : Dynamic Programming

This list is used to train students. Do not use it without supervision.

- Christmas Present 2
- Merchant Takahashi
- Blocking Elements
*Christmas Present 2*and*Blocking Elements*are similar. They should be solved atleast months apart.

- Colored Balls
- Solve in
`O(n^3)`

in first attempt.

- Solve in

- Substring Compression
- Solve in
`O(n^2)`

only. The DP can be optimized from`O(n^4)`

to`O(n^3)`

to`O(n^2)`

.

- Solve in

- Clear the String
- Jazz
*Clear the String*and*Jazz*are almost similar. They should be solved atleast months apart.

- What is the relative difficulty of
*Keep Connect*and*Erase Subarrays*?