Instant Search Interview Questions

Search Tip If you want to search Easy questions of Amazon on Array topic then type "amazon easy array" and get the results

DifficultyQuestion TitleCompany NameCategory
Find Smallest Range Containing Elements from k Listsdynamic-programming
Guess Number Higher or Lower IIdynamic-programming
Maximum sum of pairs with specific differencedynamic-programming
Maximum sum of a path in a Right Number Triangledynamic-programming
Maximum number of segments of lengths a, b and cdynamic-programming
Maximum subsequence sum such that no three are consecutivedynamic-programming
Count all subsequences having product less than Kdynamic-programming
LCS (Longest Common Subsequence) of three stringsdynamic-programming
Longest Repeated Subsequencedynamic-programming
Sequences of given length where every element is more than or equal to twice of previousdynamic-programming
Find maximum length Snake sequencedynamic-programming
Minimum sum of multiplications of n numbersdynamic-programming
Count ways to reach the nth stair using step 1, 2 or 3dynamic-programming
Minimum Sum Path in a Triangledynamic-programming
Count even length binary sequences with same sum of first and second half bitsdynamic-programming
Longest subsequence such that difference between adjacents is onedynamic-programming
Maximum path sum in a triangledynamic-programming
Path with maximum average valuedynamic-programming
Maximum product of an increasing subsequencedynamic-programming
Print Maximum Length Chain of Pairsdynamic-programming
Print n terms of Newman-Conway Sequencedynamic-programming
Print modified array after executing the commands of addition and subtractiondynamic-programming
Newman-Conway Sequencedynamic-programming
Moser-de Bruijn Sequencedynamic-programming
Range Queries for Longest Correct Bracket Subsequencedynamic-programming
Print modified array after multiple array range increment operationsdynamic-programming
Number of indexes with equal elements in given rangedynamic-programming
Longest Bitonic Subsequencedynamic-programming
Golomb sequencedynamic-programming
Newman–Shanks–Williams primedynamic-programming
Difference Array | Range update query in O(1)dynamic-programming
Painting Fence Algorithmdynamic-programming
Binary array after M range toggle operationsdynamic-programming
Constant time range add operation on an arraydynamic-programming
Count Primes in Rangesdynamic-programming
Print the Fibonacci numbers in reverse orderdynamic-programming
Print Fibonacci sequence using 2 variablesdynamic-programming
Queries on XOR of greatest odd divisor of the rangedynamic-programming
Compute nCr % pdynamic-programming
Cutting a Roddynamic-programming
Largest divisible pairs subsetdynamic-programming
Queries for GCD of all numbers of an array except elements in a given rangedynamic-programming
Find whether a subarray is in form of a mountain or notdynamic-programming
Mean of range in arraydynamic-programming
Subset with sum divisible by mdynamic-programming
Check if any two intervals overlap among a given set of intervalsdynamic-programming
Range sum queries without updatesdynamic-programming
Subset Sum Problem in O(sum) spacedynamic-programming
Friends Pairing Problemdynamic-programming
Gold Mine Problemdynamic-programming
Tiling Problemdynamic-programming
Permutation Coefficientdynamic-programming
Longest Increasing Consecutive Subsequencedynamic-programming
Binomial Coefficientdynamic-programming
Best Time to Buy and Sell Stockdynamic-programming
MediumNumber Of Longest Increasing SubsequenceAmazonSamsungZohodynamic-programming
Palindrome Partitioningdynamic-programming
Boolean Parenthesization Problemdynamic-programming
K maximum sums of overlapping contiguous sub-arraysdynamic-programming
How to print maximum number of A’s using given four keysdynamic-programming
Collect maximum points in a grid using two traversalsdynamic-programming
Maximum weight transformation of a given stringdynamic-programming
Word Wrap Problemdynamic-programming
The Painter’s Partition Problemdynamic-programming
Maximum Subarray Sum Excluding Certain Elementsdynamic-programming
Mobile Numeric Keypad Problemdynamic-programming
Maximum sum bitonic subarraydynamic-programming
Largest area rectangular sub-matrix with equal number of 1’s and 0’sdynamic-programming
A Space Optimized DP solution for 0-1 Knapsack Problemdynamic-programming
Printing brackets in Matrix Chain Multiplication Problemdynamic-programming
Size of The Subarray With Maximum Sumdynamic-programming
Minimum number of jumps to reach enddynamic-programming
Number of palindromic paths in a matrixdynamic-programming
Largest rectangular sub-matrix whose sum is 0dynamic-programming
Maximum sum rectangle in a 2D matrixdynamic-programming
Maximum Sum Increasing Subsequencedynamic-programming
Largest Sum Contiguous Subarraydynamic-programming
Matrix Chain Multiplicationdynamic-programming
Super Ugly Numberdynamic-programming
Divisible Pairs Countingdynamic-programming
The Knapsack Problemdynamic-programming
Decode Waysdynamic-programming
Longest Palindromic Subsequencedynamic-programming
Target Sumdynamic-programming
Longest Common Subsequencedynamic-programming
House Robberdynamic-programming
Palindrome Partitioningdynamic-programming
New 21 Gamedynamic-programming
Distinct Subsequencesdynamic-programming
Climbing stairsdynamic-programming
Subset sum problemdynamic-programming
Ugly Numbersdynamic-programming
Dynamic Programming Basicsdynamic-programming
Coin Change Problemdynamic-programming

AD Blocker Detected !

Advertisements help running this website for free.

To view the content please disable AdBlocker and refresh the page.

Wait !!! You can Crack Technical Interviews of Companies like Amazon, Google, LinkedIn, Facebook, PayPal, Flipkart, etc

Abhishek

Abhishek was able to crack Microsoft after practicing questions from TutorialCup