Goldman Sachs
Structured loops with a technical assessment, algorithm rounds, and a superday of back-to-back interviews spanning code and behavior.
Typical loop
- 1Recruiter screen
- 2HackerRank-style technical assessment
- 3Recorded or live phone interview
- 4Superday: several back-to-back technical rounds
- 5Behavioral and fit round
Questions
Callback's practice questions and the LeetCode questions Goldman Sachs has been asking, filtered together.
Asked on LeetCode
264 questions · all time
- Maximum Profit in Job SchedulinghardArrayBinary SearchDynamic ProgrammingSortingfrequency 35.5
- Minimum Initial Energy to Finish TaskshardArrayGreedySortingfrequency 35.5
- Minimum Value to Get Positive Step by Step SumeasyArrayPrefix Sumfrequency 35.5
- Move ZeroeseasyArrayTwo Pointersfrequency 35.5
- Pow(x, n)mediumMathRecursionfrequency 35.5
- Search a 2D Matrix IImediumArrayBinary SearchDivide and ConquerMatrixfrequency 35.5
- Spiral MatrixmediumArrayMatrixSimulationfrequency 35.5
- Task SchedulermediumArrayHash TableGreedySorting+2frequency 35.5
- Valid Triangle NumbermediumArrayTwo PointersBinary SearchGreedy+1frequency 35.5
- Add Two NumbersmediumLinked ListMathRecursionfrequency 31.8
- Best Time to Buy and Sell Stock IVhardArrayDynamic Programmingfrequency 31.8
- Climbing StairseasyMathDynamic ProgrammingMemoizationfrequency 31.8
- Decode StringmediumStringStackRecursionfrequency 31.8
- Design Circular DequemediumArrayLinked ListDesignQueuefrequency 31.8
- First Missing PositivehardArrayHash Tablefrequency 31.8
- Identify the Largest Outlier in an ArraymediumArrayHash TableCountingEnumerationfrequency 31.8
- Integer to English WordshardMathStringRecursionfrequency 31.8
- Linked List CycleeasyHash TableLinked ListTwo PointersFloyd's Cycle Finding Algorithmfrequency 31.8
- Max Area of IslandmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 31.8
- Max Consecutive Ones IIImediumArrayBinary SearchSliding WindowPrefix Sumfrequency 31.8
- Maximal SquaremediumArrayDynamic ProgrammingMatrixfrequency 31.8
- Merge Sorted ArrayeasyArrayTwo PointersSortingfrequency 31.8
- Minimum Size Subarray SummediumArrayBinary SearchSliding WindowPrefix Sumfrequency 31.8
- Minimum Window SubstringhardHash TableStringSliding Windowfrequency 31.8
- Number of Sub-arrays of Size K and Average Greater than or Equal to ThresholdmediumArraySliding Windowfrequency 31.8
- Path with Maximum GoldmediumArrayBacktrackingMatrixfrequency 31.8
- Reverse Linked ListeasyLinked ListRecursionfrequency 31.8
- Reverse Nodes in k-GrouphardLinked ListRecursionfrequency 31.8
- Russian Doll EnvelopeshardArrayBinary SearchDynamic ProgrammingSorting+1frequency 31.8
- Set Matrix ZeroesmediumArrayHash TableMatrixfrequency 31.8
- Single Element in a Sorted ArraymediumArrayBinary Searchfrequency 31.8
- Third Maximum NumbereasyArraySortingfrequency 31.8
- 132 PatternmediumArrayBinary SearchStackMonotonic Stack+1frequency 26.9
- Best Time to Buy and Sell Stock IIIhardArrayDynamic Programmingfrequency 26.9
- Binary Tree Level Order TraversalmediumTreeBreadth-First SearchBinary Treefrequency 26.9
- Count PrimesmediumArrayMathEnumerationNumber Theory+3frequency 26.9
- Distribute Coins in Binary TreemediumTreeDepth-First SearchBinary TreeDP on Treesfrequency 26.9
- Find First and Last Position of Element in Sorted ArraymediumArrayBinary Searchfrequency 26.9
- Find the Duplicate NumbermediumArrayTwo PointersBinary SearchBit Manipulation+2frequency 26.9
- Frequency of the Most Frequent ElementmediumArrayBinary SearchGreedySliding Window+2frequency 26.9
- Greatest Sum Divisible by ThreemediumArrayDynamic ProgrammingGreedySortingfrequency 26.9
- Implement Stack using QueueseasyStackDesignQueuefrequency 26.9
- Implement Trie (Prefix Tree)mediumHash TableStringDesignTriefrequency 26.9
- Intersection of Two Linked ListseasyHash TableLinked ListTwo Pointersfrequency 26.9
- Jump Game IImediumArrayDynamic ProgrammingGreedyfrequency 26.9
- Kth Largest Element in a StreameasyTreeDesignBinary Search TreeHeap (Priority Queue)+2frequency 26.9
- Largest Rectangle in HistogramhardArrayStackMonotonic StackRange Minimum/Maximum Queryfrequency 26.9
- Letter Combinations of a Phone NumbermediumHash TableStringBacktrackingfrequency 26.9
- Magnetic Force Between Two BallsmediumArrayBinary SearchSortingfrequency 26.9
- Majority ElementeasyArrayHash TableDivide and ConquerSorting+2frequency 26.9