## Sum of elements of all partitions of number such that no element is less than K

Given an integer N, the task is to find an aggregate sum of all integer partitions of this number such that each partition does not… Read More »

- Minimum steps to reach target by a Knight | Set 2
- Number of ways to reach Nth floor by taking at-most K leaps
- Water Jug Problem using Memoization
- Longest Decreasing Subsequence
- Find all distinct subset (or subsequence) sums of an array | Set-2
- Number of paths from source to destination in a directed acyclic graph
- Different ways to represent N as sum of K non-zero integers
- Number of ways to represent a number as sum of k fibonacci numbers
- Number of Unique BST with a given key | Dynamic Programming
- Minimum cost to reach the top of the floor by climbing stairs
- Tetranacci Numbers
- Number of ways to form an array with distinct adjacent elements
- Sum of elements of all partitions of number such that no element is less than K
- Minimum number of single digit primes required whose sum is equal to N
- Maximum sub-matrix area having count of 1's one more than count of 0's
- Total number of decreasing paths in a matrix
- Weird Number
- Maximize the number of segments of length p, q and r
- Algorithms | Dynamic Programming | Question 5
- Algorithms | Dynamic Programming | Question 4
- Number of different cyclic paths of length N in a tetrahedron
- Algorithms | Dynamic Programming | Question 2
- Algorithms | Dynamic Programming | Question 7
- Algorithms | Dynamic Programming | Question 7
- Algorithms | Dynamic Programming | Question 3

Given an integer N, the task is to find an aggregate sum of all integer partitions of this number such that each partition does not… Read More »

Given two jugs with the maximum capacity of m and n liters respectively. The jugs don’t have markings on them which can help us to… Read More »

Given a Directed Acyclic Graph with n vertices and m edges. The task is to find the number of different paths that exist from a… Read More »

The tetranacci numbers are a generalization of the Fibonacci numbers defined by the recurrence relation T(n) = T(n-1) + T(n-2) + T(n-3) + T(n-4) with… Read More »

In number theory, a weird number is a natural number that is abundant but not semiperfect. In other words, the sum of the proper divisors… Read More »

Given N number of stairs. Also given the number of steps that one can cover at most in one leap (K). The task is to… Read More »

Given two numbers N and K. Find the number of ways to represent N as the sum of K Fibonacci numbers. Examples: Input : n… Read More »

Find the minimum number of single-digit prime numbers required whose sum will be equal to N. Examples: Input: 11 Output: 3 Explanation: 5 + 3… Read More »

Given N non-negative integers which signifies the cost of the moving from each stair. Paying the cost at i-th step, you can either climb one… Read More »

Given an array of N positive integers write an efficient function to find the sum of all those integers which can be expressed as the… Read More »

Given a tetrahedron(vertex are A, B, C, D), the task is to find the number of different cyclic paths with length n from a vertex.… Read More »

Given a N x N binary matrix. The problem is finding the maximum area sub-matrix having a count of 1’s one more than count of… Read More »

Given a square chessboard of N x N size, the position of Knight and position of a target is given, the task is to find… Read More »

Given three integers N, M and X, the task is to find the number of ways to form an array, such that all consecutive numbers… Read More »

Given a rod of length L, the task is to cut the rod in such a way that the total number of segments of length… Read More »