Medium | Find whether a subarray is in form of a mountain or not | Problem Statement The problem “Find whether a subarray is in form of a mountain or not” read more |

Easy | Mean of range in array | Problem Statement The problem “Mean of range in array” states that you are given an read more |

Easy | Subset with sum divisible by m | Problem Statement The problem “Subset with sum divisible by m” states that you are read more |

Easy | Check if any two intervals overlap among a given set of intervals | Problem Statement The problem “Check if any two intervals overlap among a given set of read more |

Easy | Range sum queries without updates | Problem Statement The problem “Range sum queries without updates” states that you have read more |

Easy | Subset Sum Problem in O(sum) space | Problem Statement The “Subset sum in O(sum) space” problem states that you are given an read more |

Easy | Friends Pairing Problem | Problem Statement The “Friends Pairing Problem” states that there are N friends. And read more |

Easy | Gold Mine Problem | Problem Statement The “Gold Mine problem” states that you are given a 2D grid having read more |

Easy | Tiling Problem | Problem Statement The “Tiling Problem” states that you have a grid of size 2 x N and a read more |

Easy | Permutation Coefficient | Problem Statement In this problem “Permutation Coefficient”, we need to find it when we read more |

Easy | Longest Increasing Consecutive Subsequence | Subsequences are another topic loved by interviewers. Tweaking them around can always give them new read more |

Easy | Binomial Coefficient | Problem Statement Find the Binomial Coefficient for a given value of n and k. “In read more |

Easy | Best Time to Buy and Sell Stock | Problem Statement The problem “Best Time to Buy and Sell Stock” states that you are read more |

Easy | Number Of Longest Increasing Subsequence | Problem Statement The problem “Number Of Longest Increasing Subsequence” states that read more |

Medium | Palindrome Partitioning | Problem Statement Given a string, find the minimum number of cuts required such that all the read more |

Medium | Program for Bridge and Torch problem | Problem Statement The “Bridge and Torch” problem states that you are given an array of time a read more |

Medium | Boolean Parenthesization Problem | Problem Statement “ Boolean Parenthesization Problem ” states that we are given a sequence of read more |

Hard | K maximum sums of overlapping contiguous sub-arrays | Problem Statement The problem “K maximum sums of overlapping contiguous sub-arrays” read more |

Easy | How to print maximum number of A’s using given four keys | Problem Statement How to print maximum number of A’s using given four keys, this problem read more |

Medium | Collect maximum points in a grid using two traversals | Problem Statement We are given a matrix of size “n x m”, and we need to collect maximum points read more |

Easy | Maximum weight transformation of a given string | Problem Statement The maximum weight transformation of a given string problem states that given a read more |

Medium | Word Wrap Problem | Problem Statement The word wrap problem states that given a sequence of words as input, we need to read more |

Medium | The Painter’s Partition Problem | Problem Statement The Painter’s Partition problem states that we have some fences and we have read more |

Easy | Maximum Subarray Sum Excluding Certain Elements | Problem Statement We are given an array, and we need to find maximum subarray sum excluding certain read more |

Medium | Mobile Numeric Keypad Problem | Problem Statement In the mobile numeric keypad problem, we consider a numeric keypad. We need to read more |

Easy | Maximum sum bitonic subarray | Problem Statement An array having n integers is given to us. We need to find the maximum sum read more |

Medium | Largest area rectangular sub-matrix with equal number of 1’s and 0’s | Problem Statement Given a binary matrix of size n x m. The problem is to find the largest area read more |

Easy | A Space Optimized DP solution for 0-1 Knapsack Problem | Problem Statement We are given a knapsack which can hold some weight, we need to pick some of the read more |

Medium | Printing brackets in Matrix Chain Multiplication Problem | Problem Statement We need to find the order of multiplication of matrices such that the number of read more |

Easy | Size of The Subarray With Maximum Sum | Problem Statement You are given an array of integers. The given array can contain both positive and read more |

Medium | Minimum number of jumps to reach end | Problem Statement Suppose you have an array of integers and each element of an array indicates each read more |

Medium | Number of palindromic paths in a matrix | Problem Statement We are given a two-dimensional matrix containing lowercase English alphabets, we read more |

Medium | Largest rectangular sub-matrix whose sum is 0 | Problem Statement Find the maximum size sub-matrix in a 2D array whose sum is zero. A sub-matrix is read more |

Medium | Maximum sum rectangle in a 2D matrix | Problem Statement Find the maximum sum rectangle in a 2D matrix i.e. to find a sub-matrix with read more |

Easy | Maximum Sum Increasing Subsequence | Problem Statement You are given an array of integers. Your task is to find out the maximum sum read more |

Easy | Largest Sum Contiguous Subarray | Problem Statement You are given an array of integers. The problem statement asks to find out the read more |

Medium | Matrix Chain Multiplication | In the matrix chain multiplication II problem, we have given the dimensions of matrices, find the read more |

Super Ugly Number | Write a program to find the nth super ugly number. Super ugly numbers are positive numbers whose read more | |

Divisible Pairs Counting | Divisible Pairs is one of the interviewer’s favorite problem. This problem is good enough for read more | |

The Knapsack Problem | Before going to “The Knapsack Problem” first look at a real-life problem. Sakshi wants read more | |

Decode Ways | In Decode Ways problem we have given a non-empty string containing only digits, determine the read more | |

Longest Palindromic Subsequence | In the longest palindromic subsequence problem we have given a string, find the length of the read more | |

Target Sum | “Target Sum” is a special problem for all the DPHolics I have with me today. There read more | |

Longest Common Subsequence | You are given two strings str1 and str2, find out the length of the longest common subsequence. read more | |

House Robber | The House Robber Problem states that, in a neighborhood in a city, there is a single row of n read more | |

Pascal Triangle Leetcode | The Pascal Triangle is a very good Leetcode problem that is asked so many times in Amazon, read more | |

Stone Game II Leetcode | What is Stone Game II Problem? Stone Game II LeetCode is a very famous problem on leetcode which is read more | |

Palindrome Partitioning | Palindrome Partitioning is a DP problem. In this problem, Given a string S. Partition S such that read more | |

New 21 Game | New 21 Game is a problem that is based on the card game “21”. The problem statement of read more | |

Distinct Subsequences | Given two strings S and P1, we have to count all the number of distinct subsequences of S which read more | |

Easy | Climbing stairs | Problem Statement The problem “Climbing stairs” states that you are given a staircase read more |

Subset sum problem | In the subset sum problem, we are given a list of all positive numbers and a Sum. We need to check read more | |

Ugly Numbers | The positive numbers whose only prime factors are 2, 3, or 5 are known as ugly numbers. For eg- 8 read more | |

Dynamic Programming Basics | In Dynamic Programming basics, we will cover the basics of DP and its differences from the Greedy read more | |

Coin Change Problem | Coin Change Problem – Given some coins of different values c1, c2, … , cs (For read more |