Google Questions
Here are the LeetCode questions for Google.
Total: 2258
Easy: 591
Medium: 1176
Hard: 491
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 1111 | |
| 2 | String | 518 | |
| 3 | Hash Table | 448 | |
| 4 | Dynamic Programming | 356 | |
| 5 | Math | 337 | |
| 6 | Sorting | 262 | |
| 7 | Greedy | 228 | |
| 8 | Depth-First Search | 214 | |
| 9 | Binary Search | 191 | |
| 10 | Tree | 166 | |
| 11 | Breadth-First Search | 162 | |
| 12 | Matrix | 157 | |
| 13 | Two Pointers | 156 | |
| 14 | Database | 153 | |
| 15 | Bit Manipulation | 143 | |
| 16 | Binary Tree | 135 | |
| 17 | Stack | 122 | |
| 18 | Prefix Sum | 110 | |
| 19 | Heap (Priority Queue) | 109 | |
| 20 | Simulation | 106 | |
| 21 | Design | 105 | |
| 22 | Counting | 95 | |
| 23 | Sliding Window | 94 | |
| 24 | Graph Theory | 93 | |
| 25 | Backtracking | 78 | |
| 26 | Linked List | 69 | |
| 27 | Enumeration | 62 | |
| 28 | Union-Find | 56 | |
| 29 | Monotonic Stack | 42 | |
| 30 | Divide and Conquer | 41 | |
| 31 | Trie | 40 | |
| 32 | Recursion | 40 | |
| 33 | Ordered Set | 38 | |
| 34 | Binary Search Tree | 34 | |
| 35 | Number Theory | 32 | |
| 36 | Memoization | 30 | |
| 37 | Queue | 30 | |
| 38 | Segment Tree | 29 | |
| 39 | Bitmask | 29 | |
| 40 | Geometry | 26 | |
| 41 | Combinatorics | 25 | |
| 42 | Hash Function | 25 | |
| 43 | Binary Indexed Tree | 22 | |
| 44 | Topological Sort | 21 | |
| 45 | String Matching | 20 | |
| 46 | Rolling Hash | 18 | |
| 47 | Shortest Path | 18 | |
| 48 | Interactive | 16 | |
| 49 | Game Theory | 16 | |
| 50 | Data Stream | 14 | |
| 51 | Doubly-Linked List | 12 | |
| 52 | Merge Sort | 10 | |
| 53 | Randomized | 10 | |
| 54 | Iterator | 9 | |
| 55 | Monotonic Queue | 8 | |
| 56 | Brainteaser | 7 | |
| 57 | Concurrency | 7 | |
| 58 | Counting Sort | 7 | |
| 59 | Bucket Sort | 6 | |
| 60 | Reservoir Sampling | 4 | |
| 61 | Sweep Line | 4 | |
| 62 | Suffix Array | 4 | |
| 63 | Shell | 4 | |
| 64 | Quickselect | 4 | |
| 65 | Probability and Statistics | 3 | |
| 66 | Minimum Spanning Tree | 3 | |
| 67 | Radix Sort | 2 | |
| 68 | Eulerian Circuit | 2 | |
| 69 | Rejection Sampling | 1 | |
| 70 | Biconnected Component | 1 | |
| 71 | Strongly Connected Component | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Minimum K to Reduce Array Within Limit | Visit | Medium | |
| 2 | Find Nth Smallest Integer With K One Bits | Visit | Hard | |
| 3 | Design Auction System | Visit | Medium | |
| 4 | Count Caesar Cipher Pairs | Visit | Medium | |
| 5 | Count Residue Prefixes | 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 2258 questions for free!
Log In