Topic: backtracking-problem / Level: beginner

• 51. Generate all possible paths through a grid from the top left to the bottom right corner, while avoiding obstacles.
• 52. Solve the "Crossword Puzzle" problem where you fill in a grid with words based on given constraints and conditions.
• 53. Find all arrangements of k elements from a set of n elements, where order matters and duplicates are not allowed.
• 54. Print all valid sequences of numbers that can form a complete binary tree based on given node values.
• 55. Generate all combinations of numbers from a given list that can be arranged to form a palindrome.
• 56. Solve the "Rugby Match Scheduling" problem by generating valid schedules for teams based on given constraints.
• 57. Find all ways to partition a set of integers into subsets such that the sum of each subset is equal.
• 58. Print all unique paths in a grid that contains both obstacles and free cells, considering diagonal movements allowed.
• 59. Generate all distinct sequences of moves in a game that result in winning configurations, considering all possible strategies.
• 60. Solve the "Seating Arrangement" problem where people must be seated based on specific preferences and conditions.
• 61. Find all valid combinations of brackets such that they are correctly nested, for a given number of pairs of brackets.
• 62. Print all valid paths through a maze represented as a 2D grid where cells can either be free or blocked.
• 63. Generate all unique arrangements of letters from a given word while considering cases where letters may repeat.
• 64. Solve the "Combination Lock" problem by determining all possible combinations that can unlock a device.
• 65. Find all subsets of an array where each subset satisfies a specific sum condition, ensuring unique combinations are returned.
• 66. Print all valid configurations of a tic-tac-toe board based on certain move sequences and win conditions.
• 67. Generate all distinct arrangements of a multi-digit number without leading zeros, ensuring no duplicates.
• 68. Solve the "Job Scheduling" problem where jobs must be scheduled based on deadlines and profits, with unique schedules returned.
• 69. Find all unique ways to fill in a crossword puzzle grid while adhering to specific word placement rules.
• 70. Print all paths from a source node to a destination node in a directed graph without repeating any nodes.
• 71. Generate all valid configurations of a Rubiks Cube based on specific moves made to achieve different states.
• 72. Solve the "Knapsack Problem" by determining all combinations of items that can fit within a given weight limit.
• 73. Find all combinations of coins that can be used to make change for a specific amount, ensuring that all combinations are unique.
• 74. Print all distinct binary trees that can be formed with a specific number of nodes, ensuring that each tree is unique.
• 75. Generate all possible move sequences in a chess game based on the starting position and number of moves allowed.
• 76. Solve the "Find All Word Squares" problem where words must be arranged in a square grid with overlapping letters.
• 77. Find all valid configurations of a Sudoku puzzle and print them, ensuring that all numbers meet the games constraints.
• 78. Print all possible sequences of moves to solve a maze where paths can only be traversed in one direction.
• 79. Generate all unique arrangements of a string containing both letters and numbers while adhering to specific format rules.
• 80. Solve the "Word Ladder" problem by finding the shortest path from one word to another with specific word transformations.
• 81. Find all unique combinations of integers that sum to a specific target, ensuring that order does not matter in the output.
• 82. Print all valid configurations of a game board based on given rules and conditions for placing pieces.
• 83. Generate all possible schedules for a conference with multiple speakers, ensuring no overlaps in speaking times.
• 84. Solve the "Matrix Chain Multiplication" problem by finding the optimal way to multiply a sequence of matrices.
• 85. Find all unique subsets of a given array of integers, including duplicates in the input array while avoiding duplicate subsets.
• 86. Print all valid combinations of parenthesis given n pairs, ensuring they are correctly balanced and properly formatted.
• 87. Generate all unique patterns that can be created with a fixed number of colored tiles arranged in a grid.
• 88. Solve the "Longest Increasing Subsequence" problem by finding all sequences of numbers that increase and print them.
• 89. Find all unique arrangements of a list of jobs that can be done in a specific order based on dependencies.
• 90. Print all combinations of numbers from 1 to n that can be selected to form a specific product when multiplied together.
• 91. Generate all unique paths through a grid filled with numbers while avoiding cells with obstacles.
• 92. Solve the "Cyclic Permutation" problem by finding all unique ways to arrange elements in a circular order.
• 93. Find all valid configurations of a robot moving through a maze represented by a 2D grid of cells.
• 94. Print all combinations of different letters that can be formed from a given string, ensuring unique results.
• 95. Generate all unique placements of kings on a chessboard while ensuring that no two kings can attack each other.
• 96. Solve the "Magic Square" problem by finding valid configurations for a square matrix filled with numbers from 1 to n.
• 97. Find all unique arrangements of k items chosen from n distinct items with order not being important in the output.
• 98. Print all valid sequences of dice rolls that can result in a specific sum being achieved based on constraints.
• 99. Generate all possible ways to allocate resources among different tasks while adhering to specific rules and constraints.
• 100. Solve the "Triplet Sum" problem by finding all unique combinations of three numbers that sum to a specific target.

• More Levels

• Intermediate
• Advanced