| 1 |
Android Unlock Patterns |
Medium |
Dynamic ProgrammingBacktrackingBit Manipulation |
| 2 |
Beautiful Arrangement |
Medium |
ArrayDynamic ProgrammingBacktracking |
| 3 |
Campus Bikes II |
Medium |
ArrayDynamic ProgrammingBacktracking |
| 4 |
Can I Win |
Medium |
MathDynamic ProgrammingBit Manipulation |
| 5 |
Closest Subsequence Sum |
Hard |
ArrayTwo PointersDynamic Programming |
| 6 |
Concatenated Divisibility |
Hard |
ArrayDynamic ProgrammingBit Manipulation |
| 7 |
Count Paths That Can Form a Palindrome in a Tree |
Hard |
Dynamic ProgrammingBit ManipulationTree |
| 8 |
Count Subtrees With Max Distance Between Cities |
Hard |
Dynamic ProgrammingBit ManipulationTree |
| 9 |
Count the Number of Square-Free Subsets |
Medium |
ArrayMathDynamic Programming |
| 10 |
Distribute Repeating Integers |
Hard |
ArrayDynamic ProgrammingBacktracking |
| 11 |
Fair Distribution of Cookies |
Medium |
ArrayDynamic ProgrammingBacktracking |
| 12 |
Find Minimum Time to Finish All Jobs |
Hard |
ArrayDynamic ProgrammingBacktracking |
| 13 |
Find Sum of Array Product of Magical Sequences |
Hard |
ArrayMathDynamic Programming |
| 14 |
Find the Minimum Cost Array Permutation |
Hard |
ArrayDynamic ProgrammingBit Manipulation |
| 15 |
Find the Shortest Superstring |
Hard |
ArrayStringDynamic Programming |