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
- Largest Magic SquaremediumArrayMatrixPrefix Sumfrequency 10.3
- Largest Palindromic NumbermediumHash TableStringGreedyCountingfrequency 10.3
- Largest Perimeter TriangleeasyArrayMathGreedySorting+2frequency 10.3
- Largest Positive Integer That Exists With Its NegativeeasyArrayHash TableTwo PointersSortingfrequency 10.3
- Largest Sum of AveragesmediumArrayDynamic ProgrammingPrefix Sumfrequency 10.3
- Largest Triangle AreaeasyArrayMathGeometryPolygonsfrequency 10.3
- Last Day Where You Can Still CrosshardArrayBinary SearchDepth-First SearchBreadth-First Search+2frequency 10.3
- Last Substring in Lexicographical OrderhardTwo PointersStringLyndon Factorizationfrequency 10.3
- Leaf-Similar TreeseasyTreeDepth-First SearchBinary Treefrequency 10.3
- Length of the Longest Subsequence That Sums to TargetmediumArrayDynamic ProgrammingKnapsack Problem0-1 Knapsackfrequency 10.3
- Lexicographically Smallest Beautiful StringhardStringGreedyfrequency 10.3
- Linked List ComponentsmediumArrayHash TableLinked Listfrequency 10.3
- Longest Arithmetic SubsequencemediumArrayHash TableBinary SearchDynamic Programmingfrequency 10.3
- Longest String ChainmediumArrayHash TableTwo PointersString+2frequency 10.3
- Longest Subarray With Maximum Bitwise ANDmediumArrayBit ManipulationBrainteaserfrequency 10.3
- Make Array Elements Equal to ZeroeasyArraySimulationPrefix Sumfrequency 10.3
- Max Chunks To Make Sorted IIhardArrayStackGreedySorting+1frequency 10.3
- Maximize the Minimum Powered CityhardArrayBinary SearchGreedyQueue+2frequency 10.3
- Maximum 69 NumbereasyMathGreedyfrequency 10.3
- Maximum Frequency of an Element After Performing Operations ImediumArrayBinary SearchSliding WindowSorting+1frequency 10.3
- Maximum Length of Repeated SubarraymediumArrayBinary SearchDynamic ProgrammingSliding Window+2frequency 10.3
- Maximum Non Negative Product in a MatrixmediumArrayDynamic ProgrammingMatrixfrequency 10.3
- Maximum Number of Distinct Elements After OperationsmediumArrayGreedySortingfrequency 10.3
- Maximum Number of Jumps to Reach the Last IndexmediumArrayDynamic Programmingfrequency 10.3
- Maximum Product of Two DigitseasyMathSortingfrequency 10.3
- Maximum Score From Grid OperationshardArrayDynamic ProgrammingMatrixPrefix Sumfrequency 10.3
- Maximum Total Subarray Value ImediumArrayGreedyfrequency 10.3
- Maximum Unique Subarray Sum After DeletioneasyArrayHash TableGreedyfrequency 10.3
- Minimize Maximum Pair Sum in ArraymediumArrayTwo PointersGreedySortingfrequency 10.3
- Minimum Absolute Distance Between Mirror PairsmediumArrayHash TableMathfrequency 10.3
- Minimum Cost to Convert String ImediumArrayStringGraph TheoryShortest Pathfrequency 10.3
- Minimum Cost to Make Array EqualhardArrayBinary SearchGreedySorting+1frequency 10.3
- Minimum Cuts to Divide a CircleeasyMathGeometryfrequency 10.3
- Minimum Deletions to Make Character Frequencies UniquemediumHash TableStringGreedySortingfrequency 10.3
- Minimum Number of Operations to Make Array XOR Equal to KmediumArrayBit Manipulationfrequency 10.3
- Minimum Number of People to TeachmediumArrayHash TableGreedyfrequency 10.3
- Minimum Operations to Convert All Elements to ZeromediumArrayHash TableStackGreedy+1frequency 10.3
- Minimum Operations to Equalize Binary StringhardMathStringBreadth-First SearchUnion-Find+1frequency 10.3
- Minimum Operations to Make All Array Elements EqualmediumArrayBinary SearchSortingPrefix Sumfrequency 10.3
- Minimum Operations to Make Array Sum Divisible by KeasyArrayMathfrequency 10.3
- Minimum Operations to Reduce an Integer to 0mediumDynamic ProgrammingGreedyBit Manipulationfrequency 10.3
- Minimum Score Triangulation of PolygonmediumArrayDynamic ProgrammingTriangulationPolygonsfrequency 10.3
- Minimum String Length After Removing SubstringseasyStringStackSimulationfrequency 10.3
- Minimum Subsequence in Non-Increasing OrdereasyArrayGreedySortingfrequency 10.3
- Minimum Swaps to Arrange a Binary GridmediumArrayGreedyMatrixfrequency 10.3
- Mirror ReflectionmediumMathGeometryNumber TheoryLeast Common Multiple+1frequency 10.3
- Most Profitable Path in a TreemediumArrayTreeDepth-First SearchBreadth-First Search+1frequency 10.3
- N-ary Tree Level Order TraversalmediumTreeBreadth-First Searchfrequency 10.3
- N-ary Tree Postorder TraversaleasyStackTreeDepth-First Searchfrequency 10.3
- Neighboring Bitwise XORmediumArrayBit Manipulationfrequency 10.3
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.