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
3,110 questions · all time
- Find the Width of Columns of a GrideasyArrayMatrix1 company
- Number of Trusted Contacts of a CustomermediumDatabase1 company
- Stamping the GridhardArrayGreedyMatrixPrefix Sum1 company
- Find Median Given Frequency of NumbershardDatabase1 company
- Number of Possible Sets of Closing BrancheshardBit ManipulationGraph TheoryHeap (Priority Queue)Enumeration+11 company
- Alert Using Same Key-Card Three or More Times in a One Hour PeriodmediumArrayHash TableStringSorting1 company
- Find X Value of Array ImediumArrayMathDynamic Programming1 company
- Find X Value of Array IIhardArrayMathSegment Tree1 company
- Count Pairs of Connectable Servers in a Weighted Tree NetworkmediumArrayTreeDepth-First Search1 company
- Minimum Time to Visit All HousesmediumArrayPrefix Sum1 company
- Minimum Cost Good CaptionhardStringDynamic Programming1 company
- Minimum Operations to Make Character Frequencies EqualhardHash TableStringDynamic ProgrammingCounting+11 company
- Existence of a Substring in a String and Its ReverseeasyHash TableString1 company
- Find the Sum of Subsequence PowershardArrayDynamic ProgrammingSorting1 company
- Beautiful Towers ImediumArrayStackMonotonic Stack1 company
- Beautiful Towers IImediumArrayStackMonotonic Stack1 company
- Check If a Number Is Majority Element in a Sorted ArrayeasyArrayBinary Search1 company
- Check Whether Two Strings are Almost EquivalenteasyHash TableStringCounting1 company
- Equalize Strings by Adding or Removing Characters at EndsmediumStringBinary SearchDynamic ProgrammingSliding Window+11 company
- Find Subarray With Bitwise OR Closest to KhardArrayBinary SearchBit ManipulationSegment Tree1 company
- Find the Last Marked Nodes in TreehardTreeDepth-First Search1 company
- Maximize Grid HappinesshardDynamic ProgrammingBit ManipulationMemoizationBitmask1 company
- Maximum Height of a TriangleeasyArrayEnumeration1 company
- Maximum Number That Makes Result of Bitwise AND ZeromediumStringGreedySorting1 company
- Number of Self-Divisible PermutationsmediumArrayMathDynamic ProgrammingBacktracking+31 company
- Viewers Turned StreamershardDatabase1 company
- Find the Score of All Prefixes of an ArraymediumArrayPrefix Sum1 company
- Incremental Memory LeakmediumMathSimulation1 company
- Minimum Moves to Pick K OneshardArrayGreedySliding WindowPrefix Sum1 company
- Maximum Coin CollectionmediumArrayDynamic Programming1 company
- Calculate Score After Performing InstructionsmediumArrayHash TableStringSimulation1 company
- Unit Conversion ImediumDepth-First SearchBreadth-First SearchGraph Theory1 company
- Immediate Food Delivery IeasyDatabase1 company
- Subsequence With the Minimum ScorehardTwo PointersStringBinary Search1 company
- Shortest Word Distance IIImediumArrayString1 company
- Minimum Cost to Equalize Arrays Using SwapsmediumArrayHash TableGreedyCounting1 company
- Points That Intersect With CarseasyArrayHash TablePrefix Sum1 company
- Report Spam MessagemediumArrayHash TableString1 company
- Find the Grid of Region AveragemediumArrayMatrix1 company
- Maximum Rows Covered by ColumnsmediumArrayBacktrackingBit ManipulationMatrix+11 company
- Number of Pairs of Strings With Concatenation Equal to TargetmediumArrayHash TableStringCounting1 company
- Array With Elements Not Equal to Average of NeighborsmediumArrayGreedySorting1 company
- Calculate Digit Sum of a StringeasyStringSimulation1 company
- Check If String Is a Prefix of ArrayeasyArrayTwo PointersString1 company
- Falling SquareshardArraySegment TreeOrdered Set1 company
- Find Pattern in Infinite Stream ImediumArraySliding WindowRolling HashString Matching+21 company
- Find Pattern in Infinite Stream IIhardArraySliding WindowRolling HashString Matching+21 company
- Fixed PointeasyArrayBinary Search1 company
- Hopper Company Queries IhardDatabase1 company
- Hopper Company Queries IIhardDatabase1 company
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.