Goldman Sachs
246 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2484. Count Palindromic Subsequences | Hard | 44.5% | TopicsStringDynamic Programming |
| 2550. Count Collisions of Monkeys on a Polygon | Medium | 44.5% | TopicsMathRecursion |
| 862. Shortest Subarray with Sum at Least K | Hard | 44.5% | TopicsArrayBinary SearchQueueSliding WindowHeap (Priority Queue)Prefix SumMonotonic Queue |
| 931. Minimum Falling Path Sum | Medium | 44.5% | TopicsArrayDynamic ProgrammingMatrix |
| Print Zero Even Odd | Medium | 44.5% | TopicsConcurrency |
| 2191. Sort the Jumbled Numbers | Medium | 44.5% | TopicsArraySorting |
| Perform String Shifts | Easy | 44.5% | TopicsArrayMathString |
| 3168. Minimum Number of Chairs in a Waiting Room | Easy | 44.5% | TopicsStringSimulation |
| Better Compression of String | Medium | 44.5% | TopicsHash TableStringSortingCounting |
| 1771. Maximize Palindrome Length From Subsequences | Hard | 44.5% | TopicsStringDynamic Programming |
| 424. Longest Repeating Character Replacement | Medium | 44.5% | TopicsHash TableStringSliding Window |
| 322. Coin Change | Medium | 44.5% | TopicsArrayDynamic ProgrammingBreadth-First SearchKnapsack ProblemComplete Knapsack |
| 3649. Number of Perfect Pairs | Medium | 44.5% | TopicsArrayMathTwo PointersSorting |
| 3885. Design Event Manager | Medium | 44.5% | TopicsArrayHash TableDesignHeap (Priority Queue)Ordered Set |
| 3Sum | Medium | 42.2% | TopicsArrayTwo PointersSorting |
| Sqrt(x) | Easy | 42.2% | TopicsMathBinary SearchNewton's Method |
| 74. Search a 2D Matrix | Medium | 42.2% | TopicsArrayBinary SearchMatrix |
| 647. Palindromic Substrings | Medium | 42.2% | TopicsTwo PointersStringDynamic Programming |
| 1041. Robot Bounded In Circle | Medium | 42.2% | TopicsMathStringSimulation |
| 1832. Check if the Sentence Is Pangram | Easy | 42.2% | TopicsHash TableString |
| 968. Binary Tree Cameras | Hard | 42.2% | TopicsDynamic ProgrammingTreeDepth-First SearchBinary TreeDP on Trees |
| String to Integer (atoi) | Medium | 39.5% | TopicsString |
| 20. Valid Parentheses | Easy | 39.5% | TopicsStringStackBracket Sequences |
| 62. Unique Paths | Medium | 39.5% | TopicsMathDynamic ProgrammingCombinatorics |
| 295. Find Median from Data Stream | Hard | 39.5% | TopicsTwo PointersDesignSortingHeap (Priority Queue)Data Stream |
