GS

Goldman Sachs

100 questions tracked99 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 100 of 100 questions

1
HardTrapping Rain Waterβœ“ Our Solution
100
ArrayTwo PointersDynamic ProgrammingStack+1
2
HardMedian of Two Sorted Arraysβœ“ Our Solution
80
ArrayBinary SearchDivide and Conquer
3
EasyFirst Unique Character in a Stringβœ“ Our Solution
78
Hash TableStringQueueCounting
4
MediumFraction to Recurring Decimalβœ“ Our Solution
77
Hash TableMathString
5
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
64
ArrayDynamic Programming
6
MediumNumber of Islandsβœ“ Our Solution
64
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
7
MediumMinimum Path Sumβœ“ Our Solution
62
ArrayDynamic ProgrammingMatrix
8
MediumString Compressionβœ“ Our Solution
61
Two PointersString
9
60
ArrayHash Table
10
MediumLRU Cacheβœ“ Our Solution
60
Hash TableLinked ListDesignDoubly-Linked List
11
MediumGroup Anagramsβœ“ Our Solution
59
ArrayHash TableStringSorting
12
MediumFind Minimum in Rotated Sorted Arrayβœ“ Our Solution
59
ArrayBinary Search
13
MediumContainer With Most Waterβœ“ Our Solution
59
ArrayTwo PointersGreedy
14
MediumDecode Waysβœ“ Our Solution
56
StringDynamic Programming
15
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
56
Hash TableStringSliding Window
16
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
56
ArrayBinary Search
17
MediumMinimize the Maximum of Two Arraysβœ“ Our Solution
54
MathBinary SearchNumber Theory
18
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
52
ArrayDynamic ProgrammingGreedy
19
MediumKth Largest Element in an Arrayβœ“ Our Solution
51
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
20
HardValid Arrangement of Pairsβœ“ Our Solution
50
Depth-First SearchGraphEulerian Circuit
21
MediumMerge Intervalsβœ“ Our Solution
49
ArraySorting
22
MediumConstruct Smallest Number From DI Stringβœ“ Our Solution
49
StringBacktrackingStackGreedy
23
MediumLongest Palindromic Substringβœ“ Our Solution
49
Two PointersStringDynamic Programming
24
EasyPower of Threeβœ“ Our Solution
49
MathRecursion
25
MediumLongest Increasing Subsequenceβœ“ Our Solution
49
ArrayBinary SearchDynamic Programming
26
MediumMaximum Subarrayβœ“ Our Solution
49
ArrayDivide and ConquerDynamic Programming
27
MediumMinimum Cost Homecoming of a Robot in a Gridβœ“ Our Solution
47
ArrayGreedy
28
EasyValid Parenthesesβœ“ Our Solution
47
StringStack
29
MediumJump Gameβœ“ Our Solution
47
ArrayDynamic ProgrammingGreedy
30
HardCount Palindromic Subsequencesβœ“ Our Solution
47
StringDynamic Programming
31
MediumRange Product Queries of Powersβœ“ Our Solution
47
ArrayBit ManipulationPrefix Sum
32
EasyKeep Multiplying Found Values by Twoβœ“ Our Solution
46
ArrayHash TableSortingSimulation
33
MediumCount Number of Textsβœ“ Our Solution
46
Hash TableMathStringDynamic Programming
34
MediumFind All Good Indicesβœ“ Our Solution
46
ArrayDynamic ProgrammingPrefix Sum
35
HardSliding Window Maximumβœ“ Our Solution
46
ArrayQueueSliding WindowHeap (Priority Queue)+1
36
MediumSuccessful Pairs of Spells and Potionsβœ“ Our Solution
46
ArrayTwo PointersBinary SearchSorting
37
EasyDetermine if Two Events Have Conflictβœ“ Our Solution
46
ArrayString
38
MediumSearch a 2D Matrixβœ“ Our Solution
44
ArrayBinary SearchMatrix
39
MediumString to Integer (atoi)βœ“ Our Solution
44
String
40
MediumProduct of Array Except Selfβœ“ Our Solution
44
ArrayPrefix Sum
41
MediumSubarray Sum Equals Kβœ“ Our Solution
42
ArrayHash TablePrefix Sum
42
MediumHouse Robberβœ“ Our Solution
42
ArrayDynamic Programming
43
MediumPow(x, n)βœ“ Our Solution
42
MathRecursion
44
MediumWord Searchβœ“ Our Solution
40
ArrayStringBacktrackingDepth-First Search+1
45
EasyLinked List Cycleβœ“ Our Solution
40
Hash TableLinked ListTwo Pointers
46
MediumNext Permutationβœ“ Our Solution
40
ArrayTwo Pointers
47
EasyPascal's Triangleβœ“ Our Solution
37
ArrayDynamic Programming
48
MediumFind Peak Elementβœ“ Our Solution
37
ArrayBinary Search
49
EasyClimbing Stairsβœ“ Our Solution
37
MathDynamic ProgrammingMemoization
50
37
MathBinary Search
51
EasyMissing Numberβœ“ Our Solution
37
ArrayHash TableMathBinary Search+2
52
MediumMinimum Size Subarray Sumβœ“ Our Solution
37
ArrayBinary SearchSliding WindowPrefix Sum
53
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
37
ArrayHash TableMathDesign+1
54
MediumTop K Frequent Elementsβœ“ Our Solution
34
ArrayHash TableDivide and ConquerSorting+4
55
MediumMaximum Product Subarrayβœ“ Our Solution
34
ArrayDynamic Programming
56
MediumGas Stationβœ“ Our Solution
34
ArrayGreedy
57
MediumMinimum Number of Arrows to Burst Balloonsβœ“ Our Solution
34
ArrayGreedySorting
58
HardFind Median from Data Streamβœ“ Our Solution
30
Two PointersDesignSortingHeap (Priority Queue)+1
59
MediumMaximal Squareβœ“ Our Solution
30
ArrayDynamic ProgrammingMatrix
60
MediumDecode Stringβœ“ Our Solution
30
StringStackRecursion
61
MediumMaximum XOR of Two Numbers in an Arrayβœ“ Our Solution
30
ArrayHash TableBit ManipulationTrie
62
EasyNext Greater Element Iβœ“ Our Solution
30
ArrayHash TableStackMonotonic Stack
63
HardBest Time to Buy and Sell Stock IVβœ“ Our Solution
30
ArrayDynamic Programming
64
EasyPascal's Triangle IIβœ“ Our Solution
30
ArrayDynamic Programming
65
MediumSet Matrix Zeroesβœ“ Our Solution
30
ArrayHash TableMatrix
66
MediumLetter Combinations of a Phone Numberβœ“ Our Solution
30
Hash TableStringBacktracking
67
30
ArrayBacktracking
68
EasyMerge Two Sorted Listsβœ“ Our Solution
30
Linked ListRecursion
69
HardThe Skyline Problemβœ“ Our Solution
30
ArrayDivide and ConquerBinary Indexed TreeSegment Tree+3
70
MediumSpiral Matrixβœ“ Our Solution
30
ArrayMatrixSimulation
71
HardFirst Missing Positiveβœ“ Our Solution
30
ArrayHash Table
72
MediumAdd Two Numbersβœ“ Our Solution
30
Linked ListMathRecursion
73
EasyRoman to Integerβœ“ Our Solution
30
Hash TableMathString
74
EasyCount Number of Pairs With Absolute Difference Kβœ“ Our Solution
30
ArrayHash TableCounting
75
30
ArrayGreedy
76
MediumNext Greater Element IIIβœ“ Our Solution
26
MathTwo PointersString
77
MediumFraction Addition and Subtractionβœ“ Our Solution
26
MathStringSimulation
78
26
ArrayTwo PointersSorting
79
MediumPermutationsβœ“ Our Solution
26
ArrayBacktracking
80
MediumAmount of Time for Binary Tree to Be Infectedβœ“ Our Solution
26
Hash TableTreeDepth-First SearchBreadth-First Search+1
81
EasyReverse Stringβœ“ Our Solution
26
Two PointersString
82
MediumInteger to Romanβœ“ Our Solution
26
Hash TableMathString
83
MediumLongest Substring with At Most K Distinct Characters
26
Hash TableStringSliding Window
84
MediumPermutation in Stringβœ“ Our Solution
26
Hash TableTwo PointersStringSliding Window
85
MediumReorder Listβœ“ Our Solution
26
Linked ListTwo PointersStackRecursion
86
EasyIntersection of Two Linked Listsβœ“ Our Solution
26
Hash TableLinked ListTwo Pointers
87
MediumFind the Duplicate Numberβœ“ Our Solution
26
ArrayTwo PointersBinary SearchBit Manipulation
88
MediumLargest Numberβœ“ Our Solution
26
ArrayStringGreedySorting
89
EasyValid Anagramβœ“ Our Solution
26
Hash TableStringSorting
90
MediumRotate Arrayβœ“ Our Solution
26
ArrayMathTwo Pointers
91
MediumRotate Imageβœ“ Our Solution
26
ArrayMathMatrix
92
MediumJump Game IIβœ“ Our Solution
19
ArrayDynamic ProgrammingGreedy
93
MediumValid Sudokuβœ“ Our Solution
19
ArrayHash TableMatrix
94
EasyContains Duplicate IIβœ“ Our Solution
19
ArrayHash TableSliding Window
95
MediumUnique Pathsβœ“ Our Solution
19
MathDynamic ProgrammingCombinatorics
96
EasyMerge Sorted Arrayβœ“ Our Solution
19
ArrayTwo PointersSorting
97
MediumQuery Kth Smallest Trimmed Numberβœ“ Our Solution
19
ArrayStringDivide and ConquerSorting+3
98
MediumRemove Duplicate Lettersβœ“ Our Solution
19
StringStackGreedyMonotonic Stack
99
MediumZigzag Conversionβœ“ Our Solution
19
String
100
MediumInterleaving Stringβœ“ Our Solution
19
StringDynamic Programming