Problems
Callback's own problems and the LeetCode questions companies have been asking, in one place — filter by category, company, topic, difficulty, and how recently a question showed up.
Asked on LeetCode
2,011 questions at Amazon · all time
- Lexicographically Smallest String After Substring OperationmediumStringGreedyfrequency 5.0
- Linked List in Binary TreemediumLinked ListTreeDepth-First SearchBinary Treefrequency 5.0
- Long Pressed NameeasyTwo PointersStringfrequency 5.0
- Longest Common Prefix Between Adjacent Strings After RemovalsmediumArrayStringfrequency 5.0
- Longest Increasing Subsequence IIhardArrayDivide and ConquerDynamic ProgrammingBinary Indexed Tree+3frequency 5.0
- Longest Mountain in ArraymediumArrayTwo PointersDynamic ProgrammingEnumerationfrequency 5.0
- Longest Nice SubstringeasyHash TableStringDivide and ConquerBit Manipulation+1frequency 5.0
- Longest Palindrome by Concatenating Two Letter WordsmediumArrayHash TableStringGreedy+1frequency 5.0
- Longest Strictly Increasing or Strictly Decreasing SubarrayeasyArrayfrequency 5.0
- Longest Subsequence Repeated k TimeshardHash TableTwo PointersStringBacktracking+2frequency 5.0
- Longest Subsequence With Limited SumeasyArrayBinary SearchGreedySorting+1frequency 5.0
- Longest Substring of One Repeating CharacterhardArrayStringSegment TreeOrdered Setfrequency 5.0
- Longest Substring with At Most Two Distinct CharactersmediumHash TableStringSliding Windowfrequency 5.0
- Longest Univalue PathmediumTreeDepth-First SearchBinary TreeDP on Treesfrequency 5.0
- Longest Word in DictionarymediumArrayHash TableStringTrie+1frequency 5.0
- Longest ZigZag Path in a Binary TreemediumDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 5.0
- Lowest Common Ancestor of Deepest LeavesmediumHash TableTreeDepth-First SearchBreadth-First Search+4frequency 5.0
- Lucky Numbers in a MatrixeasyArrayMatrixfrequency 5.0
- Magical StringmediumTwo PointersStringfrequency 5.0
- Make K-Subarray Sums EqualmediumArrayMathGreedySorting+1frequency 5.0
- Make The String GreateasyStringStackfrequency 5.0
- Manhattan Distances of All Arrangements of PieceshardMathCombinatoricsfrequency 5.0
- Market Analysis IIhardDatabasefrequency 5.0
- Matrix Similarity After Cyclic ShiftseasyArrayMathMatrixSimulationfrequency 5.0
- Max Sum of Rectangle No Larger Than KhardArrayBinary SearchMatrixPrefix Sum+1frequency 5.0
- Maximize Active Section with Trade IIhardArrayStringBinary SearchSegment Treefrequency 5.0
- Maximize Cyclic Partition ScorehardArrayDynamic Programmingfrequency 5.0
- Maximize Greatness of an ArraymediumArrayTwo PointersGreedySortingfrequency 5.0
- Maximize Sum Of Array After K NegationseasyArrayGreedySortingfrequency 5.0
- Maximize Sum of Device Ratingsmediumfrequency 5.0
- Maximize the Confusion of an ExammediumStringBinary SearchSliding WindowPrefix Sumfrequency 5.0
- Maximum Area of Longest Diagonal RectangleeasyArrayfrequency 5.0
- Maximum Beauty of an Array After Applying OperationmediumArrayBinary SearchSliding WindowSortingfrequency 5.0
- Maximum Compatibility Score SummediumArrayDynamic ProgrammingBacktrackingBit Manipulation+8frequency 5.0
- Maximum Difference by Remapping a DigiteasyMathGreedyfrequency 5.0
- Maximum Number of Coins You Can GetmediumArrayMathGreedySorting+1frequency 5.0
- Maximum Number of Fish in a GridmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 5.0
- Maximum Number of K-Divisible ComponentshardTreeDepth-First Searchfrequency 5.0
- Maximum Number of Points From Grid QuerieshardArrayTwo PointersBreadth-First SearchUnion-Find+3frequency 5.0
- Maximum Number of Visible PointshardArrayMathGeometrySliding Window+1frequency 5.0
- Maximum Number of Weeks for Which You Can WorkmediumArrayGreedyfrequency 5.0
- Maximum Possible Number by Binary ConcatenationmediumArrayBit ManipulationEnumerationfrequency 5.0
- Maximum Product of First and Last Elements of a SubsequencemediumArrayTwo Pointersfrequency 5.0
- Maximum Profit From Trading StocksmediumArrayDynamic Programmingfrequency 5.0
- Maximum Repeating SubstringeasyStringDynamic ProgrammingString Matchingfrequency 5.0
- Maximum Score From Removing SubstringsmediumStringStackGreedyfrequency 5.0
- Maximum Score of Non-overlapping IntervalshardArrayBinary SearchDynamic ProgrammingSortingfrequency 5.0
- Maximum Size of a Set After RemovalsmediumArrayHash TableGreedyfrequency 5.0
- Maximum Strength of K Disjoint SubarrayshardArrayDynamic ProgrammingPrefix Sumfrequency 5.0
- Maximum Substrings With Distinct StartmediumHash TableStringfrequency 5.0
Listings only — titles, difficulty, and tags link out to LeetCode. Imported from the leetcode-company-wise-problems snapshot dated 1 June 2025. Frequency is that dataset's own relative score within a company and time range.