Skip to content

Category Archives: Dynamic Programming

Given two binary strings A and B of length N, the task is to count the minimum number of operations required to make the two… Read More
Given an integer N and an array arr[ ] of size N, the task is to find the maximum jumps to reach the end of… Read More
Given a positive integer N, the task is to find the number of N-digit numbers such that at least one digit in the number has… Read More
Given a positive integer K, and an array arr[] consisting of N( =9) integers such that arr[i] represents the cost of the digit (i+1), the… Read More
Given an array arr[] consisting of N integers, the task is to find the longest subsequence such that the prefix sum at each position of… Read More
Given a positive integer N, the task is to find the number of N-digit numbers such that every digit is smaller than its adjacent digits.… Read More
Given a sorted array arr[] consisting of N positive integers such that arr[i] represent the days in which a worker will work and an array… Read More
Given an integer N, the task is to print all possible Full Binary Trees with N nodes. The value at the nodes does not contribute… Read More
Given a matrix mat[][] of size N×M where each row of the matrix is a permutation of the elements from [1, M], the task is… Read More
Given a positive integer N, the task is to count the number of N-digit numbers where each digit in the number is the mean of… Read More
Given a positive integer N, the task is to count the number of N-digit numbers such that the bitwise AND of adjacent digits equals 0.… Read More
Given a complete graph having N nodes and N*(N-1)/2 edges and a positive integer K, the task is to find the number of ways if… Read More
Given a string S, the task is to find the length of the shortest compressed string. The string can be compressed in the following way:… Read More