← Back to Directory

Goldman Sachs

Large Enterprises

Screna has 12 Goldman Sachs interview write-ups. The most reported round is the technical phone screen (10).

12 interview notes · updated Jun 2026

Goldman Sachs·Software Engineer·Technical Phone Screen

Jun 2026
Goldman Sachs SWE interview with a fraud systems coding problem. Pretty focused on the design choices behind the data structure, not just getting a working solution.
  • You're extending a fraud rules engine to support a sliding 60-minute window velocity check. Reject any transaction where the user's approved transaction total over the past hour plus the new transaction amount would exceed $5000. Walk through your data structure choice and the time complexity per check.

“I went with a per-user deque of (timestamp, amount) pairs.”

View Post

Goldman Sachs·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Goldman Sachs software engineer interview with a coding round focused on the group anagrams problem. The discussion went deeper than just getting a working solution, they wanted complexity analysis and a comparison of two different approaches.
  • Given an array of strings, group all anagrams together and return the groups in any order. Then walk through the sorted-key hash map approach versus a character-count key approach and compare their time and space complexities.

“I started with the sorted key approach because it's the one I actually remember clearly: sort each string, use that as the map key, O(n * k log k) total.”

View Post

Goldman Sachs·Software Engineer·Technical Phone Screen

Jun 2026
Goldman Sachs SWE interview with a classic sliding window problem. Nothing too crazy but the follow-up asking you to return the actual substring tripped me up a bit since I'd only rehearsed the length version.
  • Given a string, find the length of the longest substring with no repeating characters. Follow-up: return the actual substring, not just its length. Walk through edge cases like an empty string, all identical characters, or all unique characters.

“I had the sliding window approach down pretty cold, hash map tracking last-seen index, O(n), the whole thing.”

View Post

Goldman Sachs·Software Engineer·Technical Phone Screen

Jun 2026
Goldman Sachs software engineer interview with a coding round focused on grid simulation and system design thinking. The follow-up on extensibility was where things got interesting.
  • Given a string of direction commands like 'U', 'D', 'L', 'R', simulate a robot moving on a 2D grid using a switch/case approach and return the final position or full path.
  • How would you handle mixed-case input like 'u', 'D', 'l', 'R' before dispatching commands?
  • If you needed to support many more commands beyond the basic four directions, how would you redesign away from a large switch statement?

“Felt pretty comfortable here.”

View Post

Goldman Sachs·Software Engineer·Technical Phone Screen

May 2026
Goldman Sachs SWE coding round, one meaty question about extending a fraud rules engine with MCC blocklists. More design-heavy than I expected for what looked like a pure coding problem.
  • You have a fraud rules engine that evaluates transactions. Extend it to reject any transaction whose merchant category code (MCC) appears in a global blocklist, and also reject transactions where the MCC appears in a per-user blocklist (keyed by user ID). The function signature should stay the same, and the design should be extensible for future rule types.

“I spent the first few minutes just coding the lookup logic and almost missed the whole point.”

View Post

Goldman Sachs·Software Engineer·Technical Phone Screen

Apr 2026
Goldman Sachs SWE interview that centered on a transaction approval system built incrementally, starting simple and layering on complexity as follow-ups. The design angle was the real test, not the initial logic.
  • Write a function that approves or rejects a transaction based on its merchant category code. Start with a single rule (reject if MCC is 9999, approve otherwise), but structure it so additional rules like blocklists and velocity checks can be added later without rewriting everything.

“The first part is trivial, literally one if-statement.”

View Post

Goldman Sachs·Software Engineer·Technical Phone Screen

Apr 2026
Goldman Sachs SWE interview had at least one probability question that felt more like a math exam than anything coding-related. Wasn't expecting to be doing calculus on a double-sided exponential distribution.
  • Given a random variable X with PDF f(x) = 0.5 * e^(-|x|) defined over all real numbers, compute P(2 ≤ |X| ≤ 4) rounded to three decimal places. Options were 0.117, 0.018, 0.135, or 0.068.

“Blanked for a second because I kept second-guessing whether to integrate from -4 to -2 and 2 to 4 separately or use symmetry.”

View Post

Goldman Sachs·Software Engineer·Technical Phone Screen

Apr 2026
Goldman Sachs SWE interview that went pretty deep on data structures fundamentals. They had me implement a HashMap from scratch and then pushed on the design decisions behind it, not just the code.
  • Implement a HashMap class from scratch without using any built-in hash table libraries, including put, get, and remove operations. Then walk through your bucket structure, hash function choice, load factor, and how you'd handle resizing.

“Started with the array of linked lists approach which felt right, but the part that tripped me up was when they asked about resizing.”

View Post

Goldman Sachs·Software Engineer·Technical Phone Screen

Apr 2026
Technical screen for a quant engineer role at Goldman, two parts back to back. First half was conceptual, second half was live coding and it got weird fast.
  • Walk through the main methods for sampling from a target probability distribution. What are the trade-offs and when would you actually use each one?
  • Write a sampler on the spot for a biased random walk on a manifold like a sphere or torus. How do you parameterize positions, propose steps that stay tangent to the surface, apply a bias toward a target region, and handle accept/reject?

“This part went fine.”

View Post

Goldman Sachs·Software Engineer·Technical Phone Screen

Apr 2026
Quant Engineer interview at Goldman Sachs, grid DP problem that looked straightforward on the surface but had a real follow-up bite to it around space optimization.
  • Given an m by n grid of non-negative integers, find the path from top-left to bottom-right that minimizes the total sum, moving only right or down. Return the minimum sum, and then discuss how you'd optimize space beyond the basic O(m*n) DP table.

“Got the core DP solution out without too much trouble, filled the table left to right top to bottom, standard recurrence.”

View Post