## Paths with maximum number of ‘a’ from (1, 1) to (X, Y) vertically or horizontally

Given a N X N matrix consisting of characters. Also given are Q queries, where each query contains a co-ordinate (X, Y). For every query,… Read More »

- Largest Sum Contiguous Subarray
- Longest Common Subsequence | DP-4
- Longest Increasing Subsequence | DP-3
- Coin Change | DP-7
- 0-1 Knapsack Problem | DP-10
- Subset Sum Problem | DP-25
- Top 20 Dynamic Programming Interview Questions
- Sieve of Eratosthenes
- Program for Fibonacci numbers
- Longest Palindromic Substring | Set 1
- Edit Distance | DP-5
- Longest Palindromic Subsequence | DP-12
- Overlapping Subproblems Property in Dynamic Programming | DP-1
- Cutting a Rod | DP-13
- Ugly Numbers
- Matrix Chain Multiplication | DP-8
- Floyd Warshall Algorithm | DP-16
- Egg Dropping Puzzle | DP-11
- Maximum sum such that no two elements are adjacent
- Count Possible Decodings of a given Digit Sequence
- Minimum number of jumps to reach end
- Bellman–Ford Algorithm | DP-23
- Partition problem | DP-18
- Min Cost Path | DP-6
- Optimal Substructure Property in Dynamic Programming | DP-2
- Efficient program to print all prime factors of a given number
- Count all possible paths from top left to bottom right of a mXn matrix
- Tabulation vs Memoizatation
- Longest Increasing Subsequence Size (N log N)
- Maximum Sum Increasing Subsequence | DP-14

Given a N X N matrix consisting of characters. Also given are Q queries, where each query contains a co-ordinate (X, Y). For every query,… Read More »

Given two integers N and K, the task is to find the number of ways to place K bishops on an N × N chessboard… Read More »

Given a number, N. find the sum of first N odd Fibonacci numbers. Note: The answer can be very large so print the answer modulo… Read More »

Given a string ‘S’ consisting of open and closed brackets, the task is find the number of ways in which each character of ‘S’ can… Read More »

Given integers N, P and Q where N denotes the destination position. The task is to move from position 0 to position N with minimum… Read More »

Given n cities: x1, x2, …… xn: each associated with T[i] (treasure) and C[i] (color). You can choose to visit a city or skip it.… Read More »

Recursion is a programming technique where a function calls itself repeatedly till a termination condition is met. Some of the examples where recursion is used… Read More »

A cricket player has to score N runs, with condition he can take either 1 or 2 runs only and consecutive runs should not be… Read More »

Given a positive integer N, the task is to find the value of F2 + F4 + F6 +………+ F2n upto N terms where Fi… Read More »

Given integers ‘K’ and ‘N’, the task is to find the Nth term of the K-Fibonacci series. In K – Fibonacci series, the first ‘K’… Read More »

Given a Markov chain G, we have the find the probability of reaching the state F at time t = T if we start from… Read More »

Given a number N representing the length of a bracket sequence consisting of brackets ‘(‘, ‘)’. The actual sequence is not known beforehand. Given the… Read More »

S(r, n), represents the number of ways that we can arrange r objects around indistinguishable circles of length n, and every circle n must have… Read More »

Given a positive Integer n, The task is to print Gould’s sequence up to nth term. In Mathematics, Gould’s sequence is an integer sequence whose… Read More »

Given an square array A of integers of size NxN. The task is to find the minimum sum of a falling path through A. A… Read More »