## Queries to find the Minimum Weight from a Subtree of atmost D-distant Nodes from Node X

Given an N-ary Tree rooted at 1, and an array val[] consisting of weights assigned to every node, and a matrix Q[][], consisting of queries… Read More »

- Perfect Sum Problem
- Construct a Doubly linked linked list from 2D Matrix
- Longest common subarray in the given two arrays
- Print Palindromic Paths of Binary tree
- Count total ways to reach destination from source in an undirected Graph
- Length of longest palindromic sub-string : Recursion
- Number of pairs such that path between pairs has the two vertices A and B
- Solving Sudoku using Bitwise Algorithm
- Smallest N digit number whose sum of square of digits is a Perfect Square
- Maximum sum of elements divisible by K from the given array
- Print path from given Source to Destination in 2-D Plane
- Print all possible combinations of words from Dictionary using Trie
- Check if any King is unsafe on the Chessboard or not
- Queries to find the Minimum Weight from a Subtree of atmost D-distant Nodes from Node X
- Maximum number of strings that can be formed with given zeros and ones
- Print Strings In Reverse Dictionary Order Using Trie
- Split a Numeric String into Fibonacci Sequence
- Difference between Backtracking and Branch-N-Bound technique
- Minimum colors required such that edges forming cycle do not have same color
- Minimum count of numbers required from given array to represent S
- Print all possible ways to write N as sum of two or more positive integers
- Count even paths in Binary Tree
- Traverse the matrix in Diagonally Bottum-Up fashion using Recursion
- N-Queen Problem | Local Search using Hill climbing with random neighbour
- Minimum Cost Path in a directed graph via given set of intermediate nodes
- Minimize the count of adjacent pairs with different parity
- Count the number of Prime Cliques in an undirected graph
- Print all paths of the Binary Tree with maximum element in each path greater than or equal to K
- Maximum size subset with given sum using Backtracking
- Maximal Independent Set in an Undirected Graph

Given an N-ary Tree rooted at 1, and an array val[] consisting of weights assigned to every node, and a matrix Q[][], consisting of queries… Read More »

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. For example,… Read More »

Given an integer N, the task is to print all the possible ways in which N can be written as the sum of two or… Read More »

Given a matrix board[][] consisting of the characters K or k, Q or q, B or b, N or n, R or r, and P… Read More »

Given a numeric string S representing a large number, the task is to form a Fibonacci Sequence of at least length 3 from the given… Read More »

Given a weighted, directed graph G, an array V[] consisting of vertices, the task is to find the Minimum Cost Path passing through all the… Read More »

Given an integer X, the task is to convert 1 into X by using the below-given operations: Multiply the number by 2. Multiply the number… Read More »

Given an undirected graph defined by the number of vertex V and the edges E[ ], the task is to find Maximal Independent Vertex Set… Read More »

Given an undirected graph with V vertices and E edges, the task is to print all the independent sets and also find the maximal independent… Read More »

Given an array arr[] consisting of N integers and an integer K, the task is to find the length of longest subsequence with sum equal… Read More »

Given an array arr[] of size N, the task is to find the number of times the array can be partitioned repetitively into two subarrays… Read More »

Given an array arr[] of N integers and two numbers K and S, the task is to print all the subsquence of length K with… Read More »

Given an integer S and an array arr[], the task is to find the minimum number of elements whose sum is S, such that any… Read More »

Algorithms are the methodical sequence of steps which are defined to solve complex problems. In this article, we will see the difference between two such… Read More »

Given a graph with N nodes and E edges, the task is to count the number of clique having their size as a prime number… Read More »