Goldman Sachs
246 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2375. Construct Smallest Number From DI String | Medium | 39.5% | TopicsStringBacktrackingStackGreedy |
| 739. Daily Temperatures | Medium | 39.5% | TopicsArrayStackMonotonic Stack |
| 994. Rotting Oranges | Medium | 39.5% | TopicsArrayBreadth-First SearchMatrix |
| Longest Consecutive Sequence | Medium | 39.5% | TopicsArrayHash TableUnion-Find |
| 1446. Consecutive Characters | Easy | 39.5% | TopicsString |
| Valid Triangle Number | Medium | 39.5% | TopicsArrayTwo PointersBinary SearchGreedySorting |
| 134. Gas Station | Medium | 39.5% | TopicsArrayGreedy |
| 2791. Count Paths That Can Form a Palindrome in a Tree | Hard | 39.5% | TopicsHash TableBit ManipulationTreeDepth-First Search |
| 2948. Make Lexicographically Smallest Array by Swapping Elements | Medium | 39.5% | TopicsArrayUnion-FindSorting |
| 2. Add Two Numbers | Medium | 36.4% | TopicsLinked ListMathRecursion |
| Pow(x, n) | Medium | 36.4% | TopicsMathRecursion |
| 51. N-Queens | Hard | 36.4% | TopicsArrayBacktrackingAlgorithm X |
| 54. Spiral Matrix | Medium | 36.4% | TopicsArrayMatrixSimulation |
| 55. Jump Game | Medium | 36.4% | TopicsArrayDynamic ProgrammingGreedy |
| Candy | Hard | 36.4% | TopicsArrayGreedy |
| 162. Find Peak Element | Medium | 36.4% | TopicsArrayBinary Search |
| 188. Best Time to Buy and Sell Stock IV | Hard | 36.4% | TopicsArrayDynamic Programming |
| 198. House Robber | Medium | 36.4% | TopicsArrayDynamic Programming |
| The Skyline Problem | Hard | 36.4% | TopicsArrayDivide and ConquerBinary Indexed TreeSegment TreeSweep LineSortingHeap (Priority Queue)Ordered Set |
| 560. Subarray Sum Equals K | Medium | 36.4% | TopicsArrayHash TablePrefix Sum |
| 1011. Capacity To Ship Packages Within D Days | Medium | 36.4% | TopicsArrayBinary Search |
| 1004. Max Consecutive Ones III | Medium | 36.4% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
| 752. Open the Lock | Medium | 36.4% | TopicsArrayHash TableStringBreadth-First SearchBidirectional Search |
| Circular Array Loop | Medium | 36.4% | TopicsArrayHash TableTwo PointersFloyd's Cycle Finding Algorithm |
| 124. Binary Tree Maximum Path Sum | Hard | 36.4% | TopicsDynamic ProgrammingTreeDepth-First SearchBinary TreeDP on Trees |
