Goldman Sachs Placement Papers 2026 with Solutions

Truth check — what actually matters for Goldman Sachs 2026

Goldman Sachs India's 2026 Engineering and Strats hiring sits at the top of the bank-quant compensation range, and the fresher funnel is one of the most selective in financial services. The bar matches FAANG-tier product hiring.

Candidates report the Bangalore and Hyderabad offices host most Engineering positions, with the Strats / Quant track running smaller-volume (high-double-digit hiring annually). The online assessment runs approximately 100 minutes across quantitative aptitude, logical reasoning, verbal, and roughly 2 to 3 coding problems.

What guides get wrong: the technical interview at Goldman is not a LeetCode marathon. It is a multi-round deep-dive across coding, technical-fundamentals, and quantitative reasoning at a level that catches pure-CS candidates off-guard. Probability, statistics, and linear algebra appear routinely even in engineering-track (not just Strats) roles -- candidate accounts on public preparation resources (Glassdoor, TeamBlind, LeetCode Discuss) confirm this pattern across recent cohorts.

The coding rounds tilt toward clean, defensive, production-quality code. Candidates who write fastest score lower than candidates who write thread-safe, edge-case-aware code with explicit error handling. Goldman is bank-grade, not move-fast startup-grade; code style matters in scoring.

The HM and behavioral rounds dig into decision-making under uncertainty. Standard STAR-format with bias toward concrete numerical examples (e.g., "I optimized this from O(N log N) to O(N) by..."). Quant-fluent storytelling differentiates.

If you have 2 weeks for Goldman Sachs Engineering only: 5 days of LeetCode-medium with clean-defensive-code emphasis; 3 days of probability + statistics + linear-algebra brush-up; 3 days of finance-fundamentals (bond pricing, basic options, P&L attribution); 3 days of behavioral with quant-fluent example STAR.

Sourcing note: Process details, eligibility, and compensation figures below are candidate-reported from public preparation resources and the official Goldman Sachs careers portal. Confirm current requirements on the official Goldman Sachs careers portal before applying.

Eligibility Criteria

Note: Eligibility criteria may vary slightly by campus and role. Always verify with your placement cell.

Selection Process

Goldman Sachs follows a rigorous, multi-round selection process designed to assess both technical depth and cultural fit:

1. Online Application / CV Shortlisting, Candidates apply through campus portals or Goldman Sachs careers website. CVs are screened based on CGPA, projects, internships, and skills.

2. HireVue / Online Assessment, A timed online test including quantitative aptitude, logical reasoning, and a coding section (1–2 problems). Duration: 90–120 minutes.

3. Technical Interview Round 1, Deep-dive into Data Structures & Algorithms (DSA), system design basics, and problem-solving. Expect live coding on a shared IDE.

4. Technical Interview Round 2, Advanced topics: OOP concepts, database design, operating systems, and sometimes a finance/domain-specific question. More senior interviewer involved.

5. HireVue Video Interview / Technical + Behavioral Mix, Some campuses include a video interview assessing communication skills, situational judgment, and motivation for Goldman Sachs.

6. HR / Partner Interview, Final round focusing on cultural fit, motivation, ethical decision-making, and career goals. Offers are typically extended within 48–72 hours post this round.

Exam Pattern

Negative marking: -0.25 for wrong answers in MCQ sections. No negative marking for coding.

Practice Questions with Detailed Solutions

Aptitude Questions

Q1. A bag contains 4 red balls and 6 blue balls. Two balls are drawn at random without replacement. What is the probability that both balls are red?

Solution:

Total balls = 10 P(first red) = 4/10 P(second red | first red) = 3/9

P(both red) = (4/10) × (3/9) = 12/90 = 2/15

Q2. A train travels from A to B at 60 km/h and returns at 40 km/h. What is the average speed for the entire journey?

Solution:

Average speed for equal distances = 2xy / (x + y) = (2 × 60 × 40) / (60 + 40) = 4800 / 100 = 48 km/h

Q3. If log₂(x) + log₂(x–6) = 4, find x.

Solution:

log₂[x(x–6)] = 4 x(x–6) = 2⁴ = 16 x² – 6x – 16 = 0 (x–8)(x+2) = 0 x = 8 (rejecting x = –2 since log of negative is undefined) x = 8

Q4. In how many ways can 6 people be arranged in a row such that two specific people always sit together?

Solution:

Treat the 2 specific people as 1 unit → 5 units to arrange Arrangements of 5 units = 5! = 120 The 2 people within the unit can swap = 2! = 2 Total = 120 × 2 = 240 ways

Q5. A sum of ₹8,000 is invested at 10% per annum compound interest. What is the amount after 2 years?

Solution:

A = P(1 + r/100)ⁿ A = 8000 × (1.1)² A = 8000 × 1.21 A = ₹9,680

Q6. Find the next term: 2, 6, 12, 20, 30, ___

Solution:

Differences: 4, 6, 8, 10 → next difference = 12 30 + 12 = 42

Pattern: n(n+1) → 1×2=2, 2×3=6, 3×4=12, 4×5=20, 5×6=30, 6×7=42

Q7. A cistern can be filled by pipe A in 10 hours and pipe B in 15 hours. Pipe C can empty it in 20 hours. If all three pipes are open simultaneously, how long to fill the cistern?

Solution:

Net rate = 1/10 + 1/15 – 1/20 LCM of 10, 15, 20 = 60 = 6/60 + 4/60 – 3/60 = 7/60

Time = 60/7 ≈ 8.57 hours (8 hours 34 minutes)

Q8. If x + y = 10 and x² + y² = 58, find xy.

Solution:

(x + y)² = x² + 2xy + y² 100 = 58 + 2xy 2xy = 42 xy = 21

Coding Questions

Q9. Find the longest substring without repeating characters.

Problem: Given a string s, find the length of the longest substring without repeating characters.

Solution (Sliding Window):

def lengthOfLongestSubstring(s):
    char_set = set()
    left = 0
    max_len = 0
    
    for right in range(len(s)):
        while s[right] in char_set:
            char_set.remove(s[left])
            left += 1
        char_set.add(s[right])
        max_len = max(max_len, right - left + 1)
    
    return max_len

# Example: s = "abcabcbb" → Output: 3 ("abc")

Time Complexity: O(n) | Space Complexity: O(min(n, k)) where k is character set size

Q10. Check if a binary tree is a Binary Search Tree (BST).

def isValidBST(root, min_val=float('-inf'), max_val=float('inf')):
    if not root:
        return True
    if root.val <= min_val or root.val >= max_val:
        return False
    return (isValidBST(root.left, min_val, root.val) and
            isValidBST(root.right, root.val, max_val))

# Time: O(n) | Space: O(h) where h is tree height

Q11. Find two numbers in an array that sum to a target.

def twoSum(nums, target):
    seen = {}
    for i, num in enumerate(nums):
        complement = target - num
        if complement in seen:
            return [seen[complement], i]
        seen[num] = i

# Example: nums=[2,7,11,15], target=9 → [0,1]
# Time: O(n) | Space: O(n)

Q12. Given a sorted array, find the number of occurrences of a target element.

def countOccurrences(arr, target):
    def first(arr, target):
        lo, hi, result = 0, len(arr)-1, -1
        while lo <= hi:
            mid = (lo + hi) // 2
            if arr[mid] == target:
                result = mid
                hi = mid - 1
            elif arr[mid] < target:
                lo = mid + 1
            else:
                hi = mid - 1
        return result

    def last(arr, target):
        lo, hi, result = 0, len(arr)-1, -1
        while lo <= hi:
            mid = (lo + hi) // 2
            if arr[mid] == target:
                result = mid
                lo = mid + 1
            elif arr[mid] < target:
                lo = mid + 1
            else:
                hi = mid - 1
        return result

    f, l = first(arr, target), last(arr, target)
    if f == -1:
        return 0
    return l - f + 1

# Time: O(log n) | Space: O(1)

Q13. Probability Puzzle, Goldman Sachs Classic

Problem: You have 50 red and 50 blue marbles. You want to maximize the probability of picking a red marble from a randomly chosen jar. You have 2 jars. How should you distribute the marbles?

Solution:

Put 1 red marble in Jar 1, and 49 red + 50 blue marbles in Jar 2.

P(red) = P(pick jar 1) × P(red from jar 1) + P(pick jar 2) × P(red from jar 2) = 0.5 × (1/1) + 0.5 × (49/99) = 0.5 + 0.5 × 0.4949 = 0.5 + 0.2475 ≈ 0.7475 (74.75%)

This is significantly better than 50/100 = 50%.

Q14. Merge two sorted linked lists.

def mergeTwoLists(l1, l2):
    dummy = ListNode(0)
    curr = dummy
    while l1 and l2:
        if l1.val <= l2.val:
            curr.next = l1
            l1 = l1.next
        else:
            curr.next = l2
            l2 = l2.next
        curr = curr.next
    curr.next = l1 or l2
    return dummy.next

# Time: O(m+n) | Space: O(1)

Q15. A clock shows 3:15. What is the angle between the hour and minute hands?

Solution:

Minute hand at 15 min = 15 × 6° = 90° Hour hand at 3:15 = 3 × 30° + (15/60) × 30° = 90° + 7.5° = 97.5°

Angle between them = |97.5° – 90°| = 7.5°

HR Interview Questions & Sample Answers

Q1. Why Goldman Sachs specifically?

Sample Answer: "Goldman Sachs represents the intersection of finance and technology in the most sophisticated way. I'm particularly drawn to how the Engineering division here isn't just building internal tools, it's powering global markets. My passion for building high-performance, reliable systems aligns perfectly with what GS does at scale. Moreover, the emphasis on intellectual rigor and the caliber of colleagues here is genuinely exciting to me."

Q2. Describe a situation where you had to make a decision with incomplete information.

Sample Answer: "During my final-year project, we needed to choose between two ML architectures midway through, and we had limited time to evaluate both properly. I gathered the most critical metrics, inference time, accuracy on a validation subset, and implementation complexity, and made a structured decision with my team, documenting our assumptions. We were right to proceed with the transformer-based approach, and we discussed what we'd revisit if time permitted. GS's fast-moving environment will require exactly this kind of informed decision-making under uncertainty."

Q3. How do you handle working under pressure?

Sample Answer: "I thrive under pressure when I'm organized. During exam season combined with hackathon prep, I used time-blocking rigorously, protecting deep work hours and allocating buffer time for unexpected issues. At Goldman Sachs, where market conditions can create sudden urgency, I'd apply the same principle: clear prioritization, calm execution, and proactive communication with the team."

Q4. What is your biggest weakness?

Sample Answer: "I used to over-engineer solutions, spending too much time making something perfect rather than shipping a good-enough version. I recognized this during a group project and actively started using 'time-boxes' for design decisions. I've improved significantly, and I now balance perfectionism with pragmatism."

Q5. Where do you see yourself in 5 years?

Sample Answer: "I want to become a senior engineer with deep expertise in distributed financial systems, ideally having contributed to one of Goldman Sachs' major trading or risk platforms. I also hope to mentor junior engineers and contribute to architectural decisions. The rotational programs and the caliber of mentors at GS make this trajectory realistic and exciting."

Preparation Tips

• Master DSA fundamentals: Practice 150+ problems on LeetCode (Easy/Medium). Focus on arrays, linked lists, trees, graphs, DP, and sliding window.
• Study probability deeply: Goldman Sachs loves probability puzzles, especially in quant roles. Practice brainteasers from "Heard on The Street" and "A Practical Guide to Quantitative Finance Interviews."
• Know your projects cold: Every line on your resume is fair game. Be ready to explain design choices, scale considerations, and what you'd do differently.
• Read GS's financial reports and news: Understanding their business lines (IBD, Sales & Trading, Asset Management) helps you ask smart questions and answer "Why GS?" authentically.
• Practice mental math: Quick calculations without a calculator are common in quant and finance interviews.
• Mock interviews: Use Pramp, Interviewing.io, or peer sessions. Goldman Sachs interviewers appreciate clean communication, not just correct code.
• Behavioral prep: Use STAR format (Situation, Task, Action, Result) for all behavioral questions. Prepare 5–6 strong stories covering leadership, failure, teamwork, and innovation.

🎯 Live Mock Test, May 2026 Edition

5 original questions written by Aditya Sharma, calibrated to the Goldman Sachs 2026 batch difficulty. Click any option to lock your answer; solutions reveal after.