# Status Problem video Level Completes Likes 208 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 190 Swap Nodes in pairs in a Linked List by changing links Medium % 0 189 Convert BST to Greater Sum Tree Medium % 0 186 Reverse a Linked List in groups of given size 'K' 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 179 Binary Tree Deletion Beginner % 0 178 Search the Element in a binary tree - With and Without Recursion Beginner % 0 177 Tree Traversals Beginner % 1 174 Dynamic Programming - Maximum Product Cutting Problem Medium % 1 171 Dynamic Programming - Longest Common Subsequence Medium % 0 170 Dynamic Programming - Rod Cutting Problem Medium % 1 169 Dynamic Programming - Coin Change 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 162 Dynamic Programming - Subset Sum Problem Hard % 0 161 The Word Break Problem Hard % 0 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 147 Introduction To Backtracking Programming Beginner % 0 146 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 145 Dynamic Programming - Minimum Coin Change Problem Medium % 1 144 Introduction To Dynamic Programming - Fibonacci Series Beginner % 1 142 Locate the Farthest Left Node on the Bottom Level Medium % 0 138 Find the Maximum Value in a Binary Tree Beginner % 0 137 Populate Next Right Pointers in Each Node Hard % 0 136 Verifying Mirror Binary Trees Beginner % 1 135 Find Paths with Sum in Binary Tree Medium % 0 134 Diameter Of a Binary Tree Hard % 1 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Swap Nodes in pairs in a Linked List by changing links Convert BST to Greater Sum Tree Reverse a Linked List in groups of given size 'K' Get the Sum of all left leaves in a Binary tree Convert binary tree to its Sum tree Binary Tree Deletion Search the Element in a binary tree - With and Without Recursion Tree Traversals Dynamic Programming - Maximum Product Cutting Problem Dynamic Programming - Longest Common Subsequence Dynamic Programming - Rod Cutting Problem Dynamic Programming - Coin Change 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 - Subset Sum Problem The Word Break Problem 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 Introduction To Backtracking Programming Dynamic Programming - Stairs Climbing Puzzle Dynamic Programming - Minimum Coin Change Problem Introduction To Dynamic Programming - Fibonacci Series Locate the Farthest Left Node on the Bottom Level Find the Maximum Value in a Binary Tree Populate Next Right Pointers in Each Node Verifying Mirror Binary Trees Find Paths with Sum in Binary Tree Diameter Of a Binary Tree 1 2 3 4 5
