# Status Problem video Level Completes Likes 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 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 1 2 3 4 5 6 7 8 9 10 11 12
