Goldman Sachs
246 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| LFU Cache | Hard | 27.7% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| Third Maximum Number | Easy | 27.7% | TopicsArraySorting |
| Spiral Matrix II | Medium | 27.7% | TopicsArrayMatrixSimulation |
| Palindrome Pairs | Hard | 27.7% | TopicsArrayHash TableStringTrieHash Function |
| 132 Pattern | Medium | 27.7% | TopicsArrayBinary SearchStackMonotonic StackOrdered Set |
| 112. Path Sum | Easy | 27.7% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Implement Trie (Prefix Tree) | Medium | 27.7% | TopicsHash TableStringDesignTrie |
| 225. Implement Stack using Queues | Easy | 27.7% | TopicsStackDesignQueue |
| 34. Find First and Last Position of Element in Sorted Array | Medium | 27.7% | TopicsArrayBinary Search |
| 416. Partition Equal Subset Sum | Medium | 27.7% | TopicsArrayDynamic ProgrammingKnapsack Problem0-1 Knapsack |
| 204. Count Primes | Medium | 27.7% | TopicsArrayMathEnumerationNumber TheoryPrimality TestSieve TheoryPrime Number Sieve |
| 979. Distribute Coins in Binary Tree | Medium | 27.7% | TopicsTreeDepth-First SearchBinary TreeDP on Trees |
| 1262. Greatest Sum Divisible by Three | Medium | 27.7% | TopicsArrayDynamic ProgrammingGreedySorting |
| 1552. Magnetic Force Between Two Balls | Medium | 27.7% | TopicsArrayBinary SearchSorting |
| 1574. Shortest Subarray to be Removed to Make Array Sorted | Medium | 27.7% | TopicsArrayTwo PointersBinary SearchStackMonotonic Stack |
| 169. Majority Element | Easy | 27.7% | TopicsArrayHash TableDivide and ConquerSortingCountingBoyer–Moore Majority Vote Algorithm |
| 703. Kth Largest Element in a Stream | Easy | 27.7% | TopicsTreeDesignBinary Search TreeHeap (Priority Queue)Binary TreeData Stream |
| 2385. Amount of Time for Binary Tree to Be Infected | Medium | 27.7% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 36. Valid Sudoku | Medium | 27.7% | TopicsArrayHash TableMatrix |
| Evaluate Division | Medium | 27.7% | TopicsArrayStringDepth-First SearchBreadth-First SearchUnion-FindGraph TheoryShortest PathBellman–Ford AlgorithmFloyd–Warshall Algorithm |
| 2193. Minimum Number of Moves to Make Palindrome | Hard | 27.7% | TopicsTwo PointersStringGreedyBinary Indexed Tree |
| 945. Minimum Increment to Make Array Unique | Medium | 27.7% | TopicsArrayGreedySortingCounting |
| 678. Valid Parenthesis String | Medium | 27.7% | TopicsStringDynamic ProgrammingStackGreedyBracket Sequences |
| Accounts Merge | Medium | 27.7% | TopicsArrayHash TableStringDepth-First SearchBreadth-First SearchUnion-FindSorting |
| Largest Number | Medium | 27.7% | TopicsArrayStringGreedySorting |
