Goldman Sachs
246 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 21. Merge Two Sorted Lists | Easy | 21.1% | TopicsLinked ListRecursion |
| 48. Rotate Image | Medium | 21.1% | TopicsArrayMathMatrix |
| Minimum Size Subarray Sum | Medium | 21.1% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
| 268. Missing Number | Easy | 21.1% | TopicsArrayHash TableMathBinary SearchBit ManipulationSorting |
| 300. Longest Increasing Subsequence | Medium | 21.1% | TopicsArrayBinary SearchDynamic ProgrammingLongest Increasing Subsequence |
| Longest Substring with At Most K Distinct Characters | Medium | 21.1% | TopicsHash TableStringSliding Window |
| 767. Reorganize String | Medium | 21.1% | TopicsHash TableStringGreedySortingHeap (Priority Queue)Counting |
| 1395. Count Number of Teams | Medium | 21.1% | TopicsArrayDynamic ProgrammingBinary Indexed TreeSegment Tree |
| Maximum Size Subarray Sum Equals k | Medium | 21.1% | TopicsArrayHash TablePrefix Sum |
| 909. Snakes and Ladders | Medium | 21.1% | TopicsArrayBreadth-First SearchMatrix |
| 78. Subsets | Medium | 21.1% | TopicsArrayBacktrackingBit Manipulation |
| 2043. Simple Bank System | Medium | 21.1% | TopicsArrayHash TableDesignSimulation |
| 1910. Remove All Occurrences of a Substring | Medium | 21.1% | TopicsStringStackSimulation |
| Two Sum IV - Input is a BST | Easy | 21.1% | TopicsHash TableTwo PointersTreeDepth-First SearchBreadth-First SearchBinary Search TreeBinary Tree |
| Next Greater Element II | Medium | 21.1% | TopicsArrayStackMonotonic Stack |
| 779. K-th Symbol in Grammar | Medium | 21.1% | TopicsMathBit ManipulationRecursion |
| 622. Design Circular Queue | Medium | 21.1% | TopicsArrayLinked ListDesignQueue |
| 2734. Lexicographically Smallest String After Substring Operation | Medium | 21.1% | TopicsStringGreedy |
| Evaluate Reverse Polish Notation | Medium | 21.1% | TopicsArrayMathStack |
| 102. Binary Tree Level Order Traversal | Medium | 21.1% | TopicsTreeBreadth-First SearchBinary Tree |
| 435. Non-overlapping Intervals | Medium | 21.1% | TopicsArrayDynamic ProgrammingGreedySorting |
| Text Justification | Hard | 21.1% | TopicsArrayStringSimulation |
| 312. Burst Balloons | Hard | 21.1% | TopicsArrayDynamic Programming |
| 873. Length of Longest Fibonacci Subsequence | Medium | 21.1% | TopicsArrayHash TableDynamic Programming |
| 2007. Find Original Array From Doubled Array | Medium | 21.1% | TopicsArrayHash TableGreedySorting |
