# Status Problem video Level Completes Likes 208 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 207 Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Medium % 1 205 Print All Diagonals of a given matrix Medium % 1 204 Dynamic Programming - Edit Distance Problem Hard % 2 202 Dynamic Programming - Box Stacking Problem Hard % 0 200 Dynamic Programming - Highway Billboard Problem Hard % 0 199 Dynamic Programming - Maximum Subarray Problem Medium % 0 198 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 197 Convert Binary Tree into Threaded Binary Tree Hard % 0 196 Double Threaded Binary Tree Complete Implementation Hard % 0 195 Single Threaded Binary Tree Complete Implementation Hard % 0 194 Introduction to Threaded Binary Tree Medium % 0 190 Swap Nodes in pairs in a Linked List by changing links Medium % 0 189 Convert BST to Greater Sum Tree Medium % 0 187 Reverse Alternative 'k' nodes in a Linked List. Medium % 0 186 Reverse a Linked List in groups of given size 'K' Medium % 0 185 Generate Maximum revenue by selling K tickets from N windows Medium % 0 184 Get the Sum of all left leaves in a Binary tree Beginner % 1 183 Convert binary tree to its Sum tree Medium % 1 182 Binary Tree-Postorder Traversal - Non Recursive Approach Beginner % 0 180 Binary Tree-Inorder Traversal - Non Recursive Approach Beginner % 0 175 Dynamic Programming — Longest Palindromic Subsequence Hard % 1 174 Dynamic Programming - Maximum Product Cutting Problem Medium % 1 171 Dynamic Programming - Longest Common Subsequence Medium % 0 169 Dynamic Programming - Coin Change Problem Medium % 1 168 Dynamic Programming - Minimum Cost Path Problem Medium % 1 166 All N Length Strings from Given String of Length K Medium % 0 165 Generate all combinations of length N Hard % 0 163 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 162 Dynamic Programming - Subset Sum Problem Hard % 0 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 156 Backtracking - N Queens Problem Hard % 0 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Print All Diagonals of a given matrix Dynamic Programming - Edit Distance Problem Dynamic Programming - Box Stacking Problem 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 Introduction to Threaded Binary Tree Swap Nodes in pairs in a Linked List by changing links Convert BST to Greater Sum Tree 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 Convert binary tree to its Sum tree Binary Tree-Postorder Traversal - Non Recursive Approach Binary Tree-Inorder Traversal - Non Recursive Approach Dynamic Programming — Longest Palindromic Subsequence Dynamic Programming - Maximum Product Cutting Problem Dynamic Programming - Longest Common Subsequence Dynamic Programming - Coin Change Problem Dynamic Programming - Minimum Cost Path Problem All N Length Strings from Given String of Length K Generate all combinations of length N Dynamic Programming - Maximum size square sub-matrix with all 1s Dynamic Programming - Subset Sum Problem 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 1 2 3 4 5 6 7
