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
1,399 questions at Meta · all time
- Find Unique Binary StringmediumArrayHash TableStringBacktrackingfrequency 8.0
- Find Users With Valid E-MailseasyDatabasefrequency 8.0
- Find Words That Can Be Formed by CharacterseasyArrayHash TableStringCountingfrequency 8.0
- Find X-Sum of All K-Long Subarrays IeasyArrayHash TableSliding WindowHeap (Priority Queue)frequency 8.0
- Find the Closest PalindromehardMathStringfrequency 8.0
- Find the Lexicographically Smallest Valid SequencemediumTwo PointersStringDynamic ProgrammingGreedyfrequency 8.0
- Find the Maximum Number of Elements in SubsetmediumArrayHash TableEnumerationfrequency 8.0
- Find the Minimum Amount of Time to Brew PotionsmediumArraySimulationPrefix Sumfrequency 8.0
- Find the Minimum and Maximum Number of Nodes Between Critical PointsmediumLinked Listfrequency 8.0
- Finding Pairs With a Certain SummediumArrayHash TableDesignfrequency 8.0
- Furthest Building You Can ReachmediumArrayGreedyHeap (Priority Queue)frequency 8.0
- Furthest Point From OrigineasyStringCountingfrequency 8.0
- Group Sold Products By The DateeasyDatabasefrequency 8.0
- Grumpy Bookstore OwnermediumArraySliding Windowfrequency 8.0
- Guess Number Higher or LowereasyBinary SearchInteractivefrequency 8.0
- House Robber IIImediumDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 8.0
- IPOhardArrayGreedySortingHeap (Priority Queue)frequency 8.0
- Image SmoothereasyArrayMatrixfrequency 8.0
- Insert into a Binary Search TreemediumTreeBinary Search TreeBinary Treefrequency 8.0
- Jump Game VIImediumStringDynamic ProgrammingSliding WindowPrefix Sumfrequency 8.0
- K-th Symbol in GrammarmediumMathBit ManipulationRecursionfrequency 8.0
- Kth Smallest Number in Multiplication TablehardMathBinary Searchfrequency 8.0
- Last Stone Weight IImediumArrayDynamic ProgrammingKnapsack Problem0-1 Knapsackfrequency 8.0
- Left and Right Sum DifferenceseasyArrayPrefix Sumfrequency 8.0
- Length of the Longest Subsequence That Sums to TargetmediumArrayDynamic ProgrammingKnapsack Problem0-1 Knapsackfrequency 8.0
- Lexicographically Minimum String After Removing StarsmediumHash TableStringStackGreedy+1frequency 8.0
- Lexicographically Smallest Equivalent StringmediumStringUnion-Findfrequency 8.0
- Linked List in Binary TreemediumLinked ListTreeDepth-First SearchBinary Treefrequency 8.0
- Logger Rate LimitereasyHash TableDesignData Streamfrequency 8.0
- Long Pressed NameeasyTwo PointersStringfrequency 8.0
- Longest Arithmetic Subsequence of Given DifferencemediumArrayHash TableDynamic Programmingfrequency 8.0
- Longest Even Odd Subarray With ThresholdeasyArraySliding Windowfrequency 8.0
- Longest Nice SubarraymediumArrayBit ManipulationSliding Windowfrequency 8.0
- Longest Subarray With Maximum Bitwise ANDmediumArrayBit ManipulationBrainteaserfrequency 8.0
- Longest Substring with At Least K Repeating CharactersmediumHash TableStringDivide and ConquerSliding Windowfrequency 8.0
- Magnetic Force Between Two BallsmediumArrayBinary SearchSortingfrequency 8.0
- Make Array Elements Equal to ZeroeasyArraySimulationPrefix Sumfrequency 8.0
- Max Chunks To Make SortedmediumArrayStackGreedySorting+1frequency 8.0
- Max Dot Product of Two SubsequenceshardArrayDynamic ProgrammingLongest Common Subsequencefrequency 8.0
- Max Sum of a Pair With Equal Sum of DigitsmediumArrayHash TableSortingHeap (Priority Queue)frequency 8.0
- Maximize the Confusion of an ExammediumStringBinary SearchSliding WindowPrefix Sumfrequency 8.0
- Maximum Difference Between Adjacent Elements in a Circular ArrayeasyArrayfrequency 8.0
- Maximum Difference Between Even and Odd Frequency IIhardStringSliding WindowEnumerationPrefix Sumfrequency 8.0
- Maximum Difference Between Node and AncestormediumTreeDepth-First SearchBinary Treefrequency 8.0
- Maximum Height by Stacking CuboidshardArrayDynamic ProgrammingSortingfrequency 8.0
- Maximum Number of Distinct Elements After OperationsmediumArrayGreedySortingfrequency 8.0
- Maximum Number of Fish in a GridmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 8.0
- Maximum Number of Occurrences of a SubstringmediumHash TableStringSliding Windowfrequency 8.0
- Maximum Running Time of N ComputershardArrayBinary SearchGreedySortingfrequency 8.0
- Maximum Subarray Sum With Length Divisible by KmediumArrayHash TablePrefix Sumfrequency 8.0
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.