Goldman Sachs Software Engineer interviews typically run 3–5 rounds: online assessment, CoderPad/HackerRank coding screen, HireVue or recruiter call, and a SuperDay with DSA, system design, and hiring manager rounds. The process spans roughly 2–5 months and is distinguished by a SuperDay format combining technical depth with heavy resume and behavioral scrutiny.
$119K
Avg. Base Comp
$174K
Avg. Total Comp
4-6
Typical Rounds
4-20 weeks
Process Length
What strikes us most across these twelve Goldman Sachs software engineer experiences is how consistently the SuperDay format separates candidates who get offers from those who don't. Almost every candidate who advanced past the initial CoderPad screen ended up in a multi-round SuperDay, and the outcomes clustered heavily around performance in that single day. The candidates who received offers described those rounds as feeling like a "conversation" or a "chat" — not because the content was easy, but because they were prepared enough to stay relaxed under pressure. The ones who didn't get offers often cited the breadth of the SuperDay as the real challenge: DSA, low-level system design, SDLC, and a deep resume walkthrough all in the same loop.
A recurring theme we see is that Goldman's interviewers are unusually focused on resume depth and project defensibility. Multiple candidates reported that every line of their CV was fair game — not just a warm-up, but a genuine technical interrogation. One candidate described the SDLC round as going "very deep into every detail" of their background, and another noted that the behavioral portions felt like they were checking whether you actually did what you claimed. This is different from firms where the resume discussion is a formality before the real coding begins. At Goldman, the two are weighted almost equally in the SuperDay.
On the technical side, the coding questions themselves are mostly LeetCode medium difficulty — Trapping Rain Water, Merge Intervals, linked list cycles, BFS/DFS traversals — but the real differentiator is whether you can explain complexity tradeoffs and optimize on the fly while talking. We've also seen a surprising number of candidates encounter low-level design questions like Chess Board or TinyURL rather than broad system architecture, which catches people off guard if they've only prepared for distributed systems discussions. Java internals — HashMap vs. HashSet, TreeSet, static keyword behavior — came up across multiple independent experiences, suggesting this is a consistent signal Goldman looks for in engineering candidates with a Java background.
Synthetized from 12 candidates reports by our editorial team.
Had an interview recently?
Share your experience. Unlock the full guide.
Real interview reports from people who went through the Goldman Sachs process.
I went through a fairly standard Goldman Sachs software engineer process that started with an HR screening call, then moved into technical rounds, and ended with a final conversation with the hiring manager. The early stage was mostly a quick screening to confirm background and fit. After that, the technical interviews were split across HackerRank or CoderPad-style coding rounds and a virtual panel/final round. In my case, the coding rounds ranged from easy to hard and included both algorithm questions and some design-oriented prompts, so it wasn’t just pure LeetCode-style problem solving.
The coding questions were mostly straightforward but varied in difficulty. One round had a hard and an easy HackerRank question, while another had two medium LeetCode-style questions. I also saw a very practical coding prompt about calculating the average of student marks using hash maps, and another easy one about merging two sorted arrays. There were also rounds that moved beyond coding into low-level system design and architecture discussion, which was a bit unexpected if you were only preparing for algorithms. On the design side, I was asked to make classes and to work through a TinyURL-style system design question. The SDLC portion came up too, along with questions about past experience and situational judgment.
What stood out most was how much they dug into my resume and prior projects. In the behavioral parts, almost every detail on the CV was fair game, so I had to be ready to explain decisions, tradeoffs, and what I actually did on each project. The final hiring manager conversation felt more like a chat than a formal interview, but it still covered experience and fit. Overall, the process felt moderate to hard depending on the round, with the toughest parts being the algorithm questions under time pressure and the surprise architecture/system design discussion. I’d recommend preparing both coding practice and a very detailed walkthrough of your resume, since both came up heavily.
Prep tip from this candidate
Be ready for a mix of HackerRank/CoderPad coding and resume deep-dives, since the interviews repeatedly combined algorithms with detailed questions about past experience. Also prepare for at least one low-level or small system design prompt like TinyURL or class design, because that showed up alongside the coding rounds.
Share your own interview experience to unlock all reports, or subscribe for full access.
Sourced from candidate reports and verified by our team.
Topics based on recent interview experiences.
Featured question at Goldman Sachs
This problem involves finding the first non-repeating character in a given string. The solution involves iterating over the string and keeping track of the frequency of each character. The first character that has a frequency of 1 is the first non-repeating character.
| Question | |
|---|---|
| Level Of Rain Water In 2D Terrain | |
| Append Frequency | |
| Cyclic Detection | |
| Minimum Absolute Distance | |
| Target Indices | |
| Portfolio Platform Architecture | |
| How Many Friends | |
| Messenger Service Design | |
| Optimistic vs Pessimistic Locking | |
| Impossibly Iterative Fibonacci | |
| LRU Cache 1 | |
| 2nd Highest Salary | |
| Merge Sorted Lists | |
| Empty Neighborhoods | |
| Top Three Salaries | |
| Subscription Overlap | |
| Find the Missing Number | |
| Maximum Profit | |
| Prime to N | |
| Rolling Bank Transactions | |
| Comments Histogram | |
| Employee Salaries | |
| String Shift | |
| Random SQL Sample | |
| Closest SAT Scores | |
| Hurdles In Data Projects | |
| Rectangle Overlap | |
| Slacking Employees Salaries | |
| P-value to a Layman |
Synthesized from candidate reports. Individual experiences may vary.
Candidates complete a HackerRank or similar online coding assessment with easy-to-medium LeetCode-style questions, sometimes accompanied by technical multiple choice questions or an aptitude test with negative marking. This is typically the first filter in the process.
A recorded or live behavioral round focused on resume walkthrough, motivation for the role and division, and communication of technical concepts. Questions include explaining recursion, how you would test something, and how you handle team scenarios.
A brief call with a recruiter to confirm background, availability, and preferred programming language, and to walk through the next steps in the process.
A live coding interview on CoderPad with one to three LeetCode-style problems ranging from easy to medium difficulty, covering topics like hashmaps, BFS/DFS, arrays, and string manipulation. The interviewer often mixes in light resume discussion and expects candidates to explain their approach and complexity as they code.
The main evaluation stage consisting of three to six back-to-back rounds covering DSA and coding, system design (both high-level and low-level), SDLC and software engineering practices, and a deep resume and behavioral discussion. Coding problems range from medium to hard, and design prompts include topics like TinyURL, parking systems, chess board design, and high-frequency transaction processing.
A closing conversation with a hiring manager or Managing Director that is more conversational in tone, covering past experience, fit, and behavioral questions. This round is less technically intensive but still involves resume depth and situational judgment.