Question bank
4,310 interview questions, answered.
Reference answers, what the interviewer is really testing, how it is graded, and the follow-ups that come next.
Easy 190Medium 2,498Hard 982
FiltersDifficulty, topic, company
4,310 questions
- 865Maximum Subarray SumCoding·
Amazon - 866Maximum Sum Circular SubarrayMediumCoding·
Agoda - 867Maximum Sum Linked List from Two Sorted Linked ListsCoding·
Amazon - 868Maximum Sum of Distinct Subarrays With Length KMediumCoding·
Linkedin - 869Maximum sum of non adjacent elementsCoding·
Meta, Zeta - 870Maximum Sum of Two Non-Overlapping SubarraysMediumCoding·
JioHotstar - 871Max Sum Subarray After K ModificationsCoding·
Walmart - 872Maximum Total Damage With Spell CastingMediumCoding·
PhonePe - 873Maximum Twin Sum of a Linked ListMediumCoding·
EXL - 874Maximum Value of K Coins From PilesHardCoding·
Walmart - 875Maximum White Tiles Covered by a CarpetMediumCoding· PPPragmatic Play
- 876Maximum Width of a Binary TreeCoding·
Amazon - 877Maximum Width of Binary TreeCoding·
Walmart - 878Maximum Xor ProductMediumCoding·
Rippling - 879Medium: Clone a linked list with random pointersCoding·
Boston Consulting Group - 880Medium ProblemCoding·
ServiceNow - 881Medium: Subarray with a given XORCoding·
Boston Consulting Group - 882Merge in Between Linked ListCoding·
Microsoft - 883Merge In Between Linked ListsMediumCoding·
Oracle - 884Merge Nodes in Between ZerosMediumCoding·
FactSet Research Systems Inc. - 885Merge Sort ProblemCoding·
EPAM Systems - 886Merge Strings AlternatelyEasyCoding·
Google - 887Merge Two Sorted ArraysCoding· CCognitree
- 888Merge two sorted arrays without extra spaceCoding·
Goldman Sachs