Meta Questions
Here are the LeetCode questions for Meta.
Total: 1432
Easy: 429
Medium: 788
Hard: 215
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 676 | |
| 2 | String | 324 | |
| 3 | Hash Table | 276 | |
| 4 | Dynamic Programming | 220 | |
| 5 | Math | 214 | |
| 6 | Sorting | 174 | |
| 7 | Depth-First Search | 160 | |
| 8 | Tree | 133 | |
| 9 | Greedy | 131 | |
| 10 | Breadth-First Search | 121 | |
| 11 | Binary Tree | 115 | |
| 12 | Binary Search | 113 | |
| 13 | Two Pointers | 112 | |
| 14 | Matrix | 108 | |
| 15 | Database | 93 | |
| 16 | Stack | 85 | |
| 17 | Bit Manipulation | 80 | |
| 18 | Heap (Priority Queue) | 69 | |
| 19 | Simulation | 68 | |
| 20 | Design | 68 | |
| 21 | Graph Theory | 61 | |
| 22 | Prefix Sum | 56 | |
| 23 | Backtracking | 55 | |
| 24 | Linked List | 55 | |
| 25 | Counting | 53 | |
| 26 | Sliding Window | 51 | |
| 27 | Enumeration | 37 | |
| 28 | Divide and Conquer | 36 | |
| 29 | Union-Find | 31 | |
| 30 | Recursion | 31 | |
| 31 | Monotonic Stack | 28 | |
| 32 | Binary Search Tree | 26 | |
| 33 | Ordered Set | 24 | |
| 34 | Trie | 23 | |
| 35 | Memoization | 22 | |
| 36 | Segment Tree | 18 | |
| 37 | Number Theory | 17 | |
| 38 | Hash Function | 16 | |
| 39 | Geometry | 16 | |
| 40 | Queue | 16 | |
| 41 | Bitmask | 15 | |
| 42 | Topological Sort | 15 | |
| 43 | Binary Indexed Tree | 14 | |
| 44 | String Matching | 12 | |
| 45 | Interactive | 12 | |
| 46 | Rolling Hash | 11 | |
| 47 | Shortest Path | 11 | |
| 48 | Doubly-Linked List | 10 | |
| 49 | Combinatorics | 10 | |
| 50 | Data Stream | 9 | |
| 51 | Game Theory | 9 | |
| 52 | Merge Sort | 8 | |
| 53 | Randomized | 7 | |
| 54 | Bucket Sort | 5 | |
| 55 | Sweep Line | 5 | |
| 56 | Concurrency | 5 | |
| 57 | Iterator | 5 | |
| 58 | Quickselect | 4 | |
| 59 | Counting Sort | 4 | |
| 60 | Brainteaser | 4 | |
| 61 | Shell | 4 | |
| 62 | Suffix Array | 4 | |
| 63 | Probability and Statistics | 3 | |
| 64 | Monotonic Queue | 3 | |
| 65 | Reservoir Sampling | 3 | |
| 66 | Eulerian Circuit | 2 | |
| 67 | Strongly Connected Component | 1 | |
| 68 | Minimum Spanning Tree | 1 | |
| 69 | Radix Sort | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Count K-th Roots in a Range | Visit | Medium | |
| 2 | Find the Smallest Balanced Index | Visit | Medium | |
| 3 | Design Ride Sharing System | Visit | Medium | |
| 4 | Lexicographically Smallest String After Deleting Duplicate Characters | Visit | Hard | |
| 5 | Largest Prime from Consecutive Prime Sum | Visit | Medium | |
| 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 1432 questions for free!
Log InFrequently Asked Questions
Common questions about Meta interviews