More Problems

• Find all unique paths in a grid where you can only move down or right. Return the number of distinct paths to reach the end.
• Solve the Word Search problem where you must find all instances of a word in a 2D grid of characters. Ensure no duplicates.
• Generate all possible combinations of a given string with a mix of uppercase and lowercase letters, ensuring distinct outputs.
• Find all unique palindromic substrings in a given string. Each substring should be a palindrome, and duplicates should be excluded.
• Print all combinations of k digits from a given n-digit number. Ensure that the output includes all unique combinations.
• Solve the Crossword Puzzle problem, filling in a grid based on given words and ensuring that all placements are valid.
• Find all possible paths in a binary tree from the root to leaves. Return the paths in a list, ensuring each path is unique.
• Generate all combinations of k items from a list of n items without replacement, ensuring no duplicate combinations in the output.