Featured Lists Top 20 Problems on Dynamic programming Top 10 Problems on Backtracking Top 20 Problems on Graph Top 25 Problems on Trees Top 10 Problems on Bits Manipulation Top 15 Problems in LinkedList All Problems # Status Problem video Level Completes Likes 168 Dynamic Programming - Minimum Cost Path Problem Medium % 1 163 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 160 Dynamic Programming - Longest Increasing Subsequence Medium % 1 152 Breadth-First Search/Traversal in a Graph Beginner % 1 149 Backtracking - Rat In A Maze Puzzle Hard % 0 146 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 145 Dynamic Programming - Minimum Coin Change Problem Medium % 1 132 Find the Deepest Node in a Binary Tree Medium % 1 116 Generate All Balanced Parentheses Combinations (N Pairs) Medium % 1 112 Generate All n-Bit Binary Strings Medium % 1 111 Find Unique Number in Array with Duplicates (Except One) Beginner % 1 97 Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard % 0 74 Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Hard % 0 73 Lowest Common Ancestor in a Binary Search Tree. Medium % 0 68 Transforming a Binary Tree into its Mirror Image Beginner % 0 67 Printing Nodes without Siblings in a Binary Tree Beginner % 0 66 Convert a Sorted Doubly Linked List to Balanced BST Medium % 1 62 In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium % 0 61 Determine If Two Nodes are Cousins Medium % 0 48 Determining Whether a Given Binary Tree is a Binary Search Tree (BST) Medium % 1 38 Determining Binary Tree Balance Medium % 0 37 Get the Height of a Node in a Binary Tree Medium % 0 33 Reverse the binary representation of a number. Medium % 1 30 Swap Every Kth Node in a LinkedList Medium % 0 26 Check if one string is Rotation of another string Beginner % 1 23 Find Whether Two Strings are Permutation of each other Beginner % 1 20 Reverse a Linked List Beginner % 0 18 All Paths from Top Left to Bottom Right in 2D Array Medium % 0 17 Merge or Combine Two Sorted Linked Lists Medium % 0 15 Efficiently Rearrange Positive and Negative Numbers in Array on Each Side Hard % 0 9 Valid or Well Formed Parentheses | Part - 1 Medium % 0 7 Determine If a String is Palindrome Beginner % 0 4 Find a Missing Number From a Sequence of Consecutive Numbers Beginner % 0 2 Merge Sort - Updated - Most Efficient ways to Implement Medium % 1 532 Maximum Depth of Valid Nested Parentheses in an arithmetic expression Medium % 0 Dynamic Programming - Minimum Cost Path Problem Dynamic Programming - Maximum size square sub-matrix with all 1s Dynamic Programming - Longest Increasing Subsequence Breadth-First Search/Traversal in a Graph Backtracking - Rat In A Maze Puzzle Dynamic Programming - Stairs Climbing Puzzle Dynamic Programming - Minimum Coin Change Problem Find the Deepest Node in a Binary Tree Generate All Balanced Parentheses Combinations (N Pairs) Generate All n-Bit Binary Strings Find Unique Number in Array with Duplicates (Except One) Construct Binary Search Tree from a given Preorder Traversal using Recursion Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Lowest Common Ancestor in a Binary Search Tree. Transforming a Binary Tree into its Mirror Image Printing Nodes without Siblings in a Binary Tree Convert a Sorted Doubly Linked List to Balanced BST In a Binary Tree, Check if Two nodes has the same parent or are siblings Determine If Two Nodes are Cousins Determining Whether a Given Binary Tree is a Binary Search Tree (BST) Determining Binary Tree Balance Get the Height of a Node in a Binary Tree Reverse the binary representation of a number. Swap Every Kth Node in a LinkedList Check if one string is Rotation of another string Find Whether Two Strings are Permutation of each other Reverse a Linked List All Paths from Top Left to Bottom Right in 2D Array Merge or Combine Two Sorted Linked Lists Efficiently Rearrange Positive and Negative Numbers in Array on Each Side Valid or Well Formed Parentheses | Part - 1 Determine If a String is Palindrome Find a Missing Number From a Sequence of Consecutive Numbers Merge Sort - Updated - Most Efficient ways to Implement Maximum Depth of Valid Nested Parentheses in an arithmetic expression 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
