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
- Sum MultipleseasyMath3 companies
- Minimum Number of Moves to Seat EveryoneeasyArrayGreedySortingCounting Sort3 companies
- Minimum Number of Seconds to Make Mountain Height ZeromediumArrayMathBinary SearchGreedy+13 companies
- Maximum Area of Longest Diagonal RectangleeasyArray3 companies
- Vowels Game in a StringmediumMathStringBrainteaserGame Theory3 companies
- Water Bottles IImediumMathSimulation3 companies
- Final Array State After K Multiplication Operations IIhardArrayHeap (Priority Queue)Simulation3 companies
- Break a PalindromemediumStringGreedy2 companies
- Check if an Original String Exists Given Two Encoded StringshardStringDynamic Programming2 companies
- Make Array Non-decreasing or Non-increasinghardArrayDynamic ProgrammingGreedyHeap (Priority Queue)2 companies
- Maximum Length of Subarray With Positive ProductmediumArrayDynamic ProgrammingGreedy2 companies
- Top TravellerseasyDatabase2 companies
- Alternating Groups IeasyArraySliding Window2 companies
- Ways to Split Array Into Three SubarraysmediumArrayTwo PointersBinary SearchPrefix Sum2 companies
- Design SQLmediumArrayHash TableStringDesign2 companies
- Subsequence of Size K With the Largest Even SummediumArrayGreedySorting2 companies
- Capital Gain/LossmediumDatabase2 companies
- Check if There is a Valid Path in a GridmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+12 companies
- Finding the Users Active MinutesmediumArrayHash Table2 companies
- Masking Personal InformationmediumString2 companies
- Alternating Digit SumeasyMath2 companies
- Minimize Malware Spread IIhardArrayHash TableDepth-First SearchBreadth-First Search+22 companies
- Number of Ways to Wear Different Hats to Each OtherhardArrayDynamic ProgrammingBit ManipulationBitmask+32 companies
- Subrectangle QueriesmediumArrayDesignMatrix2 companies
- Find Maximum Area of a TrianglemediumArrayHash TableMathGreedy+22 companies
- Bricks Falling When HithardArrayUnion-FindMatrix2 companies
- Maximum Depth of N-ary TreeeasyTreeDepth-First SearchBreadth-First Search2 companies
- Number of Increasing Paths in a GridhardArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+42 companies
- Time Needed to Rearrange a Binary StringmediumStringDynamic ProgrammingSimulation2 companies
- Plates Between CandlesmediumArrayStringBinary SearchPrefix Sum2 companies
- Smallest Range IeasyArrayMath2 companies
- High FiveeasyArrayHash TableSortingHeap (Priority Queue)2 companies
- Better Compression of StringmediumHash TableStringSortingCounting2 companies
- Synonymous SentencesmediumArrayHash TableStringBacktracking+22 companies
- Smallest Substring With Identical Characters IhardArrayBinary SearchEnumeration2 companies
- Minimum Swaps to Group All 1's TogethermediumArraySliding Window2 companies
- Binary Tree Upside DownmediumTreeDepth-First SearchBinary Tree2 companies
- Maximize Subarray Sum After Removing All Occurrences of One ElementhardArrayHash TableDivide and ConquerDynamic Programming+22 companies
- Tag ValidatorhardStringStack2 companies
- Subarray With Elements Greater Than Varying ThresholdhardArrayStackUnion-FindMonotonic Stack2 companies
- People Whose List of Favorite Companies Is Not a Subset of Another ListmediumArrayHash TableString2 companies
- Evaluate the Bracket Pairs of a StringmediumArrayHash TableString2 companies
- Count Array Pairs Divisible by KhardArrayHash TableMathCounting+32 companies
- Find the Sum of the Power of All SubsequenceshardArrayDynamic ProgrammingKnapsack Problem0-1 Knapsack2 companies
- Maximum ORmediumArrayGreedyBit ManipulationPrefix Sum2 companies
- Maximum Strength of K Disjoint SubarrayshardArrayDynamic ProgrammingPrefix Sum2 companies
- Shortest String That Contains Three StringsmediumStringGreedyEnumeration2 companies
- Leftmost Column with at Least a OnemediumArrayBinary SearchMatrixInteractive2 companies
- Largest Plus SignmediumArrayDynamic Programming2 companies
- Minimum Processing TimemediumArrayGreedySorting2 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.