Goldman Sachs Interview Questions (261)
Practice real interview problems from Goldman Sachs
| Status | Title | Solution | Practice | Difficulty | Companies | Topics |
|---|---|---|---|---|---|---|
| 2714. Find Shortest Path with K Hops | Solution | Solve | Hard | Goldman Sachs | ||
| 2719. Count of Integers | Solution | Solve | Hard | Cisco+1 | ||
| 2734. Lexicographically Smallest String After Substring Operation | Solution | Solve | Medium | Agoda+3 | ||
| 3001. Minimum Moves to Capture The Queen | Solution | Solve | Medium | Goldman Sachs+1 | ||
| 3167. Better Compression of String | Solution | Solve | Medium | Goldman Sachs+1 | ||
| 3168. Minimum Number of Chairs in a Waiting Room | Solution | Solve | Easy | Amazon+2 | ||
| 3371. Identify the Largest Outlier in an Array | Solution | Solve | Medium | Amazon+3 | ||
| 3649. Number of Perfect Pairs | Solution | Solve | Medium | Atlassian+5 | ||
| 3494. Find the Minimum Amount of Time to Brew Potions | Solution | Solve | Medium | Amazon+5 | ||
| 3437. Permutations III | Solution | Solve | Medium | Goldman Sachs | ||
| 3885. Design Event Manager | Solution | Solve | Medium | Goldman Sachs |
About Goldman Sachs Coding Interviews
Goldman Sachs is known for building highly reliable financial systems that process enormous volumes of transactions every day. Because of this, their engineering interviews focus heavily on strong fundamentals in data structures, algorithms, and problem solving. Candidates are expected to write clean, efficient code and clearly explain their reasoning while solving problems.
The typical Goldman Sachs coding interview evaluates how well you understand core DSA concepts and how you apply them under time pressure. Interviewers often prefer practical algorithmic thinking over memorized solutions. Many problems resemble real production challenges such as handling large datasets, optimizing performance, and designing scalable logic.
Across real interview experiences, Goldman Sachs frequently asks problems involving:
- Arrays and Hash Maps for fast lookups and data processing
- Two pointers and sliding window for optimized array and string operations
- Binary search for performance-sensitive queries
- Trees and graphs for hierarchical and relationship-based data
- Dynamic programming for optimization problems
Difficulty is typically distributed across easy, medium, and challenging problems, with a strong emphasis on medium-level questions that test both coding ability and algorithmic intuition.
FleetCode helps you prepare efficiently with a curated set of 270 Goldman Sachs interview questions collected from real candidate experiences. Each problem is categorized by difficulty and topic, and includes solutions in Python, Java, and C++. Instead of guessing what to practice, you can focus directly on the patterns Goldman Sachs interviewers repeatedly test.
If you're targeting a role at Goldman Sachs, practicing these company-specific problems will significantly increase your confidence and readiness for the coding rounds.
Interview Tips for Goldman Sachs
Preparing for a Goldman Sachs coding interview requires a solid understanding of core data structures and the ability to communicate your thought process clearly. While the exact process may vary slightly by role and location, most candidates go through multiple technical rounds focused on problem solving.
Typical Goldman Sachs interview format:
- Online Assessment (OA): Usually 2–3 coding questions to solve within 60–90 minutes. These typically focus on arrays, strings, and hash maps.
- Technical Phone Screen: One or two algorithmic problems solved in a shared editor while explaining your approach.
- Onsite or Virtual Onsite: 3–4 rounds including coding interviews, discussion of past projects, and sometimes a system design round for experienced candidates.
Most common DSA topics asked at Goldman Sachs:
- Arrays, strings, and hash tables
- Two pointers and sliding window techniques
- Binary search and sorting-based problems
- Trees and graph traversal (BFS / DFS)
- Dynamic programming and recursion
Interviewers also pay close attention to code clarity and edge case handling. Even if you find the correct algorithm, failing to consider boundary conditions or writing messy code can impact your evaluation.
Common mistakes candidates make:
- Jumping into coding without discussing the approach
- Ignoring time and space complexity analysis
- Not testing the solution with sample edge cases
- Overcomplicating problems that have simple hash map or pointer solutions
Preparation strategy:
- Start with arrays, strings, and hash map patterns.
- Practice two-pointer and sliding window problems extensively.
- Move to trees, graphs, and dynamic programming.
- Simulate interviews by solving problems within 30–40 minutes.
Most candidates preparing seriously for Goldman Sachs spend 6–10 weeks practicing focused DSA problems. Working through a curated list of the most frequently asked questions—like the 270 Goldman Sachs problems on FleetCode—helps you focus on patterns that actually appear in interviews.