company prep

Goldman Sachs

Problems frequently reported at Goldman Sachs, in course order. Solve the must-dos first.

2 easy5 medium5 hardGrid DP ×4 Frequency counting ×1 Recursion on a smaller input ×1 Bit tricks (shift, mask, lowest set bit) ×1 Two pointers (opposite ends) ×1 Prefix & suffix passes ×1

02 · Arrays & Strings in Java

#387First Unique Character in a StringEasymust-do

08 · Recursion

#779K-th Symbol in GrammarMedium

12 · Two Pointers

#42Trapping Rain WaterHardmust-do

17 · Queues & Deques

#862Shortest Subarray with Sum at Least KHard

18 · Binary Search

#4Median of Two Sorted ArraysHard

24 · Heaps & Priority Queues

#703Kth Largest Element in a StreamEasymust-do

29 · Topological Sort

#2050Parallel Courses IIIHard

35 · Dynamic Programming

#62Unique PathsMediummust-do
#63Unique Paths IIMedium
#64Minimum Path SumMedium
#120TriangleMedium

38 · Segment Trees, Fenwick & String Matching

#1044Longest Duplicate SubstringHard