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
- Process String with Special Operations IIhardStringSimulation4 companies
- Count Largest GroupeasyHash TableMathCounting4 companies
- Delete Characters to Make Fancy StringeasyString4 companies
- Find All Possible Stable Binary Arrays ImediumDynamic ProgrammingPrefix Sum4 companies
- Fruits Into Baskets IIImediumArrayBinary SearchSegment TreeOrdered Set4 companies
- Maximum Product of Two DigitseasyMathSorting4 companies
- Minimum Operations to Make Array Sum Divisible by KeasyArrayMath4 companies
- Path Existence Queries in a Graph IIhardArrayTwo PointersBinary SearchDynamic Programming+44 companies
- Sum of k-Mirror NumbershardMathEnumeration4 companies
- Leaf-Similar TreeseasyTreeDepth-First SearchBinary Tree4 companies
- Three Consecutive OddseasyArray4 companies
- Count Prefix and Suffix Pairs IeasyArrayStringTrieRolling Hash+24 companies
- Find Common Elements Between Two ArrayseasyArrayHash Table4 companies
- Find Score of an Array After Marking All ElementsmediumArrayHash TableSortingHeap (Priority Queue)+14 companies
- Find the Power of K-Size Subarrays ImediumArraySliding Window4 companies
- Max Difference You Can Get From Changing an IntegermediumMathGreedy4 companies
- Maximum Amount of Money Robot Can EarnmediumArrayDynamic ProgrammingMatrix4 companies
- Minimum Array EndmediumBit Manipulation4 companies
- Reverse Prefix of WordeasyTwo PointersStringStack4 companies
- Spiral Matrix IIImediumArrayMatrixSimulation4 companies
- Swap Sex of EmployeeseasyDatabase4 companies
- Two Furthest Houses With Different ColorseasyArrayGreedy4 companies
- Print Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Tree4 companies
- Smallest Divisible Digit Product IIhardMathStringBacktrackingGreedy+14 companies
- Construct Product MatrixmediumArrayMatrixPrefix Sum4 companies
- Count of Matches in TournamenteasyMathSimulation4 companies
- Equal Sum Grid Partition ImediumArrayMatrixEnumerationPrefix Sum4 companies
- Flip Columns For Maximum Number of Equal RowsmediumArrayHash TableMatrix4 companies
- Insert Greatest Common Divisors in Linked ListmediumLinked ListMathNumber Theory4 companies
- K Inverse Pairs ArrayhardDynamic Programming4 companies
- Longest Substring of One Repeating CharacterhardArrayStringSegment TreeOrdered Set4 companies
- Maximum Number of Fish in a GridmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+14 companies
- Minimum Absolute Distance Between Mirror PairsmediumArrayHash TableMath4 companies
- Minimum Operations to Make a Uni-Value GridmediumArrayMathSortingMatrix4 companies
- 4Sum IImediumArrayHash Table4 companies
- Count Partitions With Max-Min Difference at Most KmediumArrayDynamic ProgrammingQueueSliding Window+24 companies
- Function Compositioneasy4 companies
- Patients With a ConditioneasyDatabase4 companies
- Sort Matrix by DiagonalsmediumArraySortingMatrix4 companies
- Sum of DistancesmediumArrayHash TablePrefix Sum4 companies
- Word FrequencymediumShell4 companies
- A Number After a Double ReversaleasyMath4 companies
- Arithmetic Slices II - SubsequencehardArrayDynamic Programming4 companies
- Construct the Minimum Bitwise Array IeasyArrayBit Manipulation4 companies
- Minimum Cuts to Divide a CircleeasyMathGeometry4 companies
- Count Partitions with Even Sum DifferenceeasyArrayMathPrefix Sum4 companies
- Count of Interesting SubarraysmediumArrayHash TablePrefix Sum4 companies
- Find Closest PersoneasyMath4 companies
- Linked List in Binary TreemediumLinked ListTreeDepth-First SearchBinary Tree4 companies
- Minimum Changes To Make Alternating Binary StringeasyString4 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.