Adobe
147 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Lowest Common Ancestor of a Binary Tree | Medium | 69.3% | TopicsTreeDepth-First SearchBinary TreeBinary LiftingLowest Common Ancestor |
| 347. Top K Frequent Elements | Medium | 69.3% | TopicsArrayHash TableDivide and ConquerSortingHeap (Priority Queue)Bucket SortCountingQuickselect |
| 124. Binary Tree Maximum Path Sum | Hard | 69.3% | TopicsDynamic ProgrammingTreeDepth-First SearchBinary TreeDP on Trees |
| 295. Find Median from Data Stream | Hard | 69.3% | TopicsTwo PointersDesignSortingHeap (Priority Queue)Data Stream |
| String to Integer (atoi) | Medium | 63.1% | TopicsString |
| 33. Search in Rotated Sorted Array | Medium | 63.1% | TopicsArrayBinary Search |
| 54. Spiral Matrix | Medium | 63.1% | TopicsArrayMatrixSimulation |
| 74. Search a 2D Matrix | Medium | 63.1% | TopicsArrayBinary SearchMatrix |
| 103. Binary Tree Zigzag Level Order Traversal | Medium | 63.1% | TopicsTreeBreadth-First SearchBinary Tree |
| 134. Gas Station | Medium | 63.1% | TopicsArrayGreedy |
| Largest Number | Medium | 63.1% | TopicsArrayStringGreedySorting |
| 2506. Count Pairs Of Similar Strings | Easy | 63.1% | TopicsArrayHash TableStringBit ManipulationCounting |
| 692. Top K Frequent Words | Medium | 63.1% | TopicsArrayHash TableStringTrieSortingHeap (Priority Queue)Bucket SortCounting |
| 1293. Shortest Path in a Grid with Obstacles Elimination | Hard | 63.1% | TopicsArrayBreadth-First SearchMatrix |
| Flatten Nested List Iterator | Medium | 63.1% | TopicsStackTreeDepth-First SearchDesignQueueIterator |
| 2444. Count Subarrays With Fixed Bounds | Hard | 63.1% | TopicsArrayQueueSliding WindowMonotonic Queue |
| 1797. Design Authentication Manager | Medium | 63.1% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 13. Roman to Integer | Easy | 55.2% | TopicsHash TableMathString |
| 22. Generate Parentheses | Medium | 55.2% | TopicsStringDynamic ProgrammingBacktrackingBracket Sequences |
| 51. N-Queens | Hard | 55.2% | TopicsArrayBacktrackingAlgorithm X |
| 105. Construct Binary Tree from Preorder and Inorder Traversal | Medium | 55.2% | TopicsArrayHash TableDivide and ConquerTreeBinary Tree |
| 127. Word Ladder | Hard | 55.2% | TopicsHash TableStringBreadth-First SearchBidirectional Search |
| 136. Single Number | Easy | 55.2% | TopicsArrayBit Manipulation |
| Basic Calculator II | Medium | 55.2% | TopicsMathStringStack |
| 238. Product of Array Except Self | Medium | 55.2% | TopicsArrayPrefix Sum |
