Topic: backtracking-problem / Level: beginner

• 151. Generate all possible groupings of students based on their preferences and compatibility with each other.
• 152. Solve the "Three Sum" problem by finding all unique triplets in an array that sum to zero.
• 153. Find all distinct ways to arrange books on a shelf, taking into account the specific arrangement rules.
• 154. Print all valid combinations of flight paths between airports given specific layover restrictions.
• 155. Generate all unique configurations for a seating arrangement in a theater while considering preferences.
• 156. Solve the "Balanced Parentheses" problem by finding all valid combinations of parentheses.
• 157. Find all unique arrangements of colored beads on a necklace, considering rotations as equivalent.
• 158. Print all valid sequences of numbers that can form a valid mathematical equation.
• 159. Generate all combinations of words that can be formed from a given set of letters while ensuring uniqueness.
• 160. Solve the "Graph Coloring" problem by assigning colors to nodes in a graph with constraints.
• 161. Find all unique subsets of a collection of flowers for arranging in a bouquet based on color and type.
• 162. Print all valid paths for a knight in chess to reach a specified position on the board.
• 163. Generate all possible schedules for a group of people attending multiple events based on availability.
• 164. Solve the "Jump Game" problem by finding all unique ways to reach the last index of an array.
• 165. Find all unique combinations of items in a shopping cart that can be selected to achieve a discount.
• 166. Print all distinct binary search trees that can be constructed using a given set of values.
• 167. Generate all valid paths in a maze represented as a 2D grid with movable walls and passages.
• 168. Solve the "House Robber" problem by determining the maximum amount of money that can be robbed without alerting the police.
• 169. Find all unique arrangements of colored tiles on a floor while ensuring no two adjacent tiles are of the same color.
• 170. Print all valid combinations of digits that can form a valid phone number based on given area codes.
• 171. Generate all distinct ways to fill a cake with layers while maintaining a unique flavor combination for each layer.
• 172. Solve the "Regular Expression Matching" problem by determining all valid matches for a given pattern.
• 173. Find all unique paths in a tree structure, ensuring that each path traverses a specific set of nodes.
• 174. Print all combinations of outfits that can be created from a collection of clothing items while avoiding duplicates.
• 175. Generate all valid seat arrangements for a wedding reception based on guest preferences and restrictions.
• 176. Solve the "Minesweeper" problem by determining all valid moves based on adjacent mines.
• 177. Find all unique paths in a 2D grid where you can only move in certain directions to reach the end.
• 178. Print all combinations of snacks that can be offered at a party while ensuring a variety of options.
• 179. Generate all valid configurations for a circuit board layout based on component placement rules.
• 180. Solve the "Staircase Problem" by finding the number of distinct ways to climb to the top of n steps.
• 181. Find all unique arrangements of different types of plants in a garden while considering sunlight requirements.
• 182. Print all valid combinations of routes that can be taken during a road trip while adhering to destination constraints.
• 183. Generate all possible ways to group children for a team-building activity based on their interests.
• 184. Solve the "Longest Common Subsequence" problem by finding all sequences shared between two strings.
• 185. Find all valid schedules for a series of meetings while avoiding overlapping times.
• 186. Print all unique combinations of board games that can be selected for a game night based on player count.
• 187. Generate all distinct routes through a theme park based on ride preferences and waiting times.
• 188. Solve the "8-Puzzle Problem" by finding all valid configurations to move tiles into a specific order.
• 189. Find all unique combinations of ingredients for a smoothie while ensuring a healthy balance of flavors.
• 190. Print all valid paths through a forest represented as a graph while avoiding blocked areas.
• 191. Generate all possible arrangements of letters in a password while ensuring it meets specific security criteria.
• 192. Solve the "Minimum Coin Change" problem by finding all unique ways to provide change using different coin denominations.
• 193. Find all unique paths in a directed graph from a source node to all other nodes.
• 194. Print all combinations of items that can be packed in a backpack given weight limits and value constraints.
• 195. Generate all valid sequences of moves in a board game with specific rules about turns and actions.
• 196. Solve the "Shortest Path in a Weighted Graph" problem by finding all possible routes between nodes.
• 197. Find all unique combinations of stamps that can be used to make change for a specified amount.
• 198. Print all valid configurations for a seating arrangement based on guest preferences and table sizes.
• 199. Generate all distinct ways to place pieces on a chessboard according to game rules.
• 200. Solve the "Matchsticks to Square" problem by determining all configurations that can form a square shape using matchsticks.

• More Levels

• Intermediate
• Advanced