Goldman-sachs LeetCode Problems
11 most frequently asked LeetCode problems in Goldman-sachs technical interviews
Difficulty breakdown: 4 Easy, 6 Medium, 1 Hard
| Problem | DifficultyDiff | Action |
|---|---|---|
Trapping Rain Water 100% | HardH | Solve→ |
High Five 84% | EasyE | Solve→ |
Group Anagrams 77% | MediumM | Solve→ |
Fraction to Recurring Decimal 77% | MediumM | Solve→ |
First Unique Character in a String 77% | EasyE | Solve→ |
Design HashMap 77% | EasyE | Solve→ |
Two Sum 67% | EasyE | Solve→ |
Longest Substring Without Repeating Characters 67% | MediumM | Solve→ |
Kth Largest Element in an Array 67% | MediumM | Solve→ |
Open the Lock 67% | MediumM | Solve→ |
Maximum Sum Circular Subarray 67% | MediumM | Solve→ |