## Count of distinct colors in a subtree of a Colored Tree with given min frequency for Q queries

Given a N-ary tree with some colour associated with every node and Q queries. Each query contains two integers A and X. The task 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 a N-ary tree with some colour associated with every node and Q queries. Each query contains two integers A and X. The task is… Read More »

Given a directed graph containing N vertices and M edges, the task is to find all the dependencies of each vertex in the graph and… Read More »

Given a binary valued undirected graph with V vertices and E edges, the task is to find the octal equivalents of all the connected components… Read More »

A mother vertex in a Graph G = (V, E) is a vertex v such that a path from v can reach all other vertices… Read More »

Given a binary tree and Q queries where each query contains a node of the binary tree, the task is to count the number of… Read More »

Given an N-ary tree with weighted edge and Q queries where each query contains two nodes of the tree. The task is to find the… Read More »

Given a tree of N nodes, the task is to find the node having maximum depth starting from the root node, taking the root node… Read More »

Parenthesis Theorem is used in DFS of graph. It states that the descendants in a depth-first-search tree have an interesting property. If v is a… Read More »

Given an undirected graph with V vertices and E edges, the task is to find the maximum contiguous subarray sum among all the connected components… Read More »

Given an array A containing N integers, the task is to count the number of elements which form a cycle in the array, based on… Read More »

Given an undirected acyclic graph having N nodes and M edges, the task is to find the size of the largest tree in the forest… Read More »

Given an undirected tree consisting of N vertices where some of the nodes are special nodes, the task is to visit all the special nodes… Read More »

Given a string S, the task is to find the minimum length string such that every adjacent character of the string remains adjacent in the… Read More »

Given an N-ary tree, and the weights which are in the form of strings of all the nodes, the task is to count the number… Read More »

Given an array arr[][] which contains the edges of a graph to be used to construct an undirected graph G with N nodes, the task… Read More »