Given three integers N, A and B, the task is to calculate the probability that the sum of numbers obtained on throwing the dice exactly… Read More

# Tag Archives: Algorithms-Dynamic Programming

Given an array arr[] of N positive integers. The task is to find the length of the shortest sub-sequence such that the GCD of the… Read More

Give an integer N, the task is to find the minimum number of moves to reduce N to 0 by one of the following operations:… Read More

Given a string S, the task is to find the count of maximum occurring subsequence P from S using only those characters whose indexes are… Read More

Given a number N, the task is to find the number of ways in which the integer N can be represented as a sum of… Read More

Given a string S of length N which only contains lowercase alphabets. Find the length of the longest substring of S such that the characters… Read More

Given a tree with N nodes value from 1 to N and (N – 1) Edges and a number K, the task is to remove… Read More

Given N number of envelopes, as {W, H} pair, where W as the width and H as the height. One envelope can fit into another… Read More

Given a matrix mat[][] with N rows and M columns. The task is to find the minimum number of changes required in the matrix such… Read More

Given an array arr[] of N positive integers, the task is to find the largest strictly increasing subsequence of arr[] such that the indices of… Read More

Given three integers, N, K and M. The task is to find out the number of binary strings of length N which always starts with… Read More

Given a Matrix of size N*N filled with 1‘s and 0‘s, the task is to find the maximum distance from a 0-cell to its nearest… Read More

A string is called good if it is made with only digits 0 to 9 and adjacent elements are different. The task is to find… Read More