Goldman-Sachs Questions
Here are the LeetCode questions for Goldman-Sachs.
Total: 301
Easy: 58
Medium: 189
Hard: 54
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 167 | |
| 2 | String | 76 | |
| 3 | Dynamic Programming | 60 | |
| 4 | Hash Table | 59 | |
| 5 | Math | 50 | |
| 6 | Sorting | 45 | |
| 7 | Two Pointers | 39 | |
| 8 | Greedy | 34 | |
| 9 | Depth-First Search | 29 | |
| 10 | Matrix | 29 | |
| 11 | Stack | 28 | |
| 12 | Binary Search | 27 | |
| 13 | Breadth-First Search | 27 | |
| 14 | Heap (Priority Queue) | 19 | |
| 15 | Tree | 16 | |
| 16 | Linked List | 14 | |
| 17 | Bit Manipulation | 14 | |
| 18 | Binary Tree | 14 | |
| 19 | Backtracking | 13 | |
| 20 | Monotonic Stack | 13 | |
| 21 | Simulation | 13 | |
| 22 | Prefix Sum | 12 | |
| 23 | Divide and Conquer | 11 | |
| 24 | Graph Theory | 11 | |
| 25 | Recursion | 11 | |
| 26 | Design | 10 | |
| 27 | Sliding Window | 10 | |
| 28 | Counting | 10 | |
| 29 | Trie | 9 | |
| 30 | Union-Find | 7 | |
| 31 | Database | 6 | |
| 32 | Enumeration | 6 | |
| 33 | Ordered Set | 5 | |
| 34 | Binary Search Tree | 4 | |
| 35 | Queue | 4 | |
| 36 | Game Theory | 4 | |
| 37 | Bitmask | 4 | |
| 38 | Binary Indexed Tree | 3 | |
| 39 | Segment Tree | 3 | |
| 40 | Memoization | 3 | |
| 41 | Geometry | 3 | |
| 42 | Shortest Path | 3 | |
| 43 | Topological Sort | 2 | |
| 44 | Merge Sort | 2 | |
| 45 | Doubly-Linked List | 2 | |
| 46 | Interactive | 2 | |
| 47 | Bucket Sort | 2 | |
| 48 | Number Theory | 2 | |
| 49 | Quickselect | 2 | |
| 50 | Brainteaser | 1 | |
| 51 | Sweep Line | 1 | |
| 52 | Rolling Hash | 1 | |
| 53 | Suffix Array | 1 | |
| 54 | Concurrency | 1 | |
| 55 | Combinatorics | 1 | |
| 56 | Data Stream | 1 | |
| 57 | Hash Function | 1 | |
| 58 | Monotonic Queue | 1 | |
| 59 | Eulerian Circuit | 1 | |
| 60 | Randomized | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Number of Perfect Pairs | Visit | Medium | |
| 2 | Find the Minimum Amount of Time to Brew Potions | Visit | Medium | |
| 3 | Permutations III | Visit | Medium | |
| 4 | Identify the Largest Outlier in an Array | Visit | Medium | |
| 5 | Minimum Number of Chairs in a Waiting Room | 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 301 questions for free!
Log InFrequently Asked Questions
Common questions about Goldman-Sachs interviews