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
148 questions at Adobe · all time
- Largest NumbermediumArrayStringGreedySortingfrequency 65.7
- Lowest Common Ancestor of a Binary TreemediumTreeDepth-First SearchBinary TreeBinary Lifting+1frequency 65.7
- Minimum Processing TimemediumArrayGreedySortingfrequency 65.7
- Restore IP AddressesmediumStringBacktrackingfrequency 65.7
- Top K Frequent ElementsmediumArrayHash TableDivide and ConquerSorting+4frequency 65.7
- Binary Tree Zigzag Level Order TraversalmediumTreeBreadth-First SearchBinary Treefrequency 59.8
- Count Pairs Of Similar StringseasyArrayHash TableStringBit Manipulation+1frequency 59.8
- Count Subarrays With Fixed BoundshardArrayQueueSliding WindowMonotonic Queuefrequency 59.8
- Flatten Nested List IteratormediumStackTreeDepth-First SearchDesign+2frequency 59.8
- Gas StationmediumArrayGreedyfrequency 59.8
- Generate ParenthesesmediumStringDynamic ProgrammingBacktrackingBracket Sequencesfrequency 59.8
- Rotting OrangesmediumArrayBreadth-First SearchMatrixfrequency 59.8
- Search a 2D MatrixmediumArrayBinary SearchMatrixfrequency 59.8
- Search in Rotated Sorted ArraymediumArrayBinary Searchfrequency 59.8
- Shortest Path in a Grid with Obstacles EliminationhardArrayBreadth-First SearchMatrixfrequency 59.8
- Spiral MatrixmediumArrayMatrixSimulationfrequency 59.8
- String to Integer (atoi)mediumStringfrequency 59.8
- Top K Frequent WordsmediumArrayHash TableStringTrie+4frequency 59.8
- Basic Calculator IImediumMathStringStackfrequency 52.2
- Coin ChangemediumArrayDynamic ProgrammingBreadth-First SearchKnapsack Problem+1frequency 52.2
- Construct Binary Tree from Preorder and Inorder TraversalmediumArrayHash TableDivide and ConquerTree+1frequency 52.2
- Contains Duplicate IIeasyArrayHash TableSliding Windowfrequency 52.2
- Cousins in Binary TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 52.2
- Find Median from Data StreamhardTwo PointersDesignSortingHeap (Priority Queue)+1frequency 52.2
- Game of LifemediumArrayMatrixSimulationfrequency 52.2
- HeatersmediumArrayTwo PointersBinary SearchSortingfrequency 52.2
- House RobbermediumArrayDynamic Programmingfrequency 52.2
- Is SubsequenceeasyTwo PointersStringDynamic Programmingfrequency 52.2
- Longest Increasing Path in a MatrixhardArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+5frequency 52.2
- Meeting Rooms IImediumArrayTwo PointersGreedySorting+2frequency 52.2
- Minimum Cost For TicketsmediumArrayDynamic Programmingfrequency 52.2
- N-QueenshardArrayBacktrackingAlgorithm Xfrequency 52.2
- Nested List Weight SummediumDepth-First SearchBreadth-First Searchfrequency 52.2
- Product of Array Except SelfmediumArrayPrefix Sumfrequency 52.2
- Remove K DigitsmediumStringStackGreedyMonotonic Stackfrequency 52.2
- Reverse IntegermediumMathfrequency 52.2
- Roman to IntegereasyHash TableMathStringfrequency 52.2
- Rotate ImagemediumArrayMathMatrixfrequency 52.2
- Shopping OffersmediumArrayDynamic ProgrammingBacktrackingBit Manipulation+4frequency 52.2
- Single NumbereasyArrayBit Manipulationfrequency 52.2
- Sum of All Subset XOR TotalseasyArrayMathBacktrackingBit Manipulation+2frequency 52.2
- Unit Conversion ImediumDepth-First SearchBreadth-First SearchGraph Theoryfrequency 52.2
- Amount of Time for Binary Tree to Be InfectedmediumHash TableTreeDepth-First SearchBreadth-First Search+1frequency 41.7
- Basic CalculatorhardMathStringStackRecursionfrequency 41.7
- Binary Tree Level Order TraversalmediumTreeBreadth-First SearchBinary Treefrequency 41.7
- Boundary of Binary TreemediumTreeDepth-First SearchBinary Treefrequency 41.7
- Combination Sum IImediumArrayBacktrackingfrequency 41.7
- Container With Most WatermediumArrayTwo PointersGreedyfrequency 41.7
- Copy List with Random PointermediumHash TableLinked Listfrequency 41.7
- Count Complete Tree NodesmediumBinary SearchBit ManipulationTreeBinary Treefrequency 41.7
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.