Problems
Callback's own problems and the LeetCode questions companies have been asking, in one place — pick a category, then filter by company, frequency, status, difficulty, topic, and language.
Asked on LeetCode
3,115 questions · all time
- Orderly QueuehardMathStringSortingLexicographically Minimal String Rotation2 companies
- Strong FriendshipmediumDatabase2 companies
- Sum of Nodes with Even-Valued GrandparentmediumTreeDepth-First SearchBreadth-First SearchBinary Tree2 companies
- Event Emittermedium2 companies
- Find Positive Integer Solution for a Given EquationmediumMathTwo PointersBinary SearchInteractive2 companies
- Flip Game IImediumMathDynamic ProgrammingBacktrackingMemoization+42 companies
- Count Non-Decreasing Subarrays After K OperationshardArrayStackSegment TreeQueue+32 companies
- Describe the PaintingmediumArrayHash TableSortingPrefix Sum2 companies
- Find All People With SecrethardDepth-First SearchBreadth-First SearchUnion-FindGraph Theory+12 companies
- Maximum Number of Points with CostmediumArrayDynamic ProgrammingMatrix2 companies
- Minimize Hamming Distance After Swap OperationsmediumArrayDepth-First SearchUnion-Find2 companies
- Time Needed to Inform All EmployeesmediumTreeDepth-First SearchBreadth-First Search2 companies
- X of a Kind in a Deck of CardseasyArrayHash TableMathCounting+32 companies
- All Elements in Two Binary Search TreesmediumTreeDepth-First SearchBinary Search TreeSorting+12 companies
- Distant BarcodesmediumArrayHash TableGreedySorting+22 companies
- Find Distance in a Binary TreemediumHash TableTreeDepth-First SearchBreadth-First Search+32 companies
- Maximum Capacity Within BudgetmediumArrayTwo PointersBinary SearchSorting2 companies
- Minimum Average DifferencemediumArrayPrefix Sum2 companies
- Minimum Number of Operations to Make Array EmptymediumArrayHash TableGreedyCounting2 companies
- Number of Laser Beams in a BankmediumArrayMathStringMatrix2 companies
- Remove Palindromic SubsequenceseasyTwo PointersString2 companies
- Solve the EquationmediumMathStringSimulationLinear Algebra2 companies
- Split With Minimum SumeasyMathGreedySorting2 companies
- Count Items Matching a RuleeasyArrayString2 companies
- Find the Kth Smallest Sum of a Matrix With Sorted RowshardArrayBinary SearchHeap (Priority Queue)Matrix2 companies
- Inorder Successor in BST IImediumTreeBinary Search TreeBinary Tree2 companies
- Prefix and Suffix SearchhardArrayHash TableStringDesign+12 companies
- Minimum Obstacle Removal to Reach CornerhardArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+42 companies
- Smallest String Starting From LeafmediumStringBacktrackingTreeDepth-First Search+12 companies
- Special Positions in a Binary MatrixeasyArrayMatrix2 companies
- Cat and MousehardMathDynamic ProgrammingGraph TheoryTopological Sort+42 companies
- Convert Object to JSON Stringmedium2 companies
- Largest Component Size by Common FactorhardArrayHash TableMathUnion-Find+22 companies
- Longest Balanced Subarray IIhardArrayHash TableDivide and ConquerSegment Tree+12 companies
- Minimum Distance to Type a Word Using Two FingershardStringDynamic Programming2 companies
- Number of Good Ways to Split a StringmediumHash TableStringDynamic ProgrammingBit Manipulation+12 companies
- Online ElectionmediumArrayHash TableBinary SearchDesign2 companies
- Minimum Speed to Arrive on TimemediumArrayBinary Search2 companies
- Optimize Water Distribution in a VillagehardUnion-FindGraph TheoryHeap (Priority Queue)Minimum Spanning Tree+32 companies
- Split Strings by SeparatoreasyArrayString2 companies
- Append Characters to String to Make SubsequencemediumTwo PointersStringGreedy2 companies
- Construct String from Binary TreemediumStringTreeDepth-First SearchBinary Tree2 companies
- Find Good Days to Rob the BankmediumArrayDynamic ProgrammingPrefix Sum2 companies
- Find the Divisibility Array of a StringmediumArrayMathString2 companies
- Maximum Star Sum of a GraphmediumArrayGreedyGraph TheorySorting+12 companies
- Number of Distinct AverageseasyArrayHash TableTwo PointersSorting2 companies
- Split Array into Fibonacci SequencemediumStringBacktracking2 companies
- Find the Smallest Balanced IndexmediumArrayPrefix Sum2 companies
- Make Two Arrays Equal by Reversing SubarrayseasyArrayHash TableSorting2 companies
- Maximum Compatibility Score SummediumArrayDynamic ProgrammingBacktrackingBit Manipulation+82 companies
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.