| Medium | Range Sum Query 2D – Immutable Leetcode Solution | Amazon Bloomberg Facebook Google lyft Microsoft Nvidia Samsung | matrix |
| Hard | Find Smallest Range Containing Elements from k Lists | Amazon Apple Google Uber | dynamic-programming |
| Medium | Guess Number Higher or Lower II | Amazon Google Microsoft | dynamic-programming |
| Easy | Maximum sum of pairs with specific difference | Accolite Coursera Delhivery Fourkites Snapdeal | dynamic-programming |
| Medium | Maximum sum of a path in a Right Number Triangle | Citrix DE Shaw Directi Expedia | dynamic-programming |
| Medium | Maximum number of segments of lengths a, b and c | Amazon BlackRock ByteDance Citrix Google Teradata Uber | dynamic-programming |
| Medium | Maximum subsequence sum such that no three are consecutive | 24*7 Innovation Labs Accenture Amazon Delhivery PayPal PayU | dynamic-programming |
| Easy | Count all subsequences having product less than K | ByteDance Capital One CodeNation Databricks Expedia Yandex | dynamic-programming |
| Hard | LCS (Longest Common Subsequence) of three strings | Amazon CodeNation Expedia Google Uber Zoho | dynamic-programming |
| Medium | Longest Repeated Subsequence | Amazon Arcesium Avalara ByteDance Capital One Facebook MetLife | dynamic-programming |
| Easy | Sequences of given length where every element is more than or equal to twice of previous | Accenture Amazon CodeNation Facebook Google PayPal Qualcomm | dynamic-programming |
| Hard | Find maximum length Snake sequence | Amazon CodeNation Expedia Yandex | dynamic-programming |
| Hard | Minimum sum of multiplications of n numbers | Accenture BlackRock GE Healthcare JP Morgan PayPal | dynamic-programming |
| Easy | Count ways to reach the nth stair using step 1, 2 or 3 | Amazon CodeNation GE Healthcare Microsoft Moonfrog Labs PayPal Uber | dynamic-programming |
| Medium | Minimum Sum Path in a Triangle | Amazon Apple Bloomberg | dynamic-programming |
| Medium | Count even length binary sequences with same sum of first and second half bits | 24*7 Innovation Labs Amazon Dell GE Healthcare | dynamic-programming |
| Easy | Longest subsequence such that difference between adjacents is one | Amazon Avalara Factset Fourkites Microsoft | dynamic-programming |
| Medium | Maximum path sum in a triangle | Arcesium CodeNation GE Healthcare PayU Uber Zoho | dynamic-programming |
| Easy | Path with maximum average value | Cisco Epic Systems GreyOrange SAP Labs Times Internet | dynamic-programming |
| Easy | Maximum product of an increasing subsequence | Accolite GE Healthcare HackerRank IBM Snapchat Yahoo | dynamic-programming |
| Medium | Print Maximum Length Chain of Pairs | Amazon | dynamic-programming |
| Easy | Print n terms of Newman-Conway Sequence | Amazon Citadel Factset Fanatics JP Morgan | dynamic-programming |
| Medium | Print modified array after executing the commands of addition and subtraction | ByteDance Cisco Citrix FreeCharge HackerRank Nagarro Opera Teradata | dynamic-programming |
| Easy | Newman-Conway Sequence | Amazon Honeywell | dynamic-programming |
| Medium | Moser-de Bruijn Sequence | FreeCharge Snapdeal Times Internet | dynamic-programming |
| Hard | Range Queries for Longest Correct Bracket Subsequence | Amazon CodeNation Google PayPal Uber | dynamic-programming |
| Hard | Print modified array after multiple array range increment operations | Expedia FreeCharge Google Indeed Moonfrog Labs Ola Cabs Qualtrics | dynamic-programming |
| Medium | Number of indexes with equal elements in given range | GreyOrange Indeed Opera Pinterest Snapdeal Yahoo | dynamic-programming |
| Hard | Longest Bitonic Subsequence | CodeNation DE Shaw Google JP Morgan Microsoft | dynamic-programming |
| Easy | Golomb sequence | Cadence India Indeed Times Internet Yatra | dynamic-programming |
| Easy | Newman–Shanks–Williams prime | HackerRank | dynamic-programming |
| Hard | Difference Array | Range update query in O(1) | Arcesium CodeNation Directi Expedia Google Qualcomm | dynamic-programming |
| Hard | Painting Fence Algorithm | CodeNation Facebook Google Intuit JP Morgan Morgan Stanley | dynamic-programming |
| Medium | Binary array after M range toggle operations | Amazon Coursera Goldman Sachs Google GreyOrange Snapchat | dynamic-programming |
| Easy | Constant time range add operation on an array | CodeNation DE Shaw Directi Expedia Google | dynamic-programming |
| Medium | Count Primes in Ranges | Google Hike Kuliza Sieve Snapchat Yahoo | dynamic-programming |
| Easy | Print the Fibonacci numbers in reverse order | Accenture MAQ o9 solutions UHG Optum | dynamic-programming |
| Easy | Print Fibonacci sequence using 2 variables | Amazon Delhivery Factset Fourkites Hike MAQ o9 solutions PayU | dynamic-programming |
| Medium | Queries on XOR of greatest odd divisor of the range | 24*7 Innovation Labs Citadel Directi Expedia Google Indeed Snapdeal | dynamic-programming |
| Easy | Compute nCr % p | Accenture Cadence India Komli Media Ola Cabs Square | dynamic-programming |
| Easy | Cutting a Rod | Amazon Directi Flipkart Google JP Morgan Microsoft | dynamic-programming |
| Medium | Largest divisible pairs subset | Amazon Google | dynamic-programming |
| Hard | Queries for GCD of all numbers of an array except elements in a given range | Amazon Capital One DE Shaw Google PayPal Teradata | dynamic-programming |
| Hard | Find whether a subarray is in form of a mountain or not | Amazon BlackRock Cisco Citrix Factset Honeywell Tesla Yandex | dynamic-programming |
| Medium | Mean of range in array | Cadence India Expedia FreeCharge GreyOrange Roblox Snapchat Snapdeal Times Internet Yandex | dynamic-programming |
| Hard | Subset with sum divisible by m | Arcesium Cisco DE Shaw Directi Expedia Myntra PayU | dynamic-programming |
| Medium | Check if any two intervals overlap among a given set of intervals | Amazon Arcesium Cisco Directi JP Morgan Microsoft Qualcomm Yandex | dynamic-programming |
| Easy | Range sum queries without updates | BlackRock GE Healthcare Moonfrog Labs Synopsys Taxi4Sure Twilio | dynamic-programming |
| Medium | Subset Sum Problem in O(sum) space | Adobe Amazon Drishti-Soft | dynamic-programming |
| Easy | Friends Pairing Problem | Amazon Expedia GE Healthcare Google Honeywell JP Morgan | dynamic-programming |
| Medium | Gold Mine Problem | Amazon Flipkart Google Microsoft PayU Uber | dynamic-programming |
| Easy | Tiling Problem | 24*7 Innovation Labs Amazon DE Shaw Delhivery PayPal | dynamic-programming |
| Medium | Permutation Coefficient | BankBazaar Xome | dynamic-programming |
| Easy | Longest Increasing Consecutive Subsequence | Amazon Google Microsoft | dynamic-programming |
| Medium | Binomial Coefficient | Directi Expedia HackerRank Xome | dynamic-programming |
| Easy | Best Time to Buy and Sell Stock | Adobe Amazon Apple Bloomberg ByteDance Cisco DE Shaw eBay Expedia Facebook Goldman Sachs Google JP Morgan Microsoft Morgan Stanley Oracle PayPal Qualtrics Samsung VMware | dynamic-programming |
| Medium | Number Of Longest Increasing Subsequence | Amazon Samsung Zoho | dynamic-programming |
| Medium | Palindrome Partitioning | Amazon Facebook Google Microsoft | dynamic-programming |
| Hard | Program for Bridge and Torch problem | Accolite eBay Snapdeal Teradata Times Internet | dynamic-programming |
| Hard | Boolean Parenthesization Problem | Amazon LinkedIn Microsoft | dynamic-programming |
| Hard | K maximum sums of overlapping contiguous sub-arrays | CodeNation Dell Facebook GE Healthcare Google Qualcomm | dynamic-programming |
| Medium | How to print maximum number of A’s using given four keys | Amazon Facebook Google PayPal Paytm | dynamic-programming |
| Medium | Collect maximum points in a grid using two traversals | Amazon Fab Goldman Sachs Google Honeywell LinkedIn Pinterest Yahoo | dynamic-programming |
| Medium | Maximum weight transformation of a given string | Amazon BlackRock ByteDance CodeNation DE Shaw Expedia JP Morgan Ola Cabs | dynamic-programming |
| Hard | Word Wrap Problem | Arcesium Factset GreyOrange Microsoft Myntra Ola Cabs PayU | dynamic-programming |
| Hard | The Painter’s Partition Problem | CodeNation Google | dynamic-programming |
| Maximum Subarray Sum Excluding Certain Elements | Accolite CodeNation Directi JP Morgan Qualcomm | dynamic-programming |
| Hard | Mobile Numeric Keypad Problem | Amazon MAQ Microsoft Sprinklr | dynamic-programming |
| Medium | Maximum sum bitonic subarray | Cisco DE Shaw Dell Fourkites Goldman Sachs Grofers IBM PayU Yahoo | dynamic-programming |
| Hard | Largest area rectangular sub-matrix with equal number of 1’s and 0’s | Accenture Indeed Info Edge Monotype Solutions PayPal Pinterest Synopsys Times Internet UHG Optum | dynamic-programming |
| Medium | A Space Optimized DP solution for 0-1 Knapsack Problem | Amazon BlackRock ByteDance CodeNation JP Morgan Netskope Ola Cabs Qualcomm | dynamic-programming |
| Hard | Printing brackets in Matrix Chain Multiplication Problem | Amazon Avalara Citadel Databricks Directi JP Morgan Paytm Twilio | dynamic-programming |
| Easy | Size of The Subarray With Maximum Sum | Coursera GreyOrange UHG Optum Xome | dynamic-programming |
| Easy | Minimum number of jumps to reach end | Adobe Amazon Housing.com Moonfrog Labs Morgan Stanley OYO Rooms SAP Labs Walmart Labs | dynamic-programming |
| Hard | Number of palindromic paths in a matrix | Apple CodeNation Facebook Fanatics Google | dynamic-programming |
| Hard | Largest rectangular sub-matrix whose sum is 0 | Amazon CodeNation Directi Expedia Facebook Google IBM Microsoft PayPal Uber | dynamic-programming |
| Medium | Maximum sum rectangle in a 2D matrix | Accolite Amazon Factset Samsung | dynamic-programming |
| Easy | Maximum Sum Increasing Subsequence | Amazon Fanatics Microsoft Morgan Stanley | dynamic-programming |
| Easy | Largest Sum Contiguous Subarray | 24*7 Innovation Labs Accolite Amazon DE Shaw Factset Flipkart Hike Housing.com MakeMyTrip MetLife Microsoft Morgan Stanley Ola Cabs Oracle OYO Rooms PayU Samsung Snapdeal Teradata Visa VMware Walmart Labs Zoho | dynamic-programming |
| Medium | Matrix Chain Multiplication | Amazon CodeNation DE Shaw Google Microsoft Uber | dynamic-programming |
| Medium | Super Ugly Number | Google | dynamic-programming |
| Medium | Divisible Pairs Counting | Mahindra Comviva Oracle | dynamic-programming |
| Medium | The Knapsack Problem | MakeMyTrip Snapdeal Visa Zoho | dynamic-programming |
| Medium | Decode Ways | Adobe Amazon Cisco Databricks Facebook Goldman Sachs Google JP Morgan Microsoft Morgan Stanley Oracle Square | dynamic-programming |
| Medium | Longest Palindromic Subsequence | Amazon Facebook Microsoft | dynamic-programming |
| Medium | Target Sum | Amazon Bloomberg Facebook | dynamic-programming |
| Medium | Longest Common Subsequence | Amazon eBay Facebook Morgan Stanley | dynamic-programming |
| Medium | House Robber | Amazon Apple Cisco Expedia Google Microsoft Oracle | dynamic-programming |
| Medium | Palindrome Partitioning | Amazon Facebook Google | dynamic-programming |
| Medium | New 21 Game | Apple Google | dynamic-programming |
| Hard | Distinct Subsequences | Amazon Bloomberg Mathworks | dynamic-programming |
| Easy | Climbing stairs | Adobe Amazon Apple Bloomberg Expedia Goldman Sachs | dynamic-programming |
| Easy | Subset sum problem | Adobe Amazon Ameyo | dynamic-programming |
| Easy | Ugly Numbers | Delhivery Goldman Sachs Paytm | dynamic-programming |
| Easy | Dynamic Programming Basics | Infosys MAQ | dynamic-programming |
| Medium | Coin Change Problem | Amazon Apple BlackRock Bloomberg ByteDance Capital One Facebook Goldman Sachs Google Oracle Walmart Labs | dynamic-programming |