See the 30 Goldman Sachs LeetCode interview questions most likely to appear in 2026, plus patterns, timing targets, and OA vs. Superday prep.
Common Goldman Sachs LeetCode Interview Questions: 30 Most Asked (2026)
Goldman Sachs coding interviews are pattern-heavy, medium-skewed, and more structured than most candidates expect. An analysis of 325 real Goldman Sachs questions shows the difficulty split clearly: 24% easy, 63% medium, 13% hard. The pass rate sits around 5–10%. If you're preparing for Goldman Sachs leetcode interview questions in 2026, the path forward isn't grinding random problems — it's knowing which patterns recur, how the interview stages differ by seniority, and what "good" looks like under a timer.
This post covers the interview structure, the dominant patterns, 30 specific problems worth your time, and how to practice in a way that actually transfers to a live session.
How Goldman Sachs structures its coding interview
The process varies meaningfully between new grads and experienced hires.
Online assessment (OA)
The first gate. Goldman typically uses HackerRank or a similar platform. Expect 2–3 timed coding problems. Difficulty leans easy-to-medium. Arrays, strings, and hashing dominate at this stage. The OA is a filter — it's not where the hard problems live.
For new grads, the OA usually has 2 questions. Experienced-hire OAs tend to have 3. One candidate's SDE2 OA included three coding problems on HackerRank before advancing to live rounds.
Live coding rounds (CoderPad / Superday)
After the OA, you move to live coding — typically on CoderPad with an interviewer present. Each round has one or two problems. The interviewer is watching how you think, not just whether you get the right answer. Solving quietly is a red flag. Interviewers expect you to talk through your approach, your tradeoffs, and your reasoning as you go.
For freshers, this is usually 1–2 DSA rounds. For experienced hires, the Superday can include 3+ consecutive rounds back-to-back.
What changes for experienced hires (SDE2+)
If you have 3+ years of experience, Goldman doesn't just test DSA. The Superday adds system design (HLD and LLD), concurrency and thread pools, database internals (SQL vs. NoSQL, CAP theorem, ACID), and engineering workflow questions around Git flow, Kubernetes, and Kafka.
DSA is still present — but it's weighted alongside backend judgment. One SDE2 candidate reported rounds covering graph traversal, concurrency, LLD for an e-commerce system, and database design, all in the same Superday.
Goldman Sachs LeetCode interview questions by pattern
The 325-question dataset breaks down by data structure: arrays appear in 59% of questions, strings in 30%, hash tables in 26%, and dynamic programming in 23%. Those four categories cover the vast majority of what Goldman asks. Here's what each pattern looks like in practice.
Arrays and two pointers
- Representative problems: Two Sum, Container With Most Water, Trapping Rain Water
- Why it appears: Arrays show up in 59% of the question corpus. Goldman uses them to test in-place manipulation, index reasoning, and whether you can optimize beyond brute force.
Strings and sliding window
- Representative problems: Longest Substring Without Repeating Characters, Palindrome With One Removal, Restore IP Addresses
- Why it appears: String manipulation accounts for 30% of verified questions. Sliding window is the dominant technique here — it tests your ability to maintain state across a moving range efficiently.
Hash tables and frequency counting
- Representative problems: Design HashMap, Transaction Segments, Group Anagrams
- Why it appears: Hash tables appear in 26% of Goldman's questions. Fast lookup is a recurring optimization ask, and Design HashMap has appeared as a real OA question.
Dynamic programming
- Representative problems: House Robber, Coin Change, Unique Paths
- Why it appears: DP makes up 23% of the corpus. Goldman tests optimization thinking — whether you can identify overlapping subproblems and build a recurrence — not just whether you've memorized the solution to House Robber.
Graphs and trees
- Representative problems: Number of Islands, Process-Kill Tree Traversal, BFS/DFS variants
- Why it appears: Graph problems surface in later rounds, especially during Superday. They test structured traversal, edge-case handling, and whether you can reason about connected components under pressure. The process-kill tree traversal has appeared in multiple verified candidate reports.
Bit manipulation and math
- Representative problems: Repeating Decimal Fractions, Power of Two, Single Number
- Why it appears: These show up in harder rounds and signal mathematical reasoning beyond standard DSA. Repeating decimal fractions appeared in a real Goldman interview alongside graph theory and DP.
30 most asked Goldman Sachs LeetCode interview questions
These are drawn from verified candidate reports and question-set analysis. They're grouped by difficulty — start with the tier that matches your current level, but spend most of your time on medium.
Easy
- Two Sum
- Valid Parentheses
- Reverse Linked List
- Merge Two Sorted Lists
- Best Time to Buy and Sell Stock
- Design HashMap
- Single Number
- Climbing Stairs
Medium
- Longest Substring Without Repeating Characters
- 3Sum
- Container With Most Water
- Group Anagrams
- Product of Array Except Self
- Find Minimum in Rotated Sorted Array
- Number of Islands
- House Robber
- Coin Change
- Word Break
- Restore IP Addresses
- Palindrome With One Removal
- Efficient Tasks
- Transaction Segments
- LRU Cache
- Course Schedule
Hard
- Trapping Rain Water
- Median of Two Sorted Arrays
- Word Ladder II
- Process-Kill Tree Traversal
- Repeating Decimal Fractions
- Serialize and Deserialize Binary Tree
Medium problems are the highest-ROI focus. They represent 63% of what Goldman asks. Hard problems appear mainly in later Superday rounds and vary by role — if you're a new grad, you're unlikely to see more than one.
Fresher vs. experienced: what the interview looks like in practice
New grad / fresher track
The typical path: OA (2 problems) → 1–2 live DSA rounds. SDE Round 1 usually has one or two coding problems, often easy-to-medium, focused on arrays, strings, hashing, or simple data structures.
Timing targets matter here. Easy problems: aim for under 10 minutes. Medium problems: under 25 minutes. If you're consistently over those marks in practice, you're not ready for the real thing yet.
Communication isn't optional either. Solving a problem silently is a red flag in Goldman interviews. Interviewers expect you to talk through your implementation — your approach, why you're choosing a particular data structure, what edge cases you're considering. Practice this out loud, not just in your head.
Experienced hire (SDE2+) track
The path is longer and broader: OA (3 problems) → CoderPad round → Superday (3+ rounds).
The Superday is where it gets serious. Beyond DSA, expect rounds on concurrency and thread pools, graph traversal, LLD/HLD for real systems (e-commerce, distributed caches), SQL vs. NoSQL tradeoffs, CAP theorem, ACID properties, and engineering tooling like Kubernetes and Kafka.
Prep emphasis shifts accordingly. You still need graphs, backtracking, and string manipulation. But you also need synchronization primitives, system design fundamentals, and the ability to discuss database internals with confidence. One SDE2 candidate's Superday covered palindrome removal, restore IP addresses, Number of Islands, process-kill tree traversal, concurrency, LLD/HLD, Git flow, and database design — all in one day.
How to prepare for Goldman Sachs LeetCode interview questions
Cover patterns, not random problems
Fifteen to twenty reusable patterns cover the majority of what Goldman asks. Pattern recognition beats memorizing individual solutions. Prioritize these: two pointers, sliding window, hash maps, BFS/DFS, DP (knapsack and sequence variants), and binary search.
The 325-question dataset backs this up. Arrays, strings, hash tables, and DP account for the bulk of the corpus. If you can recognize which pattern a problem maps to within the first two minutes, you're already ahead of most candidates.
Practice under timed, realistic conditions
Set a timer. Easy problems: under 10 minutes. Medium: under 25 minutes. If you can't solve it within the window, mark it and come back — don't spend an hour on one problem and call it practice.
Simulate a live coding environment. Use CoderPad or a plain editor, not your IDE with autocomplete. Talk through your approach before writing code. This is the single most common gap between candidates who know the material and candidates who pass the interview.
Use mock interviews to close the gap
Pattern knowledge alone doesn't prepare you for the pressure of a live session. The gap between solving a problem at your desk and solving it while someone watches you think is real — and it's where most candidates lose points they shouldn't.
Verve AI's mock interviews simulate Goldman Sachs-style coding rounds with real-time feedback, so the first time you feel that pressure isn't during the actual interview. And if you want support during the live round itself, the Interview Copilot listens to the conversation and suggests approaches in real time — invisible to the interviewer. Try it free.
The short version
Goldman Sachs coding interviews are winnable with focused pattern prep, realistic timing practice, and deliberate communication work. The 30 questions above cover the core of what the data shows. Start with medium-difficulty arrays and strings, layer in DP and graphs, and simulate the live environment before your actual round. The bar is high — but it's predictable. That's the advantage.
Verve AI
Archive