Number of islands
Concepts Used Depth First Search, Disjoint Set Difficulty Level Medium Problem Statement : Given a 2D matrix, which contains only two numbers 0 or 1. In the map group of...
Ragnar Lorthbrok
Concepts Used Breadth First Search Difficulty Level Easy Problem Statement : Given locations of X & Y islands, we need to find the minimum distance between a given pair of...
Shortest cycle
Concepts Used Breadth First Search Difficulty Level Hard Problem Statement : Given a graph we have to find the length of the shortest cycle in the given graph. If no...
Graph Tree
Concepts Used Depth First Search, Graph Difficulty Level Medium Problem Statement : Check whether the graph is a tree or not. See original problem statement here Solution Approach : Introduction...
Clan War
Concepts Used Depth First Search, Disjoint Set Difficulty Level Medium Problem Statement : There are two clans numbered sequentially from 1 to N and given two integers, u and v...
Count Components
Concepts Used Depth First Search, Disjoint Set Difficulty Level Easy Problem Statement : Given an undirected graph, print Yes if a cycle is present in the graph else print No....
Detect Cycle
Concepts Used Breadth First Search, Disjoint Set Difficulty Level Easy Problem Statement : Given an undirected graph, print Yes if a cycle is present in the graph else print No....
Hop Digits
Concepts Used Breadth First Search Difficulty Level Hard Problem Statement : Given a string , we are standing at the starting point and we have to reach end in minimum...
Longest Path
Concepts Used Breadth First Search Difficulty Level Medium Problem Statement : Given an unweighted, undirected tree print the length of the longest path See original problem statement here Solution Approach...
Maximum Edges
Concepts Used Depth First Search, Disjoint Set Difficulty Level Medium Problem Statement : Given N number of vertices, M number of edges and relation between them to form an undirected...
Edge Divide(C, JAVA CODE NOT INCLUDED)
Concepts Used Depth First Search Difficulty Level Hard Problem Statement : Given an undirected connected graph, you must find all the edges which when removed divide the graph. See original...