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
- Word LadderhardHash TableStringBreadth-First SearchBidirectional Searchfrequency 41.2
- 3SummediumArrayTwo PointersSortingfrequency 35.6
- All Possible Full Binary TreesmediumDynamic ProgrammingTreeRecursionMemoization+1frequency 35.6
- Combination SummediumArrayBacktrackingfrequency 35.6
- Decode StringmediumStringStackRecursionfrequency 35.6
- Diameter of N-Ary TreemediumTreeDepth-First SearchDP on Treesfrequency 35.6
- Find Leaves of Binary TreemediumTreeDepth-First SearchBinary TreeDP on Treesfrequency 35.6
- Find Median from Data StreamhardTwo PointersDesignSortingHeap (Priority Queue)+1frequency 35.6
- First Missing PositivehardArrayHash Tablefrequency 35.6
- House Robber IIImediumDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 35.6
- K Closest Points to OriginmediumArrayMathDivide and ConquerGeometry+4frequency 35.6
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to LimitmediumArrayQueueSliding WindowHeap (Priority Queue)+2frequency 35.6
- Longest Increasing Path in a MatrixhardArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+5frequency 35.6
- Magnetic Force Between Two BallsmediumArrayBinary SearchSortingfrequency 35.6
- Max Consecutive Ones IIImediumArrayBinary SearchSliding WindowPrefix Sumfrequency 35.6
- Maximal RectanglehardArrayDynamic ProgrammingStackMatrix+1frequency 35.6
- Maximal SquaremediumArrayDynamic ProgrammingMatrixfrequency 35.6
- Maximum SubarraymediumArrayDivide and ConquerDynamic Programmingfrequency 35.6
- Merge Two Sorted ListseasyLinked ListRecursionfrequency 35.6
- Minimum Edge Reversals So Every Node Is ReachablehardDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph Theoryfrequency 35.6
- Missing NumbereasyArrayHash TableMathBinary Search+2frequency 35.6
- Product of Array Except SelfmediumArrayPrefix Sumfrequency 35.6
- Reconstruct ItineraryhardArrayStringDepth-First SearchGraph Theory+5frequency 35.6
- Remove Stones to Minimize the TotalmediumArrayGreedyHeap (Priority Queue)frequency 35.6
- Reorganize StringmediumHash TableStringGreedySorting+2frequency 35.6
- Search in Rotated Sorted ArraymediumArrayBinary Searchfrequency 35.6
- Sliding Window MaximumhardArrayQueueSliding WindowHeap (Priority Queue)+2frequency 35.6
- Strange PrinterhardStringDynamic Programmingfrequency 35.6
- Top K Frequent WordsmediumArrayHash TableStringTrie+4frequency 35.6
- Tree DiametermediumTreeDepth-First SearchBreadth-First SearchGraph Theory+2frequency 35.6
- Two SumeasyArrayHash Tablefrequency 35.6
- Using a Robot to Print the Lexicographically Smallest StringmediumHash TableStringStackGreedyfrequency 35.6
- Valid ParentheseseasyStringStackBracket Sequencesfrequency 35.6
- Valid Parenthesis StringmediumStringDynamic ProgrammingStackGreedy+1frequency 35.6
- Vertical Order Traversal of a Binary TreehardHash TableTreeDepth-First SearchBreadth-First Search+2frequency 35.6
- Amount of Time for Binary Tree to Be InfectedmediumHash TableTreeDepth-First SearchBreadth-First Search+1frequency 27.7
- Angle Between Hands of a ClockmediumMathfrequency 27.7
- Backspace String CompareeasyTwo PointersStringStackSimulationfrequency 27.7
- Basic CalculatorhardMathStringStackRecursionfrequency 27.7
- Burst BalloonshardArrayDynamic Programmingfrequency 27.7
- Bus RouteshardArrayHash TableBreadth-First Searchfrequency 27.7
- CandyhardArrayGreedyfrequency 27.7
- Coin Change IImediumArrayDynamic ProgrammingKnapsack ProblemComplete Knapsackfrequency 27.7
- Combination Sum IImediumArrayBacktrackingfrequency 27.7
- Construct Binary Search Tree from Preorder TraversalmediumArrayStackTreeBinary Search Tree+2frequency 27.7
- Construct Binary Tree from Preorder and Inorder TraversalmediumArrayHash TableDivide and ConquerTree+1frequency 27.7
- Convert Sorted List to Binary Search TreemediumLinked ListDivide and ConquerTreeBinary Search Tree+1frequency 27.7
- Count Binary SubstringseasyTwo PointersStringfrequency 27.7
- Course Schedule IIIhardArrayGreedySortingHeap (Priority Queue)frequency 27.7
- Design Snake GamemediumArrayHash TableDesignQueue+1frequency 27.7
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.