Goldman Sachs Dynamic Programming Questions

56 dynamic programming problems asked at Goldman Sachs interviews

Easy (5)Medium (32)Hard (19)

Questions

TitleDifficulty
Trapping Rain WaterHard
Minimum Path SumMedium
Decode WaysMedium
Best Time to Buy and Sell StockEasy
Knight Probability in ChessboardMedium
Best Time to Buy and Sell Stock IIMedium
Maximum SubarrayMedium
Pascal's TriangleEasy
Count Palindromic SubsequencesHard
Minimum Falling Path SumMedium
Find All Good IndicesMedium
Maximize Palindrome Length From SubsequencesHard
Count Number of TextsMedium
Optimal Account BalancingHard
Palindromic SubstringsMedium
Coin ChangeMedium
Jump GameMedium
Allocate MailboxesHard
Longest Palindromic SubstringMedium
Unique PathsMedium
House RobberMedium
Maximum Profit in Job SchedulingHard
Generate ParenthesesMedium
Binary Tree CamerasHard
Maximal RectangleHard
Climbing StairsEasy
Maximum Product SubarrayMedium
Russian Doll EnvelopesHard
Best Time to Buy and Sell Stock IVHard
Maximal SquareMedium
Count Number of TeamsMedium
Binary Tree Maximum Path SumHard
Partition Equal Subset SumMedium
Best Time to Buy and Sell Stock IIIHard
Greatest Sum Divisible by ThreeMedium
Minimum Number of Refueling StopsHard
Jump Game IIMedium
Valid Parenthesis StringMedium
Pascal's Triangle IIEasy
Longest Increasing SubsequenceMedium
Count of IntegersHard
Word BreakMedium
Ugly Number IIMedium
Maximum Sum Circular SubarrayMedium
TriangleMedium
Burst BalloonsHard
Non-overlapping IntervalsMedium
Length of Longest Fibonacci SubsequenceMedium
Longest Palindromic SubsequenceMedium
Cherry PickupHard
Perfect SquaresMedium
Count Square Submatrices with All OnesMedium
Minimum Insertion Steps to Make a String PalindromeHard
Is SubsequenceEasy
Kth Ancestor of a Tree NodeHard
Split Array Largest SumHard

Showing 56 questions