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
- Swap Nodes in PairsmediumLinked ListRecursionfrequency 20.4
- Text JustificationhardArrayStringSimulationfrequency 20.4
- Top K Frequent WordsmediumArrayHash TableStringTrie+4frequency 20.4
- Tree DiametermediumTreeDepth-First SearchBreadth-First SearchGraph Theory+2frequency 20.4
- TrianglemediumArrayDynamic Programmingfrequency 20.4
- Two Sum IV - Input is a BSTeasyHash TableTwo PointersTreeDepth-First Search+3frequency 20.4
- Ugly Number IImediumHash TableMathDynamic ProgrammingHeap (Priority Queue)frequency 20.4
- Unique Paths IImediumArrayDynamic ProgrammingMatrixfrequency 20.4
- Unique Paths IIIhardArrayBacktrackingBit ManipulationMatrix+1frequency 20.4
- Valid AnagrameasyHash TableStringSortingfrequency 20.4
- Valid PalindromeeasyTwo PointersStringfrequency 20.4
- Validate Binary Search TreemediumTreeDepth-First SearchBinary Search TreeBinary Treefrequency 20.4
- Word LadderhardHash TableStringBreadth-First SearchBidirectional Searchfrequency 20.4
- Word Ladder IIhardHash TableStringBacktrackingBreadth-First Search+1frequency 20.4