Here are the top LeetCode problems frequently asked by **Goldman Sachs**: - [868. Binary Gap]() - [3766. Minimum Operations to Make Binary Palindrome]() - [3389. Minimum Operations to Make Character Frequencies Equal]() - [2193. Minimum Number of Moves to Make Palindrome]() - [91. Decode Ways]() - [518. Coin Change II]() - [1209. Remove All Adjacent Duplicates in String II]() - [647. Palindromic Substrings]() - [3470. Permutations IV]() - [1413. Minimum Value to Get Positive Step by Step Sum]() - [532. K-diff Pairs in an Array]() - [1041. Robot Bounded In Circle]() - [127. Word Ladder]() - [706. Design HashMap]() - [64. Minimum Path Sum]() - [387. First Unique Character in a String]() - [2351. First Letter to Appear Twice]() - [42. Trapping Rain Water]() - [121. Best Time to Buy and Sell Stock]() - [1. Two Sum]() - [443. String Compression]() - [1446. Consecutive Characters]() - [787. Cheapest Flights Within K Stops]() - [236. Lowest Common Ancestor of a Binary Tree]() - [863. All Nodes Distance K in Binary Tree]() - [3. Longest Substring Without Repeating Characters]() - [49. Group Anagrams]() - [23. Merge k Sorted Lists]() - [41. First Missing Positive]() - [20. Valid Parentheses]() - [938. Range Sum of BST]() - [232. Implement Queue using Stacks]() - [205. Isomorphic Strings]() - [53. Maximum Subarray]() - [1823. Find the Winner of the Circular Game]() - [166. Fraction to Recurring Decimal]() - [657. Robot Return to Origin]() - [124. Binary Tree Maximum Path Sum]() > Note: Data is gathered from hundreds of real candidates' interview experiences and is **updated monthly** to ensure accuracy and timeliness.

Top Goldman Sachs Leetcode Problems (2026)