Adobe Questions
Here are the LeetCode questions for Adobe.
Total: 350
Easy: 102
Medium: 193
Hard: 55
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 156 | |
| 2 | String | 93 | |
| 3 | Hash Table | 68 | |
| 4 | Dynamic Programming | 53 | |
| 5 | Sorting | 53 | |
| 6 | Math | 50 | |
| 7 | Two Pointers | 50 | |
| 8 | Depth-First Search | 39 | |
| 9 | Tree | 37 | |
| 10 | Binary Tree | 35 | |
| 11 | Binary Search | 31 | |
| 12 | Breadth-First Search | 30 | |
| 13 | Linked List | 26 | |
| 14 | Stack | 26 | |
| 15 | Greedy | 26 | |
| 16 | Matrix | 25 | |
| 17 | Bit Manipulation | 19 | |
| 18 | Heap (Priority Queue) | 19 | |
| 19 | Divide and Conquer | 18 | |
| 20 | Backtracking | 18 | |
| 21 | Design | 17 | |
| 22 | Recursion | 17 | |
| 23 | Sliding Window | 16 | |
| 24 | Database | 14 | |
| 25 | Prefix Sum | 11 | |
| 26 | Simulation | 10 | |
| 27 | Counting | 10 | |
| 28 | Enumeration | 10 | |
| 29 | Graph Theory | 9 | |
| 30 | Union-Find | 8 | |
| 31 | Binary Search Tree | 8 | |
| 32 | Monotonic Stack | 8 | |
| 33 | Memoization | 6 | |
| 34 | Ordered Set | 6 | |
| 35 | Trie | 5 | |
| 36 | Queue | 5 | |
| 37 | Merge Sort | 5 | |
| 38 | Bucket Sort | 5 | |
| 39 | Binary Indexed Tree | 4 | |
| 40 | Segment Tree | 4 | |
| 41 | Counting Sort | 4 | |
| 42 | Game Theory | 4 | |
| 43 | Topological Sort | 3 | |
| 44 | String Matching | 3 | |
| 45 | Hash Function | 3 | |
| 46 | Quickselect | 3 | |
| 47 | Bitmask | 3 | |
| 48 | Sweep Line | 2 | |
| 49 | Rolling Hash | 2 | |
| 50 | Shell | 2 | |
| 51 | Doubly-Linked List | 2 | |
| 52 | Radix Sort | 2 | |
| 53 | Iterator | 2 | |
| 54 | Number Theory | 2 | |
| 55 | Brainteaser | 1 | |
| 56 | Combinatorics | 1 | |
| 57 | Interactive | 1 | |
| 58 | Data Stream | 1 | |
| 59 | Monotonic Queue | 1 | |
| 60 | Eulerian Circuit | 1 | |
| 61 | Randomized | 1 | |
| 62 | Shortest Path | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Minimum Moves to Equal Array Elements III | Visit | Easy | |
| 2 | Threshold Majority Queries | Visit | Hard | |
| 3 | Unit Conversion I | Visit | Medium | |
| 4 | Bitwise OR of Adjacent Elements | Visit | Easy | |
| 5 | Split the Array | Visit | Easy | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 350 questions for free!
Log InFrequently Asked Questions
Common questions about Adobe interviews