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 523 Add digits until the number becomes a single digit Beginner % 0 522 Check If Student is eligible for an Attendance Reward Beginner % 0 520 Remove Duplicates in a given Sorted Array Beginner % 0 518 Replace Elements with Greatest Element on Right Beginner % 0 517 Count number of pairs in an array with sum = K Medium % 0 515 Maximum distance from the nearest person Medium % 1 509 Find the Number of Contiguous Parking Areas Medium % 1 503 Minimum Deletions to make the occurrence of each character unique. Hard % 1 499 Compare two version numbers of a software Medium % 1 435 Hamming Distance between two given integers Beginner % 1 425 Check if the given binary tree is Full or not Beginner % 1 357 Count Set bits in a given Number Beginner % 1 267 Graph – Depth First Search using Recursion Beginner % 1 243 Find two non-repeating numbers in an array in O(n) time and O(1) space Hard % 1 209 Find longest Snake sequence in a given matrix Medium % 1 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 204 Dynamic Programming - Edit Distance Problem Hard % 2 189 Convert BST to Greater Sum Tree Medium % 0 183 Convert binary tree to its Sum tree Medium % 1 174 Dynamic Programming - Maximum Product Cutting Problem Medium % 1 170 Dynamic Programming - Rod Cutting Problem Medium % 1 169 Dynamic Programming - Coin Change 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 146 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 134 Diameter Of a Binary Tree Hard % 1 121 Print All the Subsets of a Given Set (Power Set) Hard % 1 116 Generate All Balanced Parentheses Combinations (N Pairs) Medium % 1 94 Depth First Search/Traversal in Binary Tree Beginner % 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 69 Convert Sorted Singly Linked List to Balanced Binary Search Tree Medium % 1 48 Determining Whether a Given Binary Tree is a Binary Search Tree (BST) Medium % 1 Add digits until the number becomes a single digit Check If Student is eligible for an Attendance Reward Remove Duplicates in a given Sorted Array Replace Elements with Greatest Element on Right Count number of pairs in an array with sum = K Maximum distance from the nearest person Find the Number of Contiguous Parking Areas Minimum Deletions to make the occurrence of each character unique. Compare two version numbers of a software Hamming Distance between two given integers Check if the given binary tree is Full or not Count Set bits in a given Number Graph – Depth First Search using Recursion Find two non-repeating numbers in an array in O(n) time and O(1) space Find longest Snake sequence in a given matrix 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 Dynamic Programming - Edit Distance Problem Convert BST to Greater Sum Tree Convert binary tree to its Sum tree Dynamic Programming - Maximum Product Cutting Problem Dynamic Programming - Rod Cutting Problem Dynamic Programming - Coin Change Problem Dynamic Programming - Maximum size square sub-matrix with all 1s Dynamic Programming - Longest Increasing Subsequence Breadth-First Search/Traversal in a Graph Dynamic Programming - Stairs Climbing Puzzle Diameter Of a Binary Tree Print All the Subsets of a Given Set (Power Set) Generate All Balanced Parentheses Combinations (N Pairs) Depth First Search/Traversal in Binary Tree Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Lowest Common Ancestor in a Binary Search Tree. Convert Sorted Singly Linked List to Balanced Binary Search Tree Determining Whether a Given Binary Tree is a Binary Search Tree (BST) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
