Goldman Sachs SDE Sheet for Interview Preparation is a complete roadmap designed to help you prepare for Software Development Engineer interviews at Goldman Sachs. It covers the most frequently asked coding questions and core computer science concepts tested during the interview process.
- Master Goldman Sachs interview preparation with carefully selected DSA, system design, and problem-solving questions.
- Strengthen your coding skills by practicing company-specific interview problems across all major topics, from Arrays to Design.
Arrays
- Two Sum
- Subarray Sum Equals K
- Product of Array Except Self
- Best Time to Buy and Sell Stock
- Container With Most Water
- Search in Rotated Sorted Array
- Kth Largest Element in an Array
- Maximum Subarray
- 3Sum
- Next Permutation
Strings
- Longest Substring Without Repeating Characters
- Group Anagrams
- Decode String
- Decode Ways
- Word Break
- Top K Frequent Words
- String to Integer (atoi)
- Edit Distance
- Longest Palindromic Substring
Linked List
- Reverse Linked List
- Linked List Cycle
- Merge Two Sorted Lists
- Merge K Sorted Lists
- Intersection of Two Linked Lists
- Flattening a Linked List
- Add Two Numbers Represented by Linked Lists
- Delete a Node Without Head Pointer
- Clone Linked List with Random Pointer
- Reverse Linked List in Groups
Trees & BST
- Binary Tree Level Order Traversal
- Diameter of Binary Tree
- Check if Binary Tree is Height-Balanced
- Check if Binary Tree is a Sum Tree
- Check if Subtree
- Lowest Common Ancestor in Binary Tree
- Lowest Common Ancestor in BST
- Serialize and Deserialize Binary Tree
- Binary Tree Right View
- Check if a Binary Tree is a BST
Graphs
- Number of Islands
- Course Schedule II
- Rotting Oranges
- Breadth First Search (BFS)
- Depth First Search (DFS)
- Detect Cycle in an Undirected Graph
- Detect Cycle in a Directed Graph
- Topological Sorting
- Dijkstra's Shortest Path
Dynamic Programming
- Coin Change
- House Robber
- Climbing Stairs
- Longest Increasing Subsequence
- Partition Equal Subset Sum
- Egg Dropping Problem
- Maximum Sum Subarray
- Palindrome Partitioning
- Matrix Chain Multiplication
- Word Break
Searching & Sorting
- Median of Two Sorted Arrays
- K-th Element of Two Sorted Arrays
- Merge Intervals
- Merge Sort
- QuickSort
- Count Inversions in an Array
- Sort an Array of 0s, 1s and 2s
- Sort an Array in Wave Form
- Find Minimum in Sorted Rotated Array
- Find Peak Element
Hashing
- Longest Consecutive Sequence
- Subarray with Given XOR
- First Non-Repeating Character
- Count Pairs with Given Difference
- Check if Two Arrays are Equal
- Smallest Window Containing All Characters
- Count Frequency of Elements
- Longest Subarray with Given Sum
- Find All Pairs with Given Sum
Stack & Queue
- Valid Parentheses
- Sliding Window Maximum
- Implement Queue Using Stacks
- Implement Stack Using Queues
- Design Stack with getMin() in O(1)
- Largest Rectangular Area in Histogram
- Next Greater Element
- The Celebrity Problem
- Queue Implementation Using Array
Heap
- Find Median from Data Stream
- K Largest Elements in an Array
- Kth Smallest Element in a Matrix
- Connect N Ropes with Minimum Cost
- Smallest Range Covering Elements from K Lists
- Top K Frequent Elements
- Kth Largest Element
- Sort a Nearly Sorted Array
Backtracking
- Subsets
- Combination Sum
- Word Search
- N-Queens Problem
- Sudoku Solver
- Palindrome Partitioning
- Rat in a Maze
- Letter Combinations of a Phone Number
- Generate Parentheses
Greedy
- Gas Station
- Activity Selection Problem
- Meeting Rooms
- Minimum Number of Platforms
- Jump Game
- Fractional Knapsack
- Huffman Coding
- Job Sequencing with Deadlines
Trie
- Implement Trie
- Boggle Using Trie
- Longest Word in Dictionary
- Implement a Phone Directory
- Maximum XOR of Two Numbers
- Word Break Using Trie
- Auto-Complete System
- Pattern Matching Using Trie
Bit Manipulation
- Count Set Bits
- Check if Number is Power of Two
- Position of Rightmost Set Bit
- Single Number
- Count Bits to Flip
- Reverse Bits
- Check if All Bits are Set
- Find Two Non-Repeating Elements
- XOR of All Subarrays
- Generate Gray Codes
