# Status Problem Level Completes Likes 176 Dynamic Programming - Split the String into Minimum number of Palindromes. Hard % 0 177 Dynamic Programming - Highway Billboard Problem Hard % 0 178 Dynamic Programming - Maximum Subarray Problem Medium % 0 179 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 180 Convert Binary Tree into Threaded Binary Tree Hard % 0 181 Double Threaded Binary Tree Complete Implementation Hard % 0 182 Single Threaded Binary Tree Complete Implementation Hard % 0 183 Implement Stack Using Linked List Beginner % 0 184 Swap Nodes in pairs in a Linked List by changing links Medium % 0 185 Convert BST to Greater Sum Tree Medium % 0 186 Shortest Range in K-sorted Lists Hard % 1 187 Reverse Alternative 'k' nodes in a Linked List. Medium % 0 188 Reverse a Linked List in groups of given size 'K' Medium % 0 189 Generate Maximum revenue by selling K tickets from N windows Medium % 0 190 Get the Sum of all left leaves in a Binary tree Beginner % 1 191 Dynamic Programming — Longest Palindromic Subsequence Hard % 1 192 Dynamic Programming - Maximum Product Cutting Problem. Medium % 1 193 Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number Hard % 0 194 Dynamic Programming - Longest Common Substring Medium % 0 195 Dynamic Programming - Longest Common Subsequence Medium % 0 196 Dynamic Programming - Rod Cutting Problem Medium % 1 197 Dynamic Programming - Coin Change Problem Medium % 1 198 Dynamic Programming - Minimum Cost Path Problem Medium % 1 199 Generate Well Ordered Passwords of a Given Length K Medium % 0 200 All N Length Strings from Given String of Length K Medium % 0 201 Print All N Length Strings from Given Number K Hard % 0 202 Print All Possible Subsets with Sum equal to a given Number Hard % 0 203 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 204 The Word Break Problem Hard % 0 205 Dynamic Programming - Longest Increasing Subsequence Medium % 1 206 Backtracking - Knight's Tour Problem Hard % 0 207 Backtracking - Search a Word In a Matrix Hard % 0 208 Backtracking - N Queens Problem - Better Solution Hard % 0 209 Backtracking - N Queens Problem Hard % 0 210 Backtracking - Rat In A Maze Puzzle Hard % 0 Dynamic Programming - Split the String into Minimum number of Palindromes. Dynamic Programming - Highway Billboard Problem Dynamic Programming - Maximum Subarray Problem Kadane's Algorithm - Maximum Subarray Problem Convert Binary Tree into Threaded Binary Tree Double Threaded Binary Tree Complete Implementation Single Threaded Binary Tree Complete Implementation Implement Stack Using Linked List Swap Nodes in pairs in a Linked List by changing links Convert BST to Greater Sum Tree Shortest Range in K-sorted Lists Reverse Alternative 'k' nodes in a Linked List. Reverse a Linked List in groups of given size 'K' Generate Maximum revenue by selling K tickets from N windows Get the Sum of all left leaves in a Binary tree Dynamic Programming — Longest Palindromic Subsequence Dynamic Programming - Maximum Product Cutting Problem. Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number Dynamic Programming - Longest Common Substring Dynamic Programming - Longest Common Subsequence Dynamic Programming - Rod Cutting Problem 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 Print All N Length Strings from Given Number K 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 Backtracking - Knight's Tour Problem Backtracking - Search a Word In a Matrix Backtracking - N Queens Problem - Better Solution Backtracking - N Queens Problem Backtracking - Rat In A Maze Puzzle 1 2 3 4 5 6 7 8 9
