Skip to content
Placement Papers - Free Placement Papers for Top CompaniesPlacement Papers - Free Placement Papers for Top CompaniesPlacement Papers

Goldman Sachs Placement Papers 2024

This page contains actual Goldman Sachs placement papers from 2024 with 30+ questions from HackerRank assessment and interviews.

Goldman Sachs 2024 assessment pattern

Round Duration Content
HackerRank OA 120 min 2-3 coding + aptitude MCQs
Technical 1 60 min DSA + project
Technical 2 60 min DSA + CS fundamentals
HR 45 min Behavioral + finance interest

Goldman Sachs Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Goldman Sachs placement papers 2024 (previous-year pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1

Q1: Pipe A fills a tank in 12 hours, pipe B in 18 hours. How long to fill together?

Solution:

Combined rate = 1/12 + 1/18 = (12+18)/(12×18). Time = 12×18/(12+18) = 7.2 hours.

Answer: 7.2 hours

Question 2

Q2: A and B together finish a job in 8 days. B alone takes 24 days. How many days does A alone take?

Solution:

Together rate = 1/8. B’s rate = 1/24.

A’s rate = 1/8 − 1/24 = (24−8)/(8×24) = 16/192. Days for A alone = 192/16 = 12 days.

Answer: 12 days

Question 3

Q3: Simple interest on ₹8000 at 10% per annum for 2 years is?

Solution:

SI = (P × R × T)/100 = (8000 × 10 × 2)/100 = ₹1600.

Answer: ₹1600

Question 4

Q4: A train 180 m long crosses a pole in 12 seconds. Find its speed in km/h.

Solution:

Speed = distance/time = 180/12 m/s = (180/12) × (18/5) = 54 km/h.

Answer: 54 km/h

Question 5

Q5: Find the next number in the series: 7, 10, 15, 22, 31, ?

Solution:

Pattern: Differences +3,+5,+7,+9 → next +11

Next term = 42.

Answer: 42

Question 6

Q6: If in a certain code CAT is written as 3120 and DOG as 4157, how is BAT written?

Solution:

Pattern: letter positions: B=2,A=1,T=20

Therefore BAT → 2120.

Answer: 2120

Question 7

Q7: Identify the error: ‘Neither of the boys have submitted their assignment.’

Solution:

‘Neither’ is singular → verb should be has, not have.

Correct: Neither of the boys has submitted his/their assignment.

Answer: have → has

Question 8

Q8: Fill in the blank: ‘She has been working here _____ 2019.’

Solution:

Use since with a point in time; use for with a duration.

Correct: since.

Answer: since

Question 9: binary tree level order

Show solution

Problem Statement: Return the level-order traversal of a binary tree.

Example:

Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Solution (Java):

public List<List<Integer>> levelOrder(TreeNode root) {
    List<List<Integer>> res = new ArrayList<>();
    if (root == null) return res;
    Queue<TreeNode> q = new ArrayDeque<>();
    q.add(root);
    while (!q.isEmpty()) {
        int sz = q.size();
        List<Integer> level = new ArrayList<>();
        for (int i = 0; i < sz; i++) {
            TreeNode n = q.poll();
            level.add(n.val);
            if (n.left != null) q.add(n.left);
            if (n.right != null) q.add(n.right);
        }
        res.add(level);
    }
    return res;
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 10: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 11: rotate array right by k

Show solution

Problem Statement: Rotate the array to the right by k steps.

Example:

Input: [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]

Solution (Java):

public void rotate(int[] nums, int k) {
    k %= nums.length;
    reverse(nums, 0, nums.length - 1);
    reverse(nums, 0, k - 1);
    reverse(nums, k, nums.length - 1);
}
void reverse(int[] a, int l, int r) {
    while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }
}

Time Complexity: O(n)
Space Complexity: O(1)

Key insights 2024

  1. Math Heavy: Strong focus on probability, statistics, finance basics
  2. Stock Problems: Common theme - buy/sell variations
  3. Medium-Hard DSA: Expect binary search, DP, graphs
  4. Finance Interest: HR asks about interest in financial markets
  5. Optimal Solutions: Need efficient algorithms (O(n), O(n log n))

Comments & Suggestions

2025 papers

Coding questions

Preparation guide

Goldman Sachs hub

Similar companies

JP Morgan · Morgan Stanley · Deutsche Bank · Bank of America · Capital One · Wells Fargo