Filter by difficulty:
•
At most one transaction Easy
•
At most two transactions Medium
•
Unlimited transactions Medium
•
At most k transactions (Backtracking + DP) Hard
•
Longest Consecutive Increasing Sequence in a Matrix Hard
•
Palindromic Paths from TopLeft to BottomRight Hard
•
Number of Islands (DFS / BFS / Disjoint Set) Medium
•
Replace Surrounded O with X - Variant of Flood FillMedium
•
Paths with Exactly K Coins (Right & Down) Medium
•
Collect Max Coins with Direction Change Rules Hard
•
Collect Max Coins (Forward + Return Path) Hard
•
Two Traversals Max Points (3D DP) Hard
•
Power Set (All Subsets) Easy
•
Unique Permutations (Distinct Elements) Medium
•
Unique Permutations (With Duplicates) Medium
•
All Subsets of Size K Medium
•
All Subsets with Sum = K Medium
•
All Subsets with Sum Divisible by K Hard
•
Generate Balanced Parentheses Medium
•
Word Search (Single Word) Medium
•
Word Search II (Trie) Hard
•
Word Ladder (Shortest Path) Medium
•
Word Ladder II (All Paths) Hard
•
Distinct Subsequences Hard
•
Wildcard Pattern Matching Hard
•
Word Break - Check Medium
•
Word Break - Print Medium
•
Interleaving String Medium
•
Restore IP Addresses Medium
•
Letter Combinations of Phone Number Easy
•
Optimal Strategy for a Game Medium
•
Fractional Knapsack Medium
•
Unbounded Knapsack Medium
•
LPS (LCS Variant) Medium
•
Box Stacking - LIS Variant (, Bridges) Hard
•
Building Bridges - LIS Variant Hard
•
Max Sum of Increasing Subsequence - LIS Variant Hard
•
Candy Distribution Medium
•
Min Jumps - Check Medium
•
Min Jumps - Count Medium