Topic: backtracking-problem / Level: intermediate

• 1102. Solve the "Game of Nim" problem by determining winning strategies based on initial configurations.
• 1103. Find all unique ways to partition an array into k subsets where each subsets sum is equal.
• 1104. Print all valid configurations of a building layout based on zoning regulations and constraints.
• 1105. Generate all possible ways to arrange a set of colored tiles in a grid without repeating colors adjacent to each other.
• 1106. Solve the "Coin Change II" problem by finding all combinations of coins that sum to a target amount, allowing unlimited usage.
• 1107. Find all unique paths in a directed graph where nodes represent tasks that must be completed in a specific order.
• 1108. Print all valid combinations of flavors for a cake based on dietary needs and preferences.
• 1109. Generate all distinct arrangements of numbers for a lottery ticket while ensuring no duplicates.
• 1110. Solve the "K-Subset" problem by finding all unique ways to divide a set into k subsets.
• 1111. Find all unique paths from the top-left to the bottom-right of a grid while avoiding specific blocked cells.
• 1112. Print all valid sequences of moves for a knight in chess based on given restrictions.
• 1113. Generate all possible combinations of ingredients for a unique dish while adhering to dietary restrictions.
• 1114. Solve the "Shortest Path with Obstacles" problem by finding the best route through a maze with varying weights.
• 1115. Find all unique combinations of words that can form valid phrases from a set of given words.
• 1116. Print all valid configurations for a grid-based game while adhering to player rules and conditions.
• 1117. Generate all possible ways to arrange seating for a concert based on artist availability.
• 1118. Solve the "Word Break II" problem by finding all possible segmentations of a string into valid words.
• 1119. Find all unique paths through a 2D grid with obstacles where movement is restricted.
• 1120. Print all valid combinations of exercises that can be performed in a fitness routine.
• 1121. Generate all possible seating arrangements for a family gathering based on relationships and dynamics.
• 1122. Solve the "Count Unique Paths" problem by finding all valid routes through a grid while avoiding obstacles.
• 1123. Find all unique arrangements of characters in a string while ensuring no adjacent characters are the same.
• 1124. Print all valid combinations of ingredients that can be used to create a healthy recipe.
• 1125. Generate all distinct paths for a robot navigating through an environment represented as a grid.
• 1126. Solve the "Maximum Depth of a Binary Tree" problem by finding the deepest leaves in a tree structure.
• 1127. Find all unique combinations of snacks that can be offered during a movie night based on preferences.
• 1128. Print all valid paths through a network of cities while avoiding specific traffic restrictions.
• 1129. Generate all possible ways to fill a jar with candies while adhering to specific color rules.
• 1130. Solve the "Minimum Distance" problem by finding the fewest steps required to convert one string into another.
• 1131. Find all unique combinations of items that can be selected from a store while adhering to a budget.
• 1132. Print all valid configurations for a cooking competition based on ingredients and cooking times.
• 1133. Generate all distinct sequences of moves that can be performed in a maze-based game.
• 1134. Solve the "Knights Tour II" problem by finding all possible tours on a chessboard.
• 1135. Find all unique paths from the start to end of a directed acyclic graph.
• 1136. Print all valid arrangements of colors for a project based on provided guidelines.
• 1137. Generate all possible seating arrangements for a sports event based on player availability.
• 1138. Solve the "Longest Increasing Subsequence" problem in a dynamic array.
• 1139. Find all unique ways to create a marketing campaign based on target audience.
• 1140. Print all valid paths for a delivery person navigating through a network of streets.
• 1141. Generate all possible ways to configure a desk layout based on available resources.
• 1142. Solve the "Unique Paths III" problem by finding all paths from the start to the end in a grid.
• 1143. Find all unique combinations of dance moves that can be performed in a routine.
• 1144. Print all valid configurations for a team-building event based on member preferences.
• 1145. Generate all distinct ways to allocate time for projects based on deadlines.
• 1146. Solve the "Partition Equal Subset Sum" problem by finding valid subsets in an array.
• 1147. Find all unique paths in a maze represented as a matrix while adhering to specific movement rules.
• 1148. Print all valid combinations of meals that can be prepared from a set of ingredients.
• 1149. Generate all possible ways to schedule classes based on student preferences and availability.
• 1150. Solve the "Count of Subsets" problem by finding all subsets that sum to a specific target.
• 1151. Find all unique ways to arrange shelves in a store based on product placement rules.

• More Levels

• Beginner
• Advanced