Google Questions
Here are the LeetCode questions for Google.
Total: 2343
Easy: 612
Medium: 1223
Hard: 508
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 1159 | |
| 2 | String | 528 | |
| 3 | Hash Table | 465 | |
| 4 | Dynamic Programming | 370 | |
| 5 | Math | 353 | |
| 6 | Sorting | 271 | |
| 7 | Greedy | 237 | |
| 8 | Depth-First Search | 220 | |
| 9 | Binary Search | 199 | |
| 10 | Tree | 172 | |
| 11 | Breadth-First Search | 164 | |
| 12 | Database | 163 | |
| 13 | Matrix | 161 | |
| 14 | Two Pointers | 159 | |
| 15 | Bit Manipulation | 151 | |
| 16 | Binary Tree | 136 | |
| 17 | Stack | 125 | |
| 18 | Prefix Sum | 119 | |
| 19 | Heap (Priority Queue) | 114 | |
| 20 | Simulation | 112 | |
| 21 | Design | 106 | |
| 22 | Sliding Window | 99 | |
| 23 | Counting | 99 | |
| 24 | Graph Theory | 96 | |
| 25 | Backtracking | 80 | |
| 26 | Linked List | 69 | |
| 27 | Enumeration | 69 | |
| 28 | Union-Find | 56 | |
| 29 | Monotonic Stack | 45 | |
| 30 | Divide and Conquer | 41 | |
| 31 | Recursion | 41 | |
| 32 | Ordered Set | 41 | |
| 33 | Trie | 40 | |
| 34 | Binary Search Tree | 34 | |
| 35 | Number Theory | 32 | |
| 36 | Memoization | 31 | |
| 37 | Queue | 31 | |
| 38 | Bitmask | 31 | |
| 39 | Segment Tree | 30 | |
| 40 | Combinatorics | 28 | |
| 41 | Geometry | 27 | |
| 42 | Hash Function | 26 | |
| 43 | Topological Sort | 23 | |
| 44 | Binary Indexed Tree | 23 | |
| 45 | String Matching | 21 | |
| 46 | Shortest Path | 20 | |
| 47 | Rolling Hash | 19 | |
| 48 | Interactive | 16 | |
| 49 | Game Theory | 16 | |
| 50 | Data Stream | 15 | |
| 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 | Power Update After K-th Largest Insertion I | Visit | Medium | |
| 2 | Count K-th Roots in a Range | Visit | Medium | |
| 3 | Longest Balanced Substring After One Swap | Visit | Medium | |
| 4 | Minimum Operations to Transform Array into Alternating Prime | Visit | Medium | |
| 5 | Traffic Signal Color | 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 2343 questions for free!
Log In