Goldman Sachs Coding Interview Questions: 9 Tagged Problems
9 coding problems tagged Goldman Sachs — 2 easy · 4 medium · 3 hard — with solutions in 13 languages. Plus a study plan by topic.
- Problems: 9
- By difficulty: 2 easy · 4 medium · 3 hard
- Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
- Cost: Free on every plan; sign in to run and submit
9 problems the CodeKairo catalogue tags as commonly asked in Goldman Sachs's coding rounds — 2 easy, 4 medium and 3 hard — each judged by hidden tests in 13 languages. The most common topics among them are Arrays (6), Strings (3) and Hash Table (3). CodeKairo's Goldman Sachs — Aptitude Test mock covers the Goldman Sachs aptitude test pattern, the one paper in this catalogue where a careless guess is a losing strategy. The tag is the catalogue's own annotation of where a problem tends to come up — not a list published by Goldman Sachs, which CodeKairo is not affiliated with.
Goldman Sachs study plan by topic
All 9 problems tagged Goldman Sachs, about 5 h 30 min of solving, grouped by technique in the order they build on each other — Hash Table, Counting, Prefix Sum and Binary Search and 4 more. It ends with the Goldman Sachs — Aptitude Test mock.
The plan
9 problems on Hash Table, Counting, Prefix Sum, Binary Search, Queue, Matrix, Heap and Dynamic Programming, easiest first within each topic.
- Roman to Integer Easy
- Number of Ways to Split a String Medium
- Subarray Sums Divisible by K Medium
- Find Minimum in Rotated Sorted Array II Medium
- First Unique Character in a String Easy
- Minimum Path Sum Medium
- IPO Hard
- Best Time to Buy and Sell Stock III Hard
- Best Time to Buy and Sell Stock IV Hard
Then: the timed test
Sit the Goldman Sachs — Aptitude Test mock under the clock — the coding problems are only one part of the round.
Goldman Sachs test patterns
- Goldman Sachs — Aptitude Test pattern guide and timed mock
All problems tagged Goldman Sachs
Easy (2)
- First Unique Character in a String Hash Table, String, Queue
- Roman to Integer Hash Table, Math, String
Medium (4)
- Find Minimum in Rotated Sorted Array II Array, Binary Search
- Subarray Sums Divisible by K Array, Hash Table, Prefix Sum
- Number of Ways to Split a String String, Math, Counting
- Minimum Path Sum Array, Dynamic Programming, Matrix
Hard (3)
- Best Time to Buy and Sell Stock IV Array, Dynamic Programming
- IPO Array, Greedy, Sorting
- Best Time to Buy and Sell Stock III Array, Dynamic Programming
Topics Goldman Sachs asks most
- Arrays 6 problems
- Strings 3 problems
- Hash Table 3 problems
- Dynamic Programming 3 problems
- Counting 2 problems
- Math 2 problems
- Prefix Sum 1 problem
- Sorting 1 problem
- Binary Search 1 problem
- Queue 1 problem
- Matrix 1 problem
- Greedy 1 problem