# Status Problem video Level Completes Likes 169 Dynamic Programming - Coin Change Problem Medium % 1 168 Dynamic Programming - Minimum Cost Path Problem Medium % 1 167 Generate Well Ordered Passwords of a Given Length K Medium % 0 166 All N Length Strings from Given String of Length K Medium % 0 165 Generate all combinations of length N Hard % 0 164 Print All Possible Subsets with Sum equal to a given Number Hard % 0 163 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 161 The Word Break Problem Hard % 0 160 Dynamic Programming - Longest Increasing Subsequence Medium % 1 159 Solve the Knight's Tour with Backtracking Hard % 0 158 Backtracking - Search a Word In a Matrix Hard % 0 157 Backtracking - N Queens Problem - Better Solution Hard % 0 156 Backtracking - N Queens Problem Hard % 0 149 Backtracking - Rat In A Maze Puzzle Hard % 0 148 Solve Sudoku Puzzles with Backtracking Hard % 0 146 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 145 Dynamic Programming - Minimum Coin Change Problem Medium % 1 143 Merge K Sorted Arrays Hard % 0 141 Find the Single Occurrence Element in an Array (Odd One Out) Beginner % 1 140 Rearrange Array Elements (A[i] = i) | In-place Approach Medium % 0 Dynamic Programming - Coin Change Problem Dynamic Programming - Minimum Cost Path Problem Generate Well Ordered Passwords of a Given Length K All N Length Strings from Given String of Length K Generate all combinations of length N Print All Possible Subsets with Sum equal to a given Number Dynamic Programming - Maximum size square sub-matrix with all 1s The Word Break Problem Dynamic Programming - Longest Increasing Subsequence Solve the Knight's Tour with Backtracking Backtracking - Search a Word In a Matrix Backtracking - N Queens Problem - Better Solution Backtracking - N Queens Problem Backtracking - Rat In A Maze Puzzle Solve Sudoku Puzzles with Backtracking Dynamic Programming - Stairs Climbing Puzzle Dynamic Programming - Minimum Coin Change Problem Merge K Sorted Arrays Find the Single Occurrence Element in an Array (Odd One Out) Rearrange Array Elements (A[i] = i) | In-place Approach 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
