## Print the node with the maximum degree in the prufer sequence

Given a Prufer sequence of a Tree, the task is to print the node with the maximum degree in the tree whose Prufer sequence is… Read More »

- Breadth First Search without using Queue
- Shortest Path Faster Algorithm
- Traveling Salesman Problem using Genetic Algorithm
- Minimum Cost Graph
- Minimum cost to reach from the top-left to the bottom-right corner of a matrix
- Convert Adjacency Matrix to Adjacency List representation of Graph
- Count total ways to reach destination from source in an undirected Graph
- Implementing Water Supply Problem using Breadth First Search
- Add and Remove Edge in Adjacency List representation of a Graph
- Program to print all the non-reachable nodes | Using BFS
- Maximum of all distances to the nearest 1 cell from any 0 cell in a Binary matrix
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?
- Diamond Tree
- Add and Remove vertex in Adjacency List representation of Graph
- Add and Remove vertex in Adjacency Matrix representation of Graph
- What is a Webcrawler and where is it used?
- Number of pairs such that path between pairs has the two vertices A and B
- Build a segment tree for N-ary rooted tree
- Minimum number of colors required to color a graph
- Minimum Spanning Tree using Priority Queue and Array List
- Minimum number of Water to Land conversion to make two islands connected in a Grid
- D'Esopo-Pape Algorithm : Single Source Shortest Path
- Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
- Shortest path in a graph from a source S to destination D with exactly K edges for multiple Queries
- Paranthesis Theorem
- Check if a Tree can be split into K equal connected components
- Path with minimum XOR sum of edges in a directed graph
- Shortest path with exactly k edges in a directed and weighted graph | Set 2
- Find a Mother vertex in a Graph using Bit Masking
- Maximal Clique Problem | Recursive Solution

Given a Prufer sequence of a Tree, the task is to print the node with the maximum degree in the tree whose Prufer sequence is… Read More »

Given a tree, and the weights of all the nodes, the task is to count the nodes whose weights are divisible by x. Examples: Input:… Read More »

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weights are… Read More »

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

Given a tree and the weights of all the nodes, the task is to count the number of nodes whose weights are even parity i.e.… 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 power of… Read More »

Given a tree, and the weights of all the nodes, the task is to find the root of the sub-tree whose weighted sum is minimum.… Read More »

Given two strings s1 and s2 of same length, the task is to count the minimum number of pairs of characters (c1, c2) such that… Read More »

Given a tree, and the weights of all the nodes, the task is to find the root of the sub-tree whose weighted sum XOR with… Read More »

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

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is prime. Examples: Input:… 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 Square.… Read More »

Given a tree, and the weights of all the nodes and an integer x, the task is to find a node i such that weight[i]… Read More »

Given a tree, and the weights of all the nodes and an integer x, the task is to find a node i such that |weight[i]… Read More »