- Interview Questions
- /
- Goldman Sachs
Goldman Sachs LeetCode Interview Questions
Practice 264 coding problems currently tagged to Goldman Sachs. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
Top Topics at Goldman Sachs
Ace your Goldman Sachs interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Goldman Sachs Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Trapping Rain Water 100% | HardH | Solve→ |
Median of Two Sorted Arrays 80.1% | HardH | Solve→ |
First Unique Character in a String 77.2% | EasyE | Solve→ |
Fraction to Recurring Decimal 76.9% | MediumM | Solve→ |
High Five 76.3% | EasyE | Solve→ |
Minimum Path Sum 68.6% | MediumM | Solve→ |
Container With Most Water 65.2% | MediumM | Solve→ |
LRU Cache 65.2% | MediumM | Solve→ |
Longest Substring Without Repeating Characters 63.3% | MediumM | Solve→ |
String Compression 61% | MediumM | Solve→ |
Merge Intervals 60.2% | MediumM | Solve→ |
Find the Winner of the Circular Game 60.2% | MediumM | Solve→ |
Decode Ways 58.5% | MediumM | Solve→ |
Number of Islands 58.5% | MediumM | Solve→ |
Group Anagrams 57.6% | MediumM | Solve→ |
Robot Bounded In Circle 57.6% | MediumM | Solve→ |
Search in Rotated Sorted Array 56.6% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 55.5% | EasyE | Solve→ |
Two Sum 53.2% | EasyE | Solve→ |
Knight Probability in Chessboard 53.2% | MediumM | Solve→ |
Maximum Subarray 52% | MediumM | Solve→ |
Find Minimum in Rotated Sorted Array 52% | MediumM | Solve→ |
Longest Palindromic Subsequence 52% | MediumM | Solve→ |
Best Time to Buy and Sell Stock II 50.6% | MediumM | Solve→ |
Robot Return to Origin 50.6% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sell Diminishing-Valued Colored Balls 50.6% | MediumM | Solve→ |
Valid Arrangement of Pairs 49.1% | HardH | Solve→ |
Design HashMap 49.1% | EasyE | Solve→ |
Better Compression of String 49.1% | MediumM | Solve→ |
Find the Minimum Amount of Time to Brew Potions 49.1% | MediumM | Solve→ |
Pascal's Triangle 47.4% | EasyE | Solve→ |
Kth Largest Element in an Array 47.4% | MediumM | Solve→ |
Top K Frequent Elements 47.4% | MediumM | Solve→ |
Corporate Flight Bookings 47.4% | MediumM | Solve→ |
Minimum Moves to Capture The Queen 47.4% | MediumM | Solve→ |
Remove All Adjacent Duplicates in String II 47.4% | MediumM | Solve→ |
Minimum Length of String After Deleting Similar Ends 47.4% | MediumM | Solve→ |
Permutations III 47.4% | MediumM | Solve→ |
Car Pooling 47.4% | MediumM | Solve→ |
Minimum Cost Homecoming of a Robot in a Grid 45.6% | MediumM | Solve→ |
Sliding Window Maximum 45.6% | HardH | Solve→ |
Range Product Queries of Powers 45.6% | MediumM | Solve→ |
Pairs of Songs With Total Durations Divisible by 60 45.6% | MediumM | Solve→ |
Optimal Account Balancing 45.6% | HardH | Solve→ |
Longest Palindromic Substring 43.6% | MediumM | Solve→ |
Keep Multiplying Found Values by Two 43.6% | EasyE | Solve→ |
Product of Array Except Self 43.6% | MediumM | Solve→ |
Count Number of Texts 43.6% | MediumM | Solve→ |
Successful Pairs of Spells and Potions 43.6% | MediumM | Solve→ |
Construct Smallest Number From DI String 43.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find All Good Indices 43.6% | MediumM | Solve→ |
Determine if Two Events Have Conflict 43.6% | EasyE | Solve→ |
Count Palindromic Subsequences 43.6% | HardH | Solve→ |
Count Collisions of Monkeys on a Polygon 43.6% | MediumM | Solve→ |
Palindromic Substrings 43.6% | MediumM | Solve→ |
Backspace String Compare 43.6% | EasyE | Solve→ |
Shortest Subarray with Sum at Least K 43.6% | HardH | Solve→ |
Minimum Falling Path Sum 43.6% | MediumM | Solve→ |
Print Zero Even Odd 43.6% | MediumM | Solve→ |
Sort the Jumbled Numbers 43.6% | MediumM | Solve→ |
Perform String Shifts 43.6% | EasyE | Solve→ |
Minimum Number of Chairs in a Waiting Room 43.6% | EasyE | Solve→ |
Maximize Palindrome Length From Subsequences 43.6% | HardH | Solve→ |
Coin Change 43.6% | MediumM | Solve→ |
Allocate Mailboxes 43.6% | HardH | Solve→ |
Number of Perfect Pairs 43.6% | MediumM | Solve→ |
Design Event Manager 43.6% | MediumM | Solve→ |
3Sum 41.3% | MediumM | Solve→ |
Valid Parentheses 41.3% | EasyE | Solve→ |
N-Queens 41.3% | HardH | Solve→ |
Jump Game 41.3% | MediumM | Solve→ |
Sqrt(x) 41.3% | EasyE | Solve→ |
Search a 2D Matrix 41.3% | MediumM | Solve→ |
Check if the Sentence Is Pangram 41.3% | EasyE | Solve→ |
Longest Repeating Character Replacement 41.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Binary Tree Cameras 41.3% | HardH | Solve→ |
String to Integer (atoi) 38.7% | MediumM | Solve→ |
Unique Paths 38.7% | MediumM | Solve→ |
House Robber 38.7% | MediumM | Solve→ |
The Skyline Problem 38.7% | HardH | Solve→ |
Subarray Sum Equals K 38.7% | MediumM | Solve→ |
Asteroid Collision 38.7% | MediumM | Solve→ |
Daily Temperatures 38.7% | MediumM | Solve→ |
Rotting Oranges 38.7% | MediumM | Solve→ |
Capacity To Ship Packages Within D Days 38.7% | MediumM | Solve→ |
Generate Parentheses 38.7% | MediumM | Solve→ |
Open the Lock 38.7% | MediumM | Solve→ |
Binary Tree Maximum Path Sum 38.7% | HardH | Solve→ |
Longest Consecutive Sequence 38.7% | MediumM | Solve→ |
Consecutive Characters 38.7% | EasyE | Solve→ |
Gas Station 38.7% | MediumM | Solve→ |
Pow(x, n) 35.5% | MediumM | Solve→ |
Spiral Matrix 35.5% | MediumM | Solve→ |
Candy 35.5% | HardH | Solve→ |
Find Peak Element 35.5% | MediumM | Solve→ |
Find Median from Data Stream 35.5% | HardH | Solve→ |
Minimum Value to Get Positive Step by Step Sum 35.5% | EasyE | Solve→ |
Maximum Profit in Job Scheduling 35.5% | HardH | Solve→ |
Circular Array Loop 35.5% | MediumM | Solve→ |
Move Zeroes 35.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Course Schedule II 35.5% | MediumM | Solve→ |
Search a 2D Matrix II 35.5% | MediumM | Solve→ |
Maximal Rectangle 35.5% | HardH | Solve→ |
Valid Triangle Number 35.5% | MediumM | Solve→ |
Task Scheduler 35.5% | MediumM | Solve→ |
Koko Eating Bananas 35.5% | MediumM | Solve→ |
Minimum Initial Energy to Finish Tasks 35.5% | HardH | Solve→ |
Count Paths That Can Form a Palindrome in a Tree 35.5% | HardH | Solve→ |
Domino and Tromino Tiling 35.5% | MediumM | Solve→ |
Add Two Numbers 31.8% | MediumM | Solve→ |
First Missing Positive 31.8% | HardH | Solve→ |
Climbing Stairs 31.8% | EasyE | Solve→ |
Set Matrix Zeroes 31.8% | MediumM | Solve→ |
Linked List Cycle 31.8% | EasyE | Solve→ |
Best Time to Buy and Sell Stock IV 31.8% | HardH | Solve→ |
Minimum Size Subarray Sum 31.8% | MediumM | Solve→ |
Maximal Square 31.8% | MediumM | Solve→ |
Decode String 31.8% | MediumM | Solve→ |
Integer to English Words 31.8% | HardH | Solve→ |
Design Circular Deque 31.8% | MediumM | Solve→ |
Reverse Linked List 31.8% | EasyE | Solve→ |
Max Consecutive Ones III 31.8% | MediumM | Solve→ |
Single Element in a Sorted Array 31.8% | MediumM | Solve→ |
Third Maximum Number 31.8% | EasyE | Solve→ |
Identify the Largest Outlier in an Array 31.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Max Area of Island 31.8% | MediumM | Solve→ |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold 31.8% | MediumM | Solve→ |
Russian Doll Envelopes 31.8% | HardH | Solve→ |
Path with Maximum Gold 31.8% | MediumM | Solve→ |
Reverse Nodes in k-Group 31.8% | HardH | Solve→ |
Merge Sorted Array 31.8% | EasyE | Solve→ |
Minimum Window Substring 31.8% | HardH | Solve→ |
Roman to Integer 26.9% | EasyE | Solve→ |
Letter Combinations of a Phone Number 26.9% | MediumM | Solve→ |
Next Permutation 26.9% | MediumM | Solve→ |
Jump Game II 26.9% | MediumM | Solve→ |
Word Search 26.9% | MediumM | Solve→ |
Maximum Product Subarray 26.9% | MediumM | Solve→ |
Intersection of Two Linked Lists 26.9% | EasyE | Solve→ |
Find the Duplicate Number 26.9% | MediumM | Solve→ |
Power of Three 26.9% | EasyE | Solve→ |
Reverse String 26.9% | EasyE | Solve→ |
Minimum Number of Arrows to Burst Balloons 26.9% | MediumM | Solve→ |
Merge k Sorted Lists 26.9% | HardH | Solve→ |
Sudoku Solver 26.9% | HardH | Solve→ |
Maximum Size Subarray Sum Equals k 26.9% | MediumM | Solve→ |
Snakes and Ladders 26.9% | MediumM | Solve→ |
Spiral Matrix II 26.9% | MediumM | Solve→ |
Palindrome Pairs 26.9% | HardH | Solve→ |
132 Pattern 26.9% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Frequency of the Most Frequent Element 26.9% | MediumM | Solve→ |
Path Sum 26.9% | EasyE | Solve→ |
Implement Trie (Prefix Tree) 26.9% | MediumM | Solve→ |
Implement Stack using Queues 26.9% | EasyE | Solve→ |
Find First and Last Position of Element in Sorted Array 26.9% | MediumM | Solve→ |
Binary Tree Level Order Traversal 26.9% | MediumM | Solve→ |
Partition Equal Subset Sum 26.9% | MediumM | Solve→ |
Best Time to Buy and Sell Stock III 26.9% | HardH | Solve→ |
Count Primes 26.9% | MediumM | Solve→ |
Distribute Coins in Binary Tree 26.9% | MediumM | Solve→ |
Greatest Sum Divisible by Three 26.9% | MediumM | Solve→ |
Magnetic Force Between Two Balls 26.9% | MediumM | Solve→ |
Shortest Subarray to be Removed to Make Array Sorted 26.9% | MediumM | Solve→ |
Majority Element 26.9% | EasyE | Solve→ |
Kth Largest Element in a Stream 26.9% | EasyE | Solve→ |
Valid Sudoku 26.9% | MediumM | Solve→ |
Largest Rectangle in Histogram 26.9% | HardH | Solve→ |
Sort Colors 26.9% | MediumM | Solve→ |
Minimum Number of Moves to Make Palindrome 26.9% | HardH | Solve→ |
Minimum Increment to Make Array Unique 26.9% | MediumM | Solve→ |
Valid Parenthesis String 26.9% | MediumM | Solve→ |
Integer to Roman 20.4% | MediumM | Solve→ |
Merge Two Sorted Lists 20.4% | EasyE | Solve→ |
Rotate Image 20.4% | MediumM | Solve→ |
Pascal's Triangle II 20.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Reorder List 20.4% | MediumM | Solve→ |
Missing Number 20.4% | EasyE | Solve→ |
Longest Increasing Subsequence 20.4% | MediumM | Solve→ |
Longest Substring with At Most K Distinct Characters 20.4% | MediumM | Solve→ |
Next Greater Element I 20.4% | EasyE | Solve→ |
Count of Integers 20.4% | HardH | Solve→ |
Reorganize String 20.4% | MediumM | Solve→ |
Count Number of Teams 20.4% | MediumM | Solve→ |
Design Underground System 20.4% | MediumM | Solve→ |
Find the Closest Palindrome 20.4% | HardH | Solve→ |
Validate Binary Search Tree 20.4% | MediumM | Solve→ |
Ugly Number II 20.4% | MediumM | Solve→ |
Fizz Buzz 20.4% | EasyE | Solve→ |
Restore IP Addresses 20.4% | MediumM | Solve→ |
Subsets 20.4% | MediumM | Solve→ |
Excel Sheet Column Number 20.4% | EasyE | Solve→ |
Maximum Sum Circular Subarray 20.4% | MediumM | Solve→ |
LFU Cache 20.4% | HardH | Solve→ |
Simple Bank System 20.4% | MediumM | Solve→ |
Remove All Occurrences of a Substring 20.4% | MediumM | Solve→ |
Two Sum IV - Input is a BST 20.4% | EasyE | Solve→ |
Next Greater Element II 20.4% | MediumM | Solve→ |
K-th Symbol in Grammar 20.4% | MediumM | Solve→ |
Meeting Rooms III 20.4% | HardH | Solve→ |
Design Circular Queue 20.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Lexicographically Smallest String After Substring Operation 20.4% | MediumM | Solve→ |
Triangle 20.4% | MediumM | Solve→ |
Shortest Path in Binary Matrix 20.4% | MediumM | Solve→ |
Evaluate Reverse Polish Notation 20.4% | MediumM | Solve→ |
Non-overlapping Intervals 20.4% | MediumM | Solve→ |
Text Justification 20.4% | HardH | Solve→ |
Burst Balloons 20.4% | HardH | Solve→ |
Length of Longest Fibonacci Subsequence 20.4% | MediumM | Solve→ |
Word Ladder 20.4% | HardH | Solve→ |
Find Original Array From Doubled Array 20.4% | MediumM | Solve→ |
Find Pivot Index 20.4% | EasyE | Solve→ |
Cherry Pickup 20.4% | HardH | Solve→ |
Snapshot Array 20.4% | MediumM | Solve→ |
Maximum Average Subarray I 20.4% | EasyE | Solve→ |
Permutations II 20.4% | MediumM | Solve→ |
Perfect Squares 20.4% | MediumM | Solve→ |
Longest Duplicate Substring 20.4% | HardH | Solve→ |
Amount of Time for Binary Tree to Be Infected 20.4% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 20.4% | MediumM | Solve→ |
Power of Two 20.4% | EasyE | Solve→ |
Unique Paths III 20.4% | HardH | Solve→ |
Delete the Middle Node of a Linked List 20.4% | MediumM | Solve→ |
Parsing A Boolean Expression 20.4% | HardH | Solve→ |
Find Shortest Path with K Hops 20.4% | HardH | Solve→ |
Tree Diameter 20.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Swaps to Make Strings Equal 20.4% | MediumM | Solve→ |
Evaluate Division 20.4% | MediumM | Solve→ |
Minimum Cost to Reach City With Discounts 20.4% | MediumM | Solve→ |
Single-Threaded CPU 20.4% | MediumM | Solve→ |
Permutations 20.4% | MediumM | Solve→ |
Diameter of N-Ary Tree 20.4% | MediumM | Solve→ |
K Closest Points to Origin 20.4% | MediumM | Solve→ |
Car Fleet 20.4% | MediumM | Solve→ |
Count Square Submatrices with All Ones 20.4% | MediumM | Solve→ |
Reverse Words in a String 20.4% | MediumM | Solve→ |
Remove Duplicates from Sorted Array 20.4% | EasyE | Solve→ |
Find the Longest Substring Containing Vowels in Even Counts 20.4% | MediumM | Solve→ |
Minimum Insertion Steps to Make a String Palindrome 20.4% | HardH | Solve→ |
Shortest Bridge 20.4% | MediumM | Solve→ |
Design Browser History 20.4% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 20.4% | MediumM | Solve→ |
Valid Anagram 20.4% | EasyE | Solve→ |
Top K Frequent Words 20.4% | MediumM | Solve→ |
Is Subsequence 20.4% | EasyE | Solve→ |
Accounts Merge 20.4% | MediumM | Solve→ |
Largest Number 20.4% | MediumM | Solve→ |
Kth Ancestor of a Tree Node 20.4% | HardH | Solve→ |
Split Array Largest Sum 20.4% | HardH | Solve→ |
Maximum Number of Events That Can Be Attended 20.4% | MediumM | Solve→ |
Find the Winner of an Array Game 20.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Course Schedule 20.4% | MediumM | Solve→ |
Subarray Product Less Than K 20.4% | MediumM | Solve→ |
Find Minimum in Rotated Sorted Array II 20.4% | HardH | Solve→ |
Monotone Increasing Digits 20.4% | MediumM | Solve→ |
Swap Nodes in Pairs 20.4% | MediumM | Solve→ |
Remove Comments 20.4% | MediumM | Solve→ |
Parallel Courses III 20.4% | HardH | Solve→ |
Kth Smallest Element in a Sorted Matrix 20.4% | MediumM | Solve→ |
Valid Palindrome 20.4% | EasyE | Solve→ |
Word Ladder II 20.4% | HardH | Solve→ |
Smallest String With Swaps 20.4% | MediumM | Solve→ |
Meeting Rooms II 20.4% | MediumM | Solve→ |
Unique Paths II 20.4% | MediumM | Solve→ |
Single Number 20.4% | EasyE | Solve→ |
Similar Companies
Explore company practice sets with a similar number of tagged coding questions.
Frequently Asked Questions
What LeetCode problems are tagged to Goldman Sachs?
Our current Goldman Sachs practice dataset contains 264 tagged coding problems, including Trapping Rain Water, Median of Two Sorted Arrays, First Unique Character in a String. The difficulty breakdown is 46 Easy, 169 Medium, and 49 Hard problems.
How should I prepare for a Goldman Sachs coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Goldman Sachs interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Goldman Sachs coding interviews?
Based on our data, Goldman Sachs interviews include 46 Easy (17%), 169 Medium (64%), and 49 Hard (19%) problems.
Ready to ace your Goldman Sachs interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required