| # | Status | Problem | video | Level | Completes | Likes |
|---|---|---|---|---|---|---|
| 176 |
|
Find the Size of a Binary Tree without Recursion |
Beginner | % | 0 | |
| 175 |
|
Dynamic Programming — Longest Palindromic Subsequence |
Hard | % | 1 | |
| 174 |
|
Dynamic Programming - Maximum Product Cutting Problem |
Medium | % | 1 | |
| 173 |
|
Minimize Square Sums: Fewest Perfect Squares to Reach a Target (Dynamic Programming) |
Hard | % | 0 | |
| 172 |
|
Dynamic Programming - Longest Common Substring |
Medium | % | 0 |
