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
193 questions at Salesforce · all time
- Number of Self-Divisible PermutationsmediumArrayMathDynamic ProgrammingBacktracking+3frequency 55.1
- All Nodes Distance K in Binary TreemediumHash TableTreeDepth-First SearchBreadth-First Search+1frequency 52.4
- Asteroid CollisionmediumArrayStackSimulationfrequency 52.4
- Count Subarrays With Median KhardArrayHash TablePrefix Sumfrequency 52.4
- K-diff Pairs in an ArraymediumArrayHash TableTwo PointersBinary Search+1frequency 52.4
- Number of Divisible Triplet SumsmediumArrayHash Tablefrequency 52.4
- Reverse Nodes in k-GrouphardLinked ListRecursionfrequency 52.4
- Best Time to Buy and Sell StockeasyArrayDynamic Programmingfrequency 49.3
- Course SchedulemediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+1frequency 49.3
- Longest Palindromic SubstringmediumTwo PointersStringDynamic ProgrammingManacherfrequency 49.3
- Min StackmediumStackDesignfrequency 49.3
- Report Spam MessagemediumArrayHash TableStringfrequency 49.3
- Trapping Rain WaterhardArrayTwo PointersDynamic ProgrammingStack+1frequency 49.3
- Zigzag ConversionmediumStringfrequency 49.3
- Container With Most WatermediumArrayTwo PointersGreedyfrequency 45.7
- Koko Eating BananasmediumArrayBinary Searchfrequency 45.7
- Kth Largest Element in an ArraymediumArrayDivide and ConquerSortingHeap (Priority Queue)+1frequency 45.7
- Maximum Team Size with Overlapping Intervalsmediumfrequency 45.7
- Maximum Units on a TruckeasyArrayGreedySortingfrequency 45.7
- Merge k Sorted ListshardLinked ListDivide and ConquerHeap (Priority Queue)Merge Sort+1frequency 45.7
- Minimum Absolute DifferenceeasyArraySortingfrequency 45.7
- Minimum Number of Taps to Open to Water a GardenhardArrayDynamic ProgrammingGreedyfrequency 45.7
- Minimum Window SubstringhardHash TableStringSliding Windowfrequency 45.7
- Optimal Account BalancinghardArrayDynamic ProgrammingBacktrackingBit Manipulation+1frequency 45.7
- Remove All Adjacent Duplicates in String IImediumStringStackfrequency 45.7
- Top K Frequent ElementsmediumArrayHash TableDivide and ConquerSorting+4frequency 45.7
- Word SearchmediumArrayStringBacktrackingDepth-First Search+1frequency 45.7
- Boundary of Binary TreemediumTreeDepth-First SearchBinary Treefrequency 41.2
- Coin ChangemediumArrayDynamic ProgrammingBreadth-First SearchKnapsack Problem+1frequency 41.2
- Collect Coins in a TreehardArrayTreeGraph TheoryTopological Sortfrequency 41.2
- Count Vowel Substrings of a StringeasyHash TableStringfrequency 41.2
- Design TwittermediumHash TableLinked ListDesignHeap (Priority Queue)frequency 41.2
- Gas StationmediumArrayGreedyfrequency 41.2
- Generate ParenthesesmediumStringDynamic ProgrammingBacktrackingBracket Sequencesfrequency 41.2
- Largest Number After Digit Swaps by ParityeasySortingHeap (Priority Queue)frequency 41.2
- Longest Increasing SubsequencemediumArrayBinary SearchDynamic ProgrammingLongest Increasing Subsequencefrequency 41.2
- Median of Two Sorted ArrayshardArrayBinary SearchDivide and Conquerfrequency 41.2
- Meeting Rooms IImediumArrayTwo PointersGreedySorting+2frequency 41.2
- Minimum Difficulty of a Job SchedulehardArrayDynamic Programmingfrequency 41.2
- Minimum Replacements to Sort the ArrayhardArrayMathGreedyfrequency 41.2
- Network Delay TimemediumDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)+2frequency 41.2
- Number of Digit OnehardMathDynamic ProgrammingRecursionfrequency 41.2
- Number of Visible People in a QueuehardArrayStackMonotonic Stackfrequency 41.2
- Odd String DifferenceeasyArrayHash TableStringfrequency 41.2
- Path with Maximum GoldmediumArrayBacktrackingMatrixfrequency 41.2
- Rotting OrangesmediumArrayBreadth-First SearchMatrixfrequency 41.2
- Sort ColorsmediumArrayTwo PointersSortingQuicksort+1frequency 41.2
- Subarrays with K Different IntegershardArrayHash TableSliding WindowCountingfrequency 41.2
- Validate Binary Search TreemediumTreeDepth-First SearchBinary Search TreeBinary Treefrequency 41.2
- Verify Preorder Sequence in Binary Search TreemediumArrayStackTreeBinary Search Tree+3frequency 41.2
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.