Goldman Sachs Coding Interview Questions

Showing 17 problems of 26

• #1easyfoundational

  1. Two Sum

  Two Sum is Goldman Sachs's most common phone-screen warm-up: given an integer array and a target, return the indices of the two numbers that add up to the target. Goldman uses it to confirm you can articulate the space-for-time tradeoff before writing any code.

  3 free resourcesSolve →
• #9easyfrequently asked

  9. Palindrome Number

  Given an integer x, return true if it reads the same forward and backward. Goldman Sachs uses Palindrome Number to test whether you can solve it without converting to a string — the math-only solution is the actual grade.

  2 free resourcesSolve →
• #13easyfrequently asked

  13. Roman to Integer

  Convert a Roman numeral string to its integer value. Goldman Sachs uses this as a 10-minute warm-up because it rewards candidates who notice the 'subtractive pair' insight before writing code — interviewers grade the verbal articulation as much as the implementation.

  2 free resourcesSolve →
• #21easyfoundational

  21. Merge Two Sorted Lists

  Merge two sorted linked lists into one sorted list. Goldman Sachs uses Merge Two Sorted Lists to test the dummy-node pattern — the canonical trick that simplifies head-handling and pointer rewiring.

  2 free resourcesSolve →
• #66easyfoundational

  66. Plus One

  Increment a non-negative integer represented as an array of digits by one. Goldman Sachs uses Plus One as a warm-up to verify you can handle carry propagation in-place — looks trivial until you hit [9,9,9].

  2 free resourcesSolve →
• #69easyfrequently asked

  69. Sqrt(x)

  Compute the integer part of sqrt(x) without using a built-in sqrt function. Goldman Sachs uses this to test whether you can implement binary search on the answer space — the fundamental quant interview skill.

  3 free resourcesSolve →
• #70easyfoundational

  70. Climbing Stairs

  You can climb 1 or 2 stairs at a time; how many ways to reach the top of n stairs? Goldman Sachs uses Climbing Stairs as a DP warm-up — they're grading whether you recognize the Fibonacci recurrence and the O(1) space trick.

  2 free resourcesSolve →
• #121easycompany favorite

  121. Best Time to Buy and Sell Stock

  Given an array of stock prices by day, find the maximum profit from a single buy-then-sell. As an investment bank, Goldman Sachs uses this exact problem framing in nearly every SWE and Strats loop — the answer is a single-pass O(n) with running minimum.

  3 free resourcesSolve →
• #136easyfrequently asked

  136. Single Number

  Every element appears twice except for one. Find the single one in O(1) extra space. Goldman Sachs uses Single Number to test the XOR brainteaser — recognizing that a XOR a = 0 is the entire insight.

  3 free resourcesSolve →
• #168easyfrequently asked

  168. Excel Sheet Column Title

  Given a positive integer, return its corresponding Excel column title (e.g. 28 → 'AB'). Goldman Sachs asks this immediately after Column Number to test whether you noticed why the inverse needs an n-1 correction — most candidates miss it.

  2 free resourcesSolve →
• #171easyfrequently asked

  171. Excel Sheet Column Number

  Convert an Excel column title like 'AB' to its column number (28). Goldman Sachs uses this base-26 conversion problem to confirm you can derive the closed-form arithmetic without Googling — a foundational skill for the trading-tools team.

  2 free resourcesSolve →
• #202easycompany favorite

  202. Happy Number

  A number is 'happy' if repeated sum-of-squares-of-digits eventually reaches 1; otherwise the chain enters a cycle. Goldman Sachs uses Happy Number to test cycle detection — the candidate who reaches for Floyd's tortoise-and-hare instead of a hash set earns the bonus point.

  3 free resourcesSolve →
• #206easyfoundational

  206. Reverse Linked List

  Reverse a singly linked list iteratively and recursively. Goldman Sachs uses Reverse Linked List as the canonical 'do you understand pointer manipulation' question — they ask for both the iterative and recursive versions in the same round.

  2 free resourcesSolve →
• #242easyfrequently asked

  242. Valid Anagram

  Given two strings, determine if one is an anagram of the other. Goldman Sachs uses Valid Anagram as a foundational hash-map question — the candidate who reaches for a 26-int frequency array instead of a generic hash map gets the small-constant credit.

  2 free resourcesSolve →
• #283easyfrequently asked

  283. Move Zeroes

  Move all zeros to the end of an array while keeping non-zero element order, in-place. Goldman Sachs uses Move Zeroes to test the two-pointer in-place pattern — the candidate who avoids the extra-array detour gets the credit.

  2 free resourcesSolve →
• #326easyfrequently asked

  326. Power of Three

  Return true if n is a power of three. Goldman Sachs uses this as a brainteaser: they want to see whether you can produce a loop-free, branch-free, O(1) solution that exploits a clever number-theory fact.

  2 free resourcesSolve →
• #412easyfoundational

  412. Fizz Buzz

  Print 'Fizz' for multiples of 3, 'Buzz' for multiples of 5, 'FizzBuzz' for multiples of 15, otherwise the number. Goldman Sachs uses Fizz Buzz as a 5-minute warm-up — they're grading whether your code is clean, not whether you can solve it.

  2 free resourcesSolve →