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
- Parallel CoursesmediumGraph TheoryTopological SortDirected Acyclic Graphfrequency 47.5
- Random Pick with BlacklisthardArrayHash TableMathBinary Search+2frequency 47.5
- Remove Max Number of Edges to Keep Graph Fully TraversablehardUnion-FindGraph Theoryfrequency 47.5
- Remove Zero Sum Consecutive Nodes from Linked ListmediumHash TableLinked Listfrequency 47.5
- Reverse Linked ListeasyLinked ListRecursionfrequency 47.5
- Reverse Words in a String IImediumTwo PointersStringfrequency 47.5
- Swap Nodes in PairsmediumLinked ListRecursionfrequency 47.5
- Valid PalindromeeasyTwo PointersStringfrequency 47.5
- Word Break IIhardArrayHash TableStringDynamic Programming+3frequency 47.5
- Word LadderhardHash TableStringBreadth-First SearchBidirectional Searchfrequency 47.5
- Word PatterneasyHash TableStringfrequency 47.5
- Word Pattern IImediumHash TableStringBacktrackingfrequency 47.5
- Boundary of Binary TreemediumTreeDepth-First SearchBinary Treefrequency 44.8
- Longest Path With Different Adjacent CharactershardArrayStringTreeDepth-First Search+2frequency 44.8
- Merge IntervalsmediumArraySortingQuicksortfrequency 44.8
- Minimum Cost to Make at Least One Valid Path in a GridhardArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+4frequency 44.8
- Rotate ImagemediumArrayMathMatrixfrequency 44.8
- Sliding Window MaximumhardArrayQueueSliding WindowHeap (Priority Queue)+2frequency 44.8
- Subarray Sums Divisible by KmediumArrayHash TablePrefix Sumfrequency 44.8
- Basic Calculator IImediumMathStringStackfrequency 41.6
- Burst BalloonshardArrayDynamic Programmingfrequency 41.6
- CandyhardArrayGreedyfrequency 41.6
- Collect Coins in a TreehardArrayTreeGraph TheoryTopological Sortfrequency 41.6
- Design Memory AllocatormediumArrayHash TableDesignSimulationfrequency 41.6
- Dungeon GamehardArrayDynamic ProgrammingMatrixfrequency 41.6
- Find the Safest Path in a GridmediumArrayBinary SearchBreadth-First SearchUnion-Find+2frequency 41.6
- Longest Consecutive SequencemediumArrayHash TableUnion-Findfrequency 41.6
- Minimum Cost For TicketsmediumArrayDynamic Programmingfrequency 41.6
- Number of Matching SubsequencesmediumArrayHash TableStringBinary Search+3frequency 41.6
- Number of ProvincesmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 41.6
- Trapping Rain WaterhardArrayTwo PointersDynamic ProgrammingStack+1frequency 41.6
- 24 GamehardArrayMathBacktrackingfrequency 37.9
- Binary Tree Maximum Path SumhardDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 37.9
- Brightest Position on StreetmediumArraySortingPrefix SumOrdered Setfrequency 37.9
- Find All Possible Recipes from Given SuppliesmediumArrayHash TableStringGraph Theory+2frequency 37.9
- Find First and Last Position of Element in Sorted ArraymediumArrayBinary Searchfrequency 37.9
- House RobbermediumArrayDynamic Programmingfrequency 37.9
- Insert IntervalmediumArrayfrequency 37.9
- LFU CachehardHash TableLinked ListDesignDoubly-Linked Listfrequency 37.9
- Longest Palindromic SubstringmediumTwo PointersStringDynamic ProgrammingManacherfrequency 37.9
- Maximum Number of Points From Grid QuerieshardArrayTwo PointersBreadth-First SearchUnion-Find+3frequency 37.9
- Maximum Points You Can Obtain from CardsmediumArraySliding WindowPrefix Sumfrequency 37.9
- Min Cost to Connect All PointsmediumArrayUnion-FindGraph TheoryMinimum Spanning Tree+3frequency 37.9
- Minimum Number of Refueling StopshardArrayDynamic ProgrammingGreedyHeap (Priority Queue)frequency 37.9
- Most Profitable Path in a TreemediumArrayTreeDepth-First SearchBreadth-First Search+1frequency 37.9
- Number of Adjacent Elements With the Same ColormediumArrayfrequency 37.9
- Reconstruct ItineraryhardArrayStringDepth-First SearchGraph Theory+5frequency 37.9
- Task SchedulermediumArrayHash TableGreedySorting+2frequency 37.9
- The Skyline ProblemhardArrayDivide and ConquerBinary Indexed TreeSegment Tree+4frequency 37.9
- Verifying an Alien DictionaryeasyArrayHash TableStringfrequency 37.9
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.