// practice ground
| # | Title | Topics | Difficulty |
|---|---|---|---|
| 326 | Binary Tree Maximum Path Sum |
Dynamic Programming
Recursion
Trees
|
Hard |
| 327 | Recover Binary Search Tree |
Binary Search Tree
Recursion
Trees
|
Hard |
| 328 | Vertical Order Traversal |
Trees
|
Hard |
| 329 | All Nodes Distance K in Binary Tree |
Graphs
Trees
|
Medium |
| 330 | Domino and Tromino Tiling |
Dynamic Programming
|
Medium |
| 331 | Number of Dice Rolls With Target Sum |
Dynamic Programming
|
Medium |
| 332 | Minimum Cost For Tickets |
Dynamic Programming
|
Medium |
| 333 | Length of Longest Fibonacci Subsequence |
Dynamic Programming
Hashing
|
Medium |
| 334 | Longest String Chain |
Dynamic Programming
Sorting
|
Medium |
| 335 | Number of Longest Increasing Subsequence |
Dynamic Programming
|
Medium |
| 336 | Strange Printer |
Dynamic Programming
|
Hard |
| 337 | Minimum Number of Refueling Stops |
Dynamic Programming
Heaps / Priority Queue
|
Hard |
| 338 | Partition to K Equal Sum Subsets |
Backtracking
Dynamic Programming
|
Medium |
| 339 | Burst Balloons |
Dynamic Programming
|
Hard |
| 340 | Cherry Pickup |
Dynamic Programming
Matrix
|
Hard |
| 341 | Coin Change II |
Dynamic Programming
|
Medium |
| 342 | Delete and Earn |
Dynamic Programming
|
Medium |
| 343 | House Robber III |
Dynamic Programming
Trees
|
Medium |
| 344 | Target Sum |
Dynamic Programming
|
Medium |
| 345 | Integer Break |
Dynamic Programming
Math
|
Medium |
| 346 | Decode Ways II |
Dynamic Programming
Strings
|
Hard |
| 347 | Frog Jump |
Dynamic Programming
|
Hard |
| 348 | Paint House |
Dynamic Programming
|
Medium |
| 349 | Paint Fence |
Dynamic Programming
|
Medium |
| 350 | Echo Prefix Chain |
Strings
Trie
|
Medium |
