## Conversion of an Undirected Graph to a Directed Euler Circuit

Given an undirected graph with V nodes (say numbered from 1 to V) and E edges, the task is to check whether the graph is… Read More »

- Count total ways to reach destination from source in an undirected Graph
- Paranthesis Theorem
- Count nodes in the given tree whose weight is a fibonacci number
- Find a Mother vertex in a Graph using Bit Masking
- Minimum time required to visit all the special nodes of a Tree
- Count of distinct colors in a subtree of a Colored Tree with given min frequency for Q queries
- Count of different groups using Graph
- Minimum Cost of Simple Path between two nodes in a Directed and Weighted Graph
- Count of elements which form a loop in an Array according to given constraints
- Lowest Common Ancestor for a Set of Nodes in a Rooted Tree
- Minimum labelled node to be removed from undirected Graph such that there is no cycle
- Find dependencies of each Vertex in a Directed Graph
- Maximum weighted edge in path between two nodes in an N-ary tree using binary lifting
- Find GCD of each subtree of a given node in an N-ary Tree for Q queries
- Largest subarray sum of all connected components in undirected graph
- Count the nodes in the given Tree whose weight is a Perfect Number
- Largest component size in a graph formed by connecting non-co-prime nodes
- Minimum Bipartite Groups
- Count of unique lengths of connected components for an undirected graph using STL
- Minimum value of distance of farthest node in a Graph
- Count of nodes having odd divisors in the given subtree for Q queries
- Find the maximum component size after addition of each edge to the graph
- Count ways to change direction of edges such that graph becomes acyclic
- Count the number of walks of length N where cost of each walk is equal to a given number
- Minimum valued node having maximum depth in an N-ary Tree
- Size of the Largest Trees in a Forest formed by the given Graph
- Octal equivalents of connected components in Binary valued graph
- Count of leaf nodes of the tree whose weighted string is a palindrome
- Print the nodes of the Binary Tree whose height is a Prime number
- Minimum string such that every adjacent character of given string is still adjacent

Given an undirected graph with V nodes (say numbered from 1 to V) and E edges, the task is to check whether the graph is… Read More »

Given a binary tree, our task is to print the nodes whose height is a prime number starting from the root node. Examples: Input: 1… Read More »

Given an undirected graph, the task is to find the size of each connected component and print the number of unique sizes of connected components… Read More »

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is a Perfect number.… Read More »

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is a Powerful Number.… Read More »

Given a weighted undirected graph, Length of walks N and Cost X. The task is to count the number of different walks W of length… Read More »

Given a rooted tree with N nodes, the task is to find the Lowest Common Ancestor for a given set of nodes V of that… Read More »

Given a graph with N nodes and their values defined in array A, the task is to find the largest component size in a graph… Read More »

Given an undirected graph of N nodes labelled from 1 to N, the task is to find the minimum labelled node that should be removed… Read More »

Given an undirected graph, a source vertex ‘s’ and a destination vertex ‘d’, the task is to count total paths from given ‘s’ to ‘d’.… Read More »

Given a directed graph, which may contain cycles, where every edge has weight, the task is to find the minimum cost of any simple path… Read More »

Given a tree with the weights of all the nodes, the task is to count the number of nodes whose weight is a Fibonacci number.… Read More »

Given Adjacency List representation of graph of N vertices from 1 to N, the task is to count the minimum bipartite groups of the given… Read More »

Given a directed and unweighted graph consisting of N vertices and an array arr[] where ith vertex have a directed edge to arr[i]. The task… Read More »

Given an acyclic undirected graph having N nodes and N-1 edges in the form of a 2D array arr[][] in which every row consists of… Read More »