Goldman Sachs Coding Questions - DSA Problems & Solutions

Company Overview

This page contains Goldman Sachs coding questions from Goldman Sachs OA placement papers with detailed solutions.

Coding Focus

Goldman Sachs OA coding section includes 2-3 problems focusing on DSA. Master arrays, trees, graphs, and dynamic programming to succeed.

Goldman Sachs Coding Questions Overview

Goldman Sachs OA Coding Section:

• Problems: 2-3 coding problems
• Time: 60 minutes
• Languages: C, C++, Java, Python

Coding Problems

Question 1: Stock Buy Sell

Q1: Find the maximum profit from buying and selling stock.

Solution (Java):

public int maxProfit(int[] prices) {
    int minPrice = Integer.MAX_VALUE;
    int maxProfit = 0;

    for (int price : prices) {
        if (price < minPrice) {
            minPrice = price;
        } else if (price - minPrice > maxProfit) {
            maxProfit = price - minPrice;
        }
    }

    return maxProfit;
}

Time Complexity: O(n)

Related Resources

Goldman Sachs 2024 Papers

Previous year papers with coding questions

View 2024 Papers →

Goldman Sachs Main Page

Complete Goldman Sachs placement guide

View Main Page →

---

Practice Goldman Sachs coding questions regularly!