More Problems

• Find all permutations of a given string, taking into account the uniqueness of characters. Return the permutations in lexicographical order.
• Generate all valid parentheses combinations for a given number of pairs. Ensure that each combination adheres to proper opening and closing rules.
• Print all binary strings of length n, where n is a positive integer provided by the user. Ensure that all strings are unique.
• Solve the Rat in a Maze problem for a 4x4 grid, determining all possible paths from the start to the exit without obstacles.
• Find all paths from the top-left corner to the bottom-right corner of a given matrix while only moving down or right.
• Generate all possible letter combinations from a phone number, where each digit corresponds to a set of letters. Return the combinations.
• Solve the Sudoku problem for a 4x4 grid. Ensure the solution meets all standard Sudoku rules regarding numbers and their placement.
• Find all combinations of a given array where the elements sum to a specific target value. Include all unique combinations in the output.