Similar Topics

Web Technologies32.1K+ articles

DSA20.6K+ articles

Misc7.7K+ articles

Arrays4.2K+ articles

Graph565+ articles

DFS361+ articles

BFS228+ articles

graph-connectivity64+ articles

Graph Traversals45+ articles

Graph Coloring29+ articles

graph-cycle

59 posts

Longest Colored Path

Last Updated: 05 September 2026

Given an undirected acyclic graph (tree) with n nodes numbered from 1 to n. Each node is colored either Red (R) or Blue (B).The colors of the nodes are given by a string s...read more

article_image

Find all Critical Connections in the Graph

Last Updated: 23 July 2025

Given an undirected Connected graph of V vertices and E edges. A critical connectionis an edge that, if removed, will make some nodes unable to reach some other nodes, the...read more

article_image

Data Structures-Graph

Check if adding an edge makes the Undirected Graph cyclic or not

Last Updated: 23 July 2025

Given an undirected graph, the task is to if adding an edge makes the graph cyclic or not.In an Undirected graph, a cycle is a path of edges that connects a sequence of ve...read more

Technical Scripter

Technical Scripter 2022

Check whether an undirected graph contains cycle or not

Last Updated: 23 July 2025

Given an undirected graph, the task is to check whether it has a cycle or not, and if it has a cycle return the vertices of the cycle.Examples:Input:Example-1Output: Cycle...read more

article_image

Floyd’s Cycle Finding Algorithm

Last Updated: 23 July 2025

Floyd's cycle finding algorithm or Hare-Tortoise algorithm is a pointer algorithm that uses only two pointers, moving through the sequence at different speeds. This algori...read more

Check if a cycle exists between nodes S and T in an Undirected Graph with only S and T repeating | Set - 2

Last Updated: 23 July 2025

Given an undirected graph with N nodes and two vertices S T, the task is to check if a cycle between these two vertices exists (and return it) or not, such that no other ...read more

article_image

The Earliest Moment When Everyone Become Friends

Last Updated: 23 July 2025

Given a group of N people, each having a unique ID value from 0 to (N - 1) and an array arr[] of M elements of the form {U, V, time} representing that the person U will be...read more

graph-connectivity

Interview-Questions

Check if a cycle exists between nodes S and T in an Undirected Graph with only S and T repeating

Last Updated: 23 July 2025

Given an undirected graph with N nodes and two vertices S T, the task is to check if a cycle between these two vertices exists or not, such that no other node except S an...read more

article_image

Count all Hamiltonian paths in a given directed graph

Last Updated: 03 October 2025

Given a directed graph of N vertices valued from 0 to N - 1 and array graph[] of size K represents the Adjacency List of the given graph, the task is to count all Hamilton...read more

article_image

graph-connectivity

Graph Traversals

Print all Hamiltonian Cycles in an Undirected Graph

Last Updated: 23 July 2025

Given an undirected Graph consisting of N nodes in the form of an adjacency matrix graph[][] of size N*N, the task is to print all Hamiltonian cycles possible in the given...read more

graph-connectivity

Graph Traversals

Minimum number of swaps required to minimize sum of absolute differences between adjacent array elements

Last Updated: 23 July 2025

Given an array arr[] consisting of N distinct positive integers, the task is to find the minimum number of elements required to be swapped to minimize the sum of absolute ...read more

array-rearrange

Minimize number of notes required to be distributed among students

Last Updated: 23 July 2025

Given an array arr[] consisting of N strings representing the name of the students in the class and another array of pairs P[][2] such that P[i][0] likes P[i][1], the task...read more

article_image

graph-connectivity

Graph Traversals

connected-components

Minimum degree of three nodes forming a triangle in a given Graph

Last Updated: 23 July 2025

Given an undirected graph consisting of N vertices and M edges and an array edges[][], with each row representing two vertices connected by an edge, the task is to find th...read more

article_image

graph-connectivity

Graph Traversals

Maximum Bitwise XOR of node values of an Acyclic Graph made up of N given vertices using M edges

Last Updated: 23 July 2025

Given N nodes valued by [1, N], an array arr[] consisting of N positive integers such that the ith node ( 1-based indexing ) has the value arr[i] and an integer M, the tas...read more

Check if a graph constructed from an array based on given conditions consists of a cycle or not

Last Updated: 23 July 2025

Given an array arr[] consisting of first N natural numbers, construct an undirected graph using the array elements such that for any array element, connect an edge with th...read more

article_image

1 2 3 4