| 1 |
All Possible Full Binary Trees |
Medium |
Dynamic ProgrammingTreeRecursion |
| 2 |
Can I Win |
Medium |
MathDynamic ProgrammingBit Manipulation |
| 3 |
Cat and Mouse |
Hard |
MathDynamic ProgrammingGraph |
| 4 |
Cat and Mouse II |
Hard |
ArrayMathDynamic Programming |
| 5 |
Climbing Stairs |
Easy |
MathDynamic ProgrammingMemoization |
| 6 |
Construct String with Minimum Cost (Easy) |
Unknown |
StringTrieDynamic Programming |
| 7 |
Count All Possible Routes |
Hard |
ArrayDynamic ProgrammingMemoization |
| 8 |
Count Visited Nodes in a Directed Graph |
Hard |
Dynamic ProgrammingGraphMemoization |
| 9 |
Different Ways to Add Parentheses |
Medium |
MathStringDynamic Programming |
| 10 |
Fibonacci Number |
Easy |
MathDynamic ProgrammingRecursion |
| 11 |
Find Number of Ways to Reach the K-th Stair |
Hard |
MathDynamic ProgrammingBit Manipulation |
| 12 |
Flip Game II |
Medium |
MathDynamic ProgrammingBacktracking |
| 13 |
Integer Replacement |
Medium |
Dynamic ProgrammingGreedyBit Manipulation |
| 14 |
Largest Color Value in a Directed Graph |
Hard |
Hash TableDynamic ProgrammingGraph |
| 15 |
Least Operators to Express Number |
Hard |
MathDynamic ProgrammingMemoization |