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
359 questions at Uber · all time
- Get Biggest Three Rhombus Sums in a GridmediumArrayMathSortingHeap (Priority Queue)+2frequency 20.3
- Goat LatineasyStringfrequency 20.3
- Graph Valid TreemediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 20.3
- Human Traffic of StadiumhardDatabasefrequency 20.3
- Insert Delete GetRandom O(1) - Duplicates allowedhardArrayHash TableMathDesign+1frequency 20.3
- Integer ReplacementmediumDynamic ProgrammingGreedyBit ManipulationMemoizationfrequency 20.3
- Interval List IntersectionsmediumArrayTwo PointersSweep Linefrequency 20.3
- Kth Largest Element in an ArraymediumArrayDivide and ConquerSortingHeap (Priority Queue)+1frequency 20.3
- Last Stone WeighteasyArrayHeap (Priority Queue)frequency 20.3
- Linked List ComponentsmediumArrayHash TableLinked Listfrequency 20.3
- Longest Subsequence With Limited SumeasyArrayBinary SearchGreedySorting+1frequency 20.3
- Longest Substring Without Repeating CharactersmediumHash TableStringSliding Windowfrequency 20.3
- Magnetic Force Between Two BallsmediumArrayBinary SearchSortingfrequency 20.3
- Make Lexicographically Smallest Array by Swapping ElementsmediumArrayUnion-FindSortingfrequency 20.3
- Matchsticks to SquaremediumArrayDynamic ProgrammingBacktrackingBit Manipulation+1frequency 20.3
- Maximize Sum Of Array After K NegationseasyArrayGreedySortingfrequency 20.3
- Maximum Average Subarray IeasyArraySliding Windowfrequency 20.3
- Maximum Manhattan Distance After K ChangesmediumHash TableMathStringCountingfrequency 20.3
- Meeting RoomseasyArraySortingQuicksortfrequency 20.3
- Minimize Malware SpreadhardArrayHash TableDepth-First SearchBreadth-First Search+2frequency 20.3
- Minimize Malware Spread IIhardArrayHash TableDepth-First SearchBreadth-First Search+2frequency 20.3
- Minimize the Maximum Edge Weight of GraphmediumBinary SearchDepth-First SearchBreadth-First SearchGraph Theory+1frequency 20.3
- Minimum Absolute Difference Between Elements With ConstraintmediumArrayBinary SearchOrdered Setfrequency 20.3
- Minimum Difference in Sums After Removal of ElementshardArrayDynamic ProgrammingHeap (Priority Queue)frequency 20.3
- Minimum Fuel Cost to Report to the CapitalmediumTreeDepth-First SearchBreadth-First SearchGraph Theoryfrequency 20.3
- Next Greater Element IeasyArrayHash TableStackMonotonic Stackfrequency 20.3
- Non-overlapping IntervalsmediumArrayDynamic ProgrammingGreedySortingfrequency 20.3
- Number of Distinct Substrings in a StringmediumStringTrieRolling HashSuffix Array+1frequency 20.3
- Number of EnclavesmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 20.3
- Number of Subarrays with Bounded MaximummediumArrayTwo Pointersfrequency 20.3
- Number of Wonderful SubstringsmediumHash TableStringBit ManipulationPrefix Sumfrequency 20.3
- Ones and ZeroesmediumArrayStringDynamic ProgrammingKnapsack Problem+1frequency 20.3
- Painting a Grid With Three Different ColorshardDynamic ProgrammingGraph Coloringfrequency 20.3
- Patching ArrayhardArrayGreedyfrequency 20.3
- Populating Next Right Pointers in Each Node IImediumLinked ListTreeDepth-First SearchBreadth-First Search+1frequency 20.3
- Predict the WinnermediumArrayMathDynamic ProgrammingRecursion+3frequency 20.3
- Prime PalindromemediumMathNumber TheoryPrimality Testfrequency 20.3
- Process Restricted Friend RequestshardUnion-FindGraph Theoryfrequency 20.3
- Promise Poolmediumfrequency 20.3
- Rearranging FruitshardArrayHash TableGreedySortfrequency 20.3
- Remove Duplicates from Sorted ArrayeasyArrayTwo Pointersfrequency 20.3
- Repeated String MatchmediumStringString MatchingZ AlgorithmKnuth–Morris–Pratt Algorithm+1frequency 20.3
- Reverse IntegermediumMathfrequency 20.3
- Reverse Nodes in k-GrouphardLinked ListRecursionfrequency 20.3
- Reverse Vowels of a StringeasyTwo PointersStringfrequency 20.3
- Russian Doll EnvelopeshardArrayBinary SearchDynamic ProgrammingSorting+1frequency 20.3
- Search Suggestions SystemmediumArrayStringBinary SearchTrie+2frequency 20.3
- Search a 2D MatrixmediumArrayBinary SearchMatrixfrequency 20.3
- Search a 2D Matrix IImediumArrayBinary SearchDivide and ConquerMatrixfrequency 20.3
- Shortest Distance from All BuildingshardArrayBreadth-First SearchMatrixfrequency 20.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.