Katkat

Company

Goldman Sachs interview questions

35 practice questions in the style of Goldman Sachs's interviews, covering Behavioral & Leadership, Statistics & Math, Software Engineering Fundamentals, Coding & Algorithms, System Design, Machine Learning, Product / Decision Making.

Questions35

10 easy23 medium2 hard

Your progress0/35

Goldman Sachs interview questions by the numbers

Last updated

Katkat has 35 Goldman Sachs interview questions. The largest topics are Coding & Algorithms (40%), Statistics & Math (20%) and Behavioral & Leadership (17%). By difficulty: 29% easy, 66% medium and 6% hard. The most common round is Onsite (37%). Frequent concepts include Graphs, Linear Algebra, matrix and Strings.

Difficulty

  • Easy29% · 10
  • Medium66% · 23
  • Hard6% · 2

Interview rounds

  • Onsite37% · 13
  • Technical Screen34% · 12
  • Online Assessment29% · 10

Roles

  • Software Engineer54% · 19
  • Data Scientist17% · 6
  • Product Manager11% · 4
  • Quantitative Researcher11% · 4
  • Machine Learning Engineer6% · 2

Frequent concepts

  • Graphs6% · 2
  • Linear Algebra6% · 2
  • matrix6% · 2
  • Strings6% · 2
  • System Design6% · 2
  • Algorithms3% · 1

Showing 31–35 of 35 results

  • Tests the ability to search efficiently in a 2D grid sorted along both dimensions by exploiting boundary invariants to achieve an O(m + n) time complexity.

    Goldman SachsSoftware EngineerCoding & AlgorithmsOnsite
  • A skip-level manager behavioral round that probes a commitment-to-delivery mindset, asks for a walkthrough of a significant past project, and focuses on how the candidate works with product and engineering managers and tracks and follows through on SLAs. It tests ownership, stakeholder management and reliability.

    Goldman SachsSoftware EngineerBehavioral & LeadershipOnsite
  • This problem tests your ability to manipulate strings, utilize hash maps for grouping data, and perform iterative simulations based on sequential command logs.

    Goldman SachsSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates proficiency in string manipulation and hash-based aggregation, specifically skills such as frequency counting, map/dictionary usage, and numeric aggregation for averages.

    Goldman SachsSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Given the heights of adjacent unit-width bars in an elevation profile, compute the total amount of rainwater that stays trapped between them after rain, with water spilling off both open ends. The coding problem tests reasoning about the bars that bound each position and handling up to 100,000 bars efficiently.

    Goldman SachsQuantitative ResearcherCoding & AlgorithmsTechnical Screen

Goldman Sachs interview experiences

All 3 →
  • Two Phone Screens, Handwritten Onsite Code, Verbal OfferGoldman Sachs · Software Engineer · Onsite · Oct 2026
    Offer

    A recruiter reached out to me and kept checking whether I minded being in the office 5 days a week (I told them several times that Amazon is 5 days too, so I'm hardly in a position to mind). First there was a 40 minute screening: write 2 SQL queries and fix a Java Spring API (I honestly could not figure out why the last two tests were failing). Camera on and screen recording the whole time. I loo…

  • Two GSAM Quant Roles, Live Coding Plus TSP, Then No HeadcountGoldman Sachs · Quantitative Researcher · Onsite · Sep 2026

    I interviewed for two GSAM quant roles at the same time. Role one was more like a fund of funds kind of group. First round was live coding: power of ten and Newton's method square root. Second round was already the final round on-site: one medium problem that was not the usual kind, one expected value problem, and one round that was purely chatting about my experience. Role two was the equity SMA…

  • Two-Hour Online Assessment with Two ProblemsGoldman Sachs · Software Engineer · Online Assessment · Dec 2025

    2 hours to solve two problems: Transaction Segments Given an array transactionValues of length n, where transactionValues[i] is the transaction amount at time i. Count the number of contiguous subarrays that are strictly increasing and have length exactly k. Strictly increasing means: transactionValues[i]

More companies