Goldman Sachs LeetCode interview questions

Explore Goldman Sachs questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

246

Solved

0 / 246

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Trapping Rain Water Array Two Pointers Dynamic Programming +2 HARD	Hard	100.0%	0.7%
Median of Two Sorted Arrays Array Binary Search Divide and Conquer HARD	Hard	80.0%	0.5%
First Unique Character in a String Hash Table String Queue +1 EASY	Easy	77.6%	0.7%
High Five Array Hash Table Sorting +1 EASY	Easy	75.8%	0.7%
Fraction to Recurring Decimal Hash Table Math String MEDIUM	Medium	75.1%	0.3%
Minimum Path Sum Array Dynamic Programming Matrix MEDIUM	Medium	70.3%	0.7%
Container With Most Water Array Two Pointers Greedy MEDIUM	Medium	65.8%	0.6%
LRU Cache Hash Table Linked List Design +1 MEDIUM	Medium	65.1%	0.5%
Longest Substring Without Repeating Characters Hash Table String Sliding Window MEDIUM	Medium	64.4%	0.4%
String Compression Two Pointers String MEDIUM	Medium	62.2%	0.6%
Merge Intervals Array Sorting Quicksort MEDIUM	Medium	60.5%	0.5%
Number of Islands Array Depth-First Search Breadth-First Search +2 MEDIUM	Medium	59.6%	0.7%
Search in Rotated Sorted Array Array Binary Search MEDIUM	Medium	57.7%	0.5%
Group Anagrams Array Hash Table String +1 MEDIUM	Medium	56.6%	0.7%
Find the Winner of the Circular Game Array Math Recursion +2 MEDIUM	Medium	56.6%	0.8%
Best Time to Buy and Sell Stock Array Dynamic Programming EASY	Easy	55.5%	0.6%
Sell Diminishing-Valued Colored Balls Array Math Binary Search +3 MEDIUM	Medium	55.5%	0.3%
Two Sum Array Hash Table EASY	Easy	54.3%	0.6%
Find Minimum in Rotated Sorted Array Array Binary Search MEDIUM	Medium	54.3%	0.6%
Longest Palindromic Subsequence String Dynamic Programming MEDIUM	Medium	54.3%	0.7%

Showing 1–20 of 246 matching problems · All Problems

Goldman Sachs LeetCode Interview Questions | Grind Practice