Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Home

Goldman Sachs Interview Questions | DSA Corner | Talentd

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

DSA Corner

Dashboard Questions Topics Companies Sheets

Goldman Sachs Interview Questions

120 coding problems asked in Goldman Sachs interviews. Prepare for your technical interview with real questions.

120

Problems

32

Easy

74

Medium

14

Hard

Difficulty

All120 Easy32 Medium74 Hard14

Status	Title	Video	Leetcode	Solve	Difficulty	Companies	Topics
	1535. Find the Winner of an Array Game			Solve	Medium	Amazon+5	Array Simulation
	1631. Path With Minimum Effort			Solve	Medium	Amazon+7	Array Binary Search+5
	1750. Minimum Length of String After Deleting Similar Ends			Solve	Medium	Goldman Sachs	String Two Pointers
	1771. Maximize Palindrome Length From Subsequences			Solve	Hard	Goldman Sachs	Dynamic Programming String
	1823. Find the Winner of the Circular Game			Solve	Medium	Bloomberg+1	Array Math+3
	1832. Check if the Sentence Is Pangram			Solve	Easy	Facebook+1	Hash Table String
	1836. Remove Duplicates From an Unsorted Linked List			Solve	Medium	Goldman Sachs+1	Hash Table Linked List
	2087. Minimum Cost Homecoming of a Robot in a Grid			Solve	Medium	Amazon+2	Array Greedy
	2097. Valid Arrangement of Pairs			Solve	Hard	Goldman Sachs	Depth-First Search Eulerian Circuit+1
	2154. Keep Multiplying Found Values by Two			Solve	Easy	Goldman Sachs	Array Hash Table+2
	2191. Sort the Jumbled Numbers			Solve	Medium	Goldman Sachs	Array Sorting
	2266. Count Number of Texts			Solve	Medium	Amazon+1	Dynamic Programming Hash Table+2
	2300. Successful Pairs of Spells and Potions			Solve	Medium	Goldman Sachs	Array Binary Search+2
	2375. Construct Smallest Number From DI String			Solve	Medium	Amazon+1	Backtracking Greedy+2
	2420. Find All Good Indices			Solve	Medium	Amazon+3	Array Dynamic Programming+1
	2438. Range Product Queries of Powers			Solve	Medium	Goldman Sachs	Array Bit Manipulation+1
	2446. Determine if Two Events Have Conflict			Solve	Easy	Goldman Sachs+1	Array String
	2484. Count Palindromic Subsequences			Solve	Hard	Atlassian+2	Dynamic Programming String
	2513. Minimize the Maximum of Two Arrays			Solve	Medium	Goldman Sachs	Binary Search Math+1
	2550. Count Collisions of Monkeys on a Polygon			Solve	Medium	Goldman Sachs	Math Recursion

Find the Winner of an Array Game

Medium✓ Solution📹 Video

Amazon+5

Array Simulation

Path With Minimum Effort

Medium✓ Solution📹 Video

Amazon+7

Array Binary Search Breadth-First Search+4

Minimum Length of String After Deleting Similar Ends

Medium✓ Solution📹 Video

Goldman Sachs

String Two Pointers

Maximize Palindrome Length From Subsequences

Hard📹 Video

Goldman Sachs

Dynamic Programming String

Find the Winner of the Circular Game

Medium✓ Solution📹 Video

Bloomberg+1

Array Math Queue+2

Check if the Sentence Is Pangram

Easy✓ Solution📹 Video

Facebook+1

Hash Table String

Remove Duplicates From an Unsorted Linked List

Medium✓ Solution📹 Video

Goldman Sachs+1

Hash Table Linked List

Minimum Cost Homecoming of a Robot in a Grid

Medium📹 Video

Amazon+2

Valid Arrangement of Pairs

Hard✓ Solution📹 Video

Goldman Sachs

Depth-First Search Eulerian Circuit Graph

Keep Multiplying Found Values by Two

Easy📹 Video

Goldman Sachs

Array Hash Table Simulation+1

Sort the Jumbled Numbers

Medium✓ Solution📹 Video

Goldman Sachs

Count Number of Texts

Medium📹 Video

Amazon+1

Dynamic Programming Hash Table Math+1

Successful Pairs of Spells and Potions

Medium✓ Solution📹 Video

Goldman Sachs

Array Binary Search Sorting+1

Construct Smallest Number From DI String

Medium📹 Video

Amazon+1

Backtracking Greedy Stack+1

Find All Good Indices

Medium📹 Video

Amazon+3

Array Dynamic Programming Prefix Sum

Range Product Queries of Powers

Medium📹 Video

Goldman Sachs

Array Bit Manipulation Prefix Sum

Determine if Two Events Have Conflict

Easy📹 Video

Goldman Sachs+1

Count Palindromic Subsequences

Hard📹 Video

Atlassian+2

Dynamic Programming String

Minimize the Maximum of Two Arrays

Medium📹 Video

Goldman Sachs

Binary Search Math Number Theory

Count Collisions of Monkeys on a Polygon

Medium📹 Video

Goldman Sachs

Page 3 of 3