Learn from real Goldman Sachs placement interview experiences shared by candidates who cleared the placement process. Goldman Sachs has a unique interview process combining technical skills with finance understanding.
Round-wise process
Stage
Duration
What candidates report
HireVue (First Interview)
~30 min
Recorded behavioral prompts; division motivation
HackerRank OA (engineering)
60–120 min
2–3 medium coding problems + aptitude MCQs
Phone / CoderPad screen
45–60 min
Live coding, resume deep-dive, light finance
Superday
2–5 × 30–60 min
Repeated coding + behavioral + hiring-manager fit
Pre-interview checklist (Goldman Sachs)
Record yourself answering five HireVue-style prompts with a timer (30s read / 2m answer)
HackerRank: two mediums under time plus 10 aptitude MCQs for warm-up
CoderPad practice: narrate while typing; expect follow-ups on complexity and tests
Prepare markets 101 (order book, option definition) for at least one round
Superday: sleep, hydration, and identical short answers to “Why GS?” in every room
Interview experience 1: analyst/engineer role (2025)
What decided it: Goldman Sachs values problem-solving, basic finance understanding, and clear communication. Prepare for both technical and finance-related questions.
Common fail: Brute-force OA or freezing on markets basics
How to practise: Timed HackerRank mediums; HireVue recordings; markets 101 flashcards
Recruiter email with HackerRank link after expression of interest.
Recorded behavioral prompts similar to Superday themes (pressure, teamwork) - treated as pass/fail before live coding.
Round 1 – HackerRank OA
Two problems: modular arithmetic (easy) and array/combinatorics (medium); both fully solved in candidate report.
Round 2 – CoderPad with engineer
Max IP count from logs with follow-up edge cases.
Grid DP counting paths with maximum value - classic tabulation pattern.
Stumbled slightly on one follow-up but explained reasoning.
Round 3 – Superday subset (virtual panel)
Median of two sorted arrays - discussed brute force then binary search approach.
Longest substring without repeating characters - sliding window with complexity analysis.
Panel ended process after this Superday slice (not all candidates get full five interviews).
Result: Not shortlisted for further Superday rounds
Takeaways
What decided it: Clearing OA and one CoderPad is not enough - Superday expects optimal approaches explained calmly, and partial progress on follow-ups can still fail the bar.
Common fail: Brute-force OA or freezing on markets basics
How to practise: Timed HackerRank mediums; HireVue recordings; markets 101 flashcards
Profile: Bengaluru, fresh grad, solved both OA DSA problems correctly
Process
OA: First non-repeating character (brute + optimal) and Trapping Rain Water (brute force only under time pressure).
No further rounds despite both bases passing - candidate report emphasises GS selects heavily at each gate.
Result: Rejected after OA
Takeaways
What decided it:Correct brute force may not suffice if the bar expects optimal complexity or faster implementation; practice stating and coding the optimised path within the same timer.
Common fail: Brute-force OA or freezing on markets basics
How to practise: Timed HackerRank mediums; HireVue recordings; markets 101 flashcards
Interview experience 5: Associate, DSA + system design mix (interviewexperiences.in, Aug 2025 Bengaluru)
Profile: Experienced hire loop, offer reported
Technical highlights
Fraction to recurring decimal string parsing with cycle detection.
Basic calculator with parentheses - stack-based evaluation.
2D grid max path with diagonal/down/right moves - recursion then DP optimisation.
Store visit log query design with follow-ups on DB vs in-memory trade-offs.
Design Twitter split LLD (User/Tweet/Follow models) and HLD (fan-out, queues, Kafka for notifications).
Behavioral
Standard partnership and integrity prompts woven into long technical sessions.
Result: Offer (Bengaluru)
Takeaways
What decided it: Lateral loops add implementation-heavy strings/math plus LLD/HLD in one day - budget energy for both, not only LeetCode arrays.
Common fail: Brute-force OA or freezing on markets basics
How to practise: Timed HackerRank mediums; HireVue recordings; markets 101 flashcards
After technical rounds, Goldman Sachs usually closes with a short HR / hiring-manager conversation: motivation, location, notice period, and a couple of behavioural stories. Prepare those answers on the dedicated page rather than cramming them into this hub.
Sample answers for high-frequency questions
Use these as frames, not scripts - interviewers probe follow-ups.
Q. How do you solve Best Time to Buy and Sell Stock with multiple transactions? A. When unlimited transactions are allowed, the answer is the sum of every positive consecutive difference: for each day i, if price[i] is greater than price[i-1], add the difference. This valley-peak greedy is O(n) time and O(1) space, and it is provably optimal because any multi-day gain decomposes into consecutive daily gains. The single-transaction variant instead tracks the minimum price seen so far and the best profit measured against it, also O(n). The at-most-k-transactions variant needs DP over buy[j] and sell[j] states for j from 1 to k, giving O(nk) time.
Q. How do you find the median from a data stream? A. Maintain two heaps: a max-heap holding the lower half of the values and a min-heap holding the upper half. On each insert, push into one heap and then rebalance so their sizes differ by at most one, moving the offending root across. The median is the root of the larger heap, or the average of the two roots when the sizes are equal. Insertion costs O(log n) and reading the median is O(1). A common follow-up asks what changes if the values are bounded small integers - then a counting array with a running prefix, or an order-statistic tree, becomes the better structure.
Q. How do you implement an LRU cache? A. Combine a hash map with a doubly linked list. The map gives O(1) lookup from key to node, and the list keeps nodes in recency order with the most recently used at the head. On get, move the node to the head; on put, insert at the head and, if capacity is exceeded, remove the tail node and delete its key from the map. Using sentinel head and tail nodes removes the null-pointer edge cases. Both operations are O(1). In Java you can shortcut with LinkedHashMap in access order and an overridden removeEldestEntry, but interviewers usually want the manual construction.
Q. How does topological sort solve the Course Schedule problem? A. Model courses as nodes and prerequisites as directed edges, then run Kahn’s algorithm: compute in-degrees, enqueue every node with in-degree zero, and repeatedly pop a node, append it to the order, and decrement its neighbours’ in-degrees, enqueuing any that reach zero. If the resulting order holds fewer nodes than the graph has, a cycle exists and the schedule is impossible. Complexity is O(V + E) time and O(V) space. The DFS alternative colours nodes white, grey, and black, reports a cycle on reaching a grey node, and produces the order by reverse post-order.
Q. How would you design a rate limiter? A. The token bucket is the standard answer: a bucket holds up to N tokens, refills at a fixed rate, and each request consumes one token, being rejected with HTTP 429 when the bucket is empty. It permits short bursts up to the bucket size while capping the long-run rate, which is why public APIs favour it. Fixed-window counters are simpler but allow twice the limit through at a window boundary; a sliding-window log is exact but stores every timestamp; the sliding-window counter is the practical compromise. Distributed enforcement needs shared state in Redis with an atomic INCR-and-expire or a Lua script, so two nodes cannot both admit the same request.
Tips from successful candidates
Assessment tips
Confirm the current Goldman Sachs pattern from the drive mail before practising old papers
Finish one problem or section fully before starting the next
Revise the fundamentals listed in the round table on this page
Interview tips
Narrate trade-offs; expect “why” after every answer
Only list projects you can defend under follow-ups
Prepare 3-4 STAR stories for behavioural prompts
HR tips
Know why Goldman Sachs, not just why the industry
Be clear on location / notice period / higher studies
These links are research inputs we used to map round structure and recurring questions - not copied page mirrors. We reorganized reports into process tables, outcome notes, and prep takeaways for Goldman Sachs.
Cross-check the current drive mail or careers posting for timings and pattern changes.
