Explore questions associated with Goldman Sachs. Review the source details, then use the workspace for code, notes, and diagrams.
58 questions in the library. A source association does not guarantee a future interview question.
Behavioral and leadership · Coding · Object-oriented design · System design
Loading questions…
Practice system design interviews out loud with an AI interviewer, a shared whiteboard and a scorecard for your level.
© 2026 SysRound. SysRound is an AI practice tool. The AI interviewer and the AI feedback can be wrong. Use it for your own practice, not to hire people.
Showing 26–50
Design an in-memory key-value store that supports multiple data structures (sorted sets, lists, etc.) and can be configured with different eviction strategies like LRU, LFU…
Companies: Goldman Sachs, Fampay, Microsoft
Last reported Jan 2026
Given an array of nonnegative integers representing house values, find the maximum sum you can obtain by selecting houses with the constraint that no two…
Companies: Goldman Sachs, Amazon, Apple, Microsoft
Array · Dynamic Programming
Last reported Jan 2026
Given an array of non-negative heights representing elevation bars, compute the total amount of water that can be trapped after rainfall. The core challenge is…
Companies: Goldman Sachs, Apple
Last reported Jan 2026
Large file transfers with small metadata transactions: resumable uploads, offline conflicts, reliable change feeds, and shared subtrees whose permissions change as files move.
Companies: Goldman Sachs, Amazon, Apple, Autodesk +17
access-control · change-data-capture · conflict-resolution · data-versioning
Last reported Jun 2025
Find the smallest integer greater than n that uses exactly the same digits (i.e., the next lexicographic permutation of n's digits); return -1 if no…
Companies: Goldman Sachs, Meta
Last reported Jun 2025
Find the maximum sum of any non-empty connected path in a binary tree (nodes used at most once), where the path can start and end…
Companies: Goldman Sachs, Amazon, Datadog, DoorDash +4
Binary Tree · Depth-First Search · DP on Trees · Dynamic Programming
Given heights of vertical lines at unit-spaced x-coordinates, pick two indices i<j to maximize the area min(height[i],height[j])*(j-i). With n up to 1e5, the problem requires…
Companies: Goldman Sachs, Amazon, Bloomberg, Cisco +4
Array · Greedy · Two Pointers
Count pairs of nodes in a rooted tree whose path edge-letters can be rearranged into a palindrome — equivalently, the multiset of letters on the…
Companies: Goldman Sachs
Bit Manipulation · Depth-First Search · Hash Table · Tree
For each day in an array of daily temperatures, determine how many days you must wait until a warmer temperature appears (or 0 if none)…
Companies: Goldman Sachs, Anduril, Chime
Array · Monotonic Stack · Stack
Implement a HashMap for integer keys/values without using built-in hash table libraries that supports put, get, and remove operations. The core challenge is to design…
Companies: Goldman Sachs, Anduril, Canva, Chewy +2
Array · Design · Hash Function · Hash Table
Count the number of ways to tile a 2×n board using 2×1 dominoes and L-shaped trominoes (rotations allowed), returning the result modulo 10^9+7. The core…
Companies: Goldman Sachs
Dynamic Programming
Given an array of distinct integers, repeatedly compare the first two elements, keeping the larger at the front and moving the smaller to the back…
Companies: Goldman Sachs, Amazon
Array · Simulation
Given n people seated in a circle, repeatedly remove every k-th person clockwise until one remains and return their label — the classic Josephus problem…
Companies: Goldman Sachs
Array · Math · Queue · Recursion
Convert a fraction to its decimal string form, enclosing any repeating fractional cycle in parentheses. The core challenge is simulating long division while handling sign…
Companies: Goldman Sachs, Meta
Hash Table · Math · String
Given two arrays gas and cost around a circular route, find the unique starting station index from which you can travel clockwise once without your…
Companies: Goldman Sachs, Adobe, Bloomberg, Expedia +2
Array · Greedy
Given a list of (studentId, score) pairs, compute each student's average of their top five scores and return the results as (studentId, average) sorted by…
Companies: Goldman Sachs
Array · Hash Table · Heap (Priority Queue) · Sorting
Implement an LFU cache with O(1) average-time get and put operations that evicts the least-frequently-used key when capacity is exceeded, breaking ties by least-recently-used…
Companies: Goldman Sachs, Amazon, Apple, Cisco +3
Design · Doubly-Linked List · Hash Table · Linked List
Find the length of the longest subsequence of s that reads the same forwards and backwards — a classic dynamic programming problem (equivalently LCS between…
Companies: Goldman Sachs
Dynamic Programming · String
Given a string s, return the longest substring that reads the same forwards and backwards. The core challenge is efficiently finding palindromic spans around centers…
Companies: Goldman Sachs, Adobe, Amazon, Bloomberg +6
Dynamic Programming · Manacher · String · Two Pointers
Find the length of the longest substring that can be turned into all the same letter by performing at most k character replacements; this is…
Companies: Goldman Sachs, D. E. Shaw, Meta, Microsoft +1
Hash Table · Sliding Window · String
You may swap two indices iff their values differ by at most limit; compute the lexicographically smallest array obtainable by any sequence of such swaps…
Companies: Goldman Sachs, Uber
Array · Sorting · Union-Find
Find the median of two sorted arrays in O(log(m+n)) time by using binary search to partition the arrays so the left half contains the correct…
Companies: Goldman Sachs, Amazon, Bloomberg, eBay +5
Array · Binary Search · Divide and Conquer
Given a list of intervals, merge all overlapping (including touching endpoints) intervals and return the minimal set of non-overlapping intervals that cover them. Key pattern…
Companies: Goldman Sachs, Amazon, Antithesis, Apple +16
Array · Quicksort · Sorting
Given an m×n grid of non-negative numbers, find the minimum-sum path from the top-left to bottom-right when you may only move right or down. This…
Companies: Goldman Sachs, Oracle
Array · Dynamic Programming · Matrix
Count the number of islands (4-directionally connected components of '1's) in an m×n binary grid. This is a connected-components/flood-fill problem typically solved with…
Companies: Goldman Sachs, Amazon, Anduril, Apple +16
Array · Breadth-First Search · Depth-First Search · Matrix