## Number of times an array can be partitioned repetitively into two subarrays with equal sum

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 »

- Perfect Sum Problem
- Construct a Doubly linked linked list from 2D Matrix
- Print Palindromic Paths of Binary tree
- Count total ways to reach destination from source in an undirected Graph
- Longest common subarray in the given two arrays
- Number of pairs such that path between pairs has the two vertices A and B
- Smallest N digit number whose sum of square of digits is a Perfect Square
- Solving Sudoku using Bitwise Algorithm
- Length of longest palindromic sub-string : Recursion
- Print path from given Source to Destination in 2-D Plane
- Maximum sum of elements divisible by K from the given array
- Print all possible combinations of words from Dictionary using Trie
- Print Strings In Reverse Dictionary Order Using Trie
- Maximum number of strings that can be formed with given zeros and ones
- Length of longest Palindromic Subsequence of even length with no two adjacent characters same
- Minimum colors required such that edges forming cycle do not have same color
- Count even paths in Binary Tree
- Minimum count of numbers required from given array to represent S
- Count the number of Prime Cliques in an undirected graph
- Traverse the matrix in Diagonally Bottum-Up fashion using Recursion
- Minimize the count of adjacent pairs with different parity
- Print all paths of the Binary Tree with maximum element in each path greater than or equal to K
- Count of exponential paths in a Binary Tree
- Middle To Up-Down Order traversal of a Binary Tree
- Difference between Backtracking and Branch-N-Bound technique

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 »

Given a matrix mat[][] of size N x N, the task is to traverse the matrix Diagonally in Bottom-up fashion using recursion. Diagonally Bottum-up Traversal:… Read More »

Given a partially filled 9×9 matrix, digits (from 1 to 9) must be assigned to the empty cells so that every row, column, and submatrix… Read More »

Trie is an efficient information retrieval data structure. Using Trie, search complexities can be brought to an optimal limit. Given an array of strings. The… 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 an integer N, find the smallest N digit number such that the sum of the square of digits (in decimal representation) of the number… Read More »

Given a 2D matrix, the task is to convert it into a doubly-linked list with four pointers that are next, previous, up and down, each… Read More »

Given an array arr of size N containing some integers from the range [1, N] and -1 in the remaining indices, the task is to… Read More »

Given a Binary Tree, the task is to count the number of Exponential paths in the given Binary Tree. Exponential Path is a path where… Read More »

Given an undirected connected graph and two vertices A and B, the task is to find the number of pairs of vertices {X, Y} such… Read More »

Given a string S, the task is to find the length longest sub-string which is a palindrome Examples: Input: S = “aaaabbaa” Output: 6 Explanation:… Read More »