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
- Process Tasks Using ServersmediumArrayHeap (Priority Queue)4 companies
- Tree NodemediumDatabase4 companies
- Maximum Xor ProductmediumMathGreedyBit Manipulation4 companies
- Seat Reservation ManagermediumDesignHeap (Priority Queue)4 companies
- Minimize Maximum Pair Sum in ArraymediumArrayTwo PointersGreedySorting4 companies
- Find Minimum Cost to Remove Array ElementsmediumArrayDynamic Programming4 companies
- First Unique NumbermediumArrayHash TableDesignQueue+14 companies
- Buildings With an Ocean ViewmediumArrayStackMonotonic Stack4 companies
- K Radius Subarray AveragesmediumArraySliding Window4 companies
- Minimum Number of People to TeachmediumArrayHash TableGreedy4 companies
- Reverse Only LetterseasyTwo PointersString4 companies
- Word AbbreviationhardArrayStringGreedyTrie+14 companies
- Decode the MessageeasyHash TableString4 companies
- Maximum Number of Non-overlapping Palindrome SubstringshardTwo PointersStringDynamic ProgrammingGreedy4 companies
- Minimize XORmediumGreedyBit Manipulation4 companies
- Number of Subarrays with Bounded MaximummediumArrayTwo Pointers4 companies
- Reverse Substrings Between Each Pair of ParenthesesmediumStringStackBracket Sequences4 companies
- Tenth LineeasyShell4 companies
- Threshold Majority QuerieshardArrayHash TableBinary SearchDivide and Conquer+24 companies
- Number of Days Between Two DateseasyMathString4 companies
- Add Bold Tag in StringmediumArrayHash TableStringTrie+24 companies
- Find Leaves of Binary TreemediumTreeDepth-First SearchBinary TreeDP on Trees4 companies
- Closest Equal Element QueriesmediumArrayHash TableBinary Search4 companies
- Count Paths That Can Form a Palindrome in a TreehardHash TableBit ManipulationTreeDepth-First Search4 companies
- Find Servers That Handled Most Number of RequestshardArrayHeap (Priority Queue)SimulationOrdered Set4 companies
- Smallest Missing Non-negative Integer After OperationsmediumArrayHash TableMathGreedy4 companies
- Escape the Spreading FirehardArrayBinary SearchBreadth-First SearchMatrix4 companies
- Take Gifts From the Richest PileeasyArrayHeap (Priority Queue)Simulation4 companies
- Most Profit Assigning WorkmediumArrayTwo PointersBinary SearchGreedy+14 companies
- Maximum Value at a Given Index in a Bounded ArraymediumMathBinary SearchGreedy4 companies
- Buddy StringseasyHash TableString4 companies
- Mini ParsermediumStringStackDepth-First Search4 companies
- Shopping OffersmediumArrayDynamic ProgrammingBacktrackingBit Manipulation+44 companies
- Find Minimum Time to Reach Last Room ImediumArrayGraph TheoryHeap (Priority Queue)Matrix+14 companies
- Minimum Operations to Write the Letter Y on a GridmediumArrayHash TableMatrixCounting4 companies
- Convert Binary Search Tree to Sorted Doubly Linked ListmediumLinked ListStackTreeDepth-First Search+34 companies
- Spiral Matrix IVmediumArrayLinked ListMatrixSimulation4 companies
- Insert into a Sorted Circular Linked ListmediumLinked List4 companies
- Bag of TokensmediumArrayTwo PointersGreedySorting4 companies
- Count Unreachable Pairs of Nodes in an Undirected GraphmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theory4 companies
- Minimum Equal Sum of Two Arrays After Replacing ZerosmediumArrayGreedy4 companies
- Lowest Common Ancestor of a Binary Tree IVmediumHash TableTreeDepth-First SearchBinary Tree+24 companies
- Minimize Maximum Component CostmediumBinary SearchUnion-FindGraph TheorySorting4 companies
- Goat LatineasyString4 companies
- Stream of CharactershardArrayStringDesignTrie+24 companies
- Split a String in Balanced StringseasyStringGreedyCounting4 companies
- Lexicographically Smallest Generated StringhardStringGreedyString Matching4 companies
- Make Lexicographically Smallest Array by Swapping ElementsmediumArrayUnion-FindSorting4 companies
- Minimum Cost to Convert String IIhardArrayStringDynamic ProgrammingGraph Theory+24 companies
- Minimum Time to Visit a Cell In a GridhardArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+24 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.