# Status Problem Level Completes Likes 36 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 37 Swap Nodes in pairs in a Linked List by changing links Medium % 0 38 Convert BST to Greater Sum Tree Medium % 0 39 Reverse a Linked List in groups of given size 'K' Medium % 0 40 Get the Sum of all left leaves in a Binary tree Beginner % 1 41 Convert binary tree to its Sum tree Medium % 1 42 Delete the Binary Tree Beginner % 0 43 Search the Element in a binary tree - With and Without Recursion Beginner % 0 44 Tree Traversals Beginner % 1 45 Dynamic Programming - Maximum Product Cutting Problem. Medium % 1 46 Dynamic Programming - Longest Common Subsequence Medium % 0 47 Dynamic Programming - Rod Cutting Problem Medium % 1 48 Dynamic Programming - Coin Change Problem Medium % 1 49 Generate Well Ordered Passwords of a Given Length K Medium % 0 50 All N Length Strings from Given String of Length K Medium % 0 51 Print All N Length Strings from Given Number K Hard % 0 52 Print All Possible Subsets with Sum equal to a given Number Hard % 0 53 Dynamic Programming - Subset Sum Problem Hard % 0 54 The Word Break Problem Hard % 0 55 Backtracking - Knight's Tour Problem Hard % 0 56 Backtracking - Search a Word In a Matrix Hard % 0 57 Backtracking - N Queens Problem - Better Solution Hard % 0 58 Backtracking - N Queens Problem Hard % 0 59 Backtracking - Rat In A Maze Puzzle Hard % 0 60 Backtracking - SUDOKU Solver Hard % 0 61 Introduction To Backtracking Programming Beginner % 0 62 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 63 Dynamic Programming - Minimum Coin Change Problem Medium % 1 64 Introduction To Dynamic Programming - Fibonacci Series Beginner % 1 65 Find the Deepest Left Node in a Binary Tree. Medium % 0 66 Find the Max element in a Given Binary Tree Beginner % 0 67 Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node Hard % 0 68 Check If One Binary is Mirror Tree of another Binary Tree. Beginner % 1 69 Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number Medium % 0 70 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 Delete the Binary Tree 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 Print All N Length Strings from Given Number K Print All Possible Subsets with Sum equal to a given Number Dynamic Programming - Subset Sum Problem The Word Break Problem 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 Backtracking - SUDOKU Solver Introduction To Backtracking Programming Dynamic Programming - Stairs Climbing Puzzle Dynamic Programming - Minimum Coin Change Problem Introduction To Dynamic Programming - Fibonacci Series Find the Deepest Left Node in a Binary Tree. Find the Max element in a Given Binary Tree Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node Check If One Binary is Mirror Tree of another Binary Tree. Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number Diameter Of a Binary Tree 1 2 3 4 5
