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 486 Sort the indexes of the array as per the elements of the array Medium % 0 483 Find Lexicographically smallest or largest substring of size k Beginner % 0 482 Largest word in dictionary by removing a few characters from the given string Beginner % 0 480 Check if one string is a subsequence of another string. Beginner % 0 479 Most frequent word Beginner % 0 478 Efficient Robot Problem - Find Minimum Trips Hard % 0 477 Job Sequencing algorithm Medium % 1 473 Given an array, count the number of pairs with a given sum. Beginner % 0 465 Find all subsets of size K from a given number N (1 to N) Medium % 0 464 Sum of distinct elements among two given sets Beginner % 0 458 Print sorted unique elements of a given array Beginner % 0 455 Replace array elements with maximum element on the right. Medium % 0 454 Find all unique combinations of numbers (from 1 to 9 ) with sum to N Medium % 0 449 Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS) Hard % 0 446 Print all middle elements of the given matrix/2D array. Beginner % 1 445 Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution Beginner % 1 443 Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Medium % 0 442 Find the number of distinct Islands OR connected components. Hard % 0 441 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 0 440 Given an array, Print sum of all subsets Beginner % 1 437 Lexicographically previous permutation With One swap Medium % 1 434 Print boundary of given matrix/2D array. Beginner % 1 433 Depth-First Search (DFS) in 2D Matrix/2D-Array - Iterative Solution Beginner % 0 432 Breadth-First Search (BFS) in 2D Matrix/2D-Array Beginner % 1 430 Longest substring with at most K unique characters Medium % 2 428 Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Medium % 0 423 Given Graph - Remove a vertex and all edges connect to the vertex Medium % 0 422 Print Stack in reverse order Beginner % 0 419 Print all subsets of an array with a sum equal to zero Medium % 0 417 Maximum number edges to make Acyclic Undirected/Directed Graph Beginner % 0 416 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 415 Hamming Distance between two given strings Beginner % 0 414 Breadth-First Search in Disconnected Graph Medium % 0 410 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 400 Reverse the Directed Graph Beginner % 0 Sort the indexes of the array as per the elements of the array Find Lexicographically smallest or largest substring of size k Largest word in dictionary by removing a few characters from the given string Check if one string is a subsequence of another string. Most frequent word Efficient Robot Problem - Find Minimum Trips Job Sequencing algorithm Given an array, count the number of pairs with a given sum. Find all subsets of size K from a given number N (1 to N) Sum of distinct elements among two given sets Print sorted unique elements of a given array Replace array elements with maximum element on the right. Find all unique combinations of numbers (from 1 to 9 ) with sum to N Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS) Print all middle elements of the given matrix/2D array. Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Find the number of distinct Islands OR connected components. Print All Paths in Dijkstra's Shortest Path Algorithm Given an array, Print sum of all subsets Lexicographically previous permutation With One swap Print boundary of given matrix/2D array. Depth-First Search (DFS) in 2D Matrix/2D-Array - Iterative Solution Breadth-First Search (BFS) in 2D Matrix/2D-Array Longest substring with at most K unique characters Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Given Graph - Remove a vertex and all edges connect to the vertex Print Stack in reverse order Print all subsets of an array with a sum equal to zero Maximum number edges to make Acyclic Undirected/Directed Graph Evaluation of Prefix Expressions (Polish Notation) | Set 2 Hamming Distance between two given strings Breadth-First Search in Disconnected Graph Evaluation of Prefix Expressions (Polish Notation) | Set 1 Reverse the Directed Graph 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
