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 449 Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS) Hard % 0 448 Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm Medium % 0 447 Check If Given Undirected Graph is a tree Medium % 0 444 Articulation Points OR Cut Vertices in a Graph Hard % 0 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 439 Determine the given routing number belong to which bank Medium % 0 438 Check if interval is covered in given coordinates Medium % 0 436 Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Medium % 0 433 Depth-First Search (DFS) in 2D Matrix/2D-Array - Iterative Solution Beginner % 0 431 Check the completeness of given binary tree | Set 1 - Using Node Count Medium % 0 429 Find all the Armstrong numbers in the given range Beginner % 0 428 Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Medium % 0 427 Number of Islands using BFS Medium % 0 426 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 424 Check if given undirected graph is connected or not Beginner % 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 418 Social Network Problem Hard % 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 413 ZigZag OR Diagonal traversal in 2d array/Matrix using queue Medium % 0 412 Check if Number is divisible by its digits Beginner % 0 411 Check if the given number is Armstrong number or not Beginner % 0 410 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 409 Minimum Boats Required to rescue people Medium % 0 407 Integer Replacement Problem Medium % 0 406 Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2 Medium % 0 405 Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1 Medium % 0 404 Find all the numbers in the range which has prime set bits. Beginner % 0 403 Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS) Hard % 0 Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS) Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm Check If Given Undirected Graph is a tree Articulation Points OR Cut Vertices in a Graph 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 Determine the given routing number belong to which bank Check if interval is covered in given coordinates Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Depth-First Search (DFS) in 2D Matrix/2D-Array - Iterative Solution Check the completeness of given binary tree | Set 1 - Using Node Count Find all the Armstrong numbers in the given range Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Number of Islands using BFS Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Check if given undirected graph is connected or not 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 Social Network Problem 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 ZigZag OR Diagonal traversal in 2d array/Matrix using queue Check if Number is divisible by its digits Check if the given number is Armstrong number or not Evaluation of Prefix Expressions (Polish Notation) | Set 1 Minimum Boats Required to rescue people Integer Replacement Problem Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2 Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1 Find all the numbers in the range which has prime set bits. Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
