Goldman Sachs OA + Interview Experience
- Posted
- 26 Sept 2026
Summary
I applied for the 2027 Summer Analyst position, completed the online assessment and the first interview round, but was not selected for the second round.
How it went
I applied for 2027 summer analyst position (on campus)
OA patern:
1) MCQs on cs fundamentals (with negative marking)
2) 3 coding question-
(i) Longest Palindromic subsequence (15/15 passed)
(ii) Problem related to merge intervals (9/15 passed)
(iii) Don't remeber exact problem but it was from trees (not attempted)
14/800+ students selected for interview
Interview Round 1:
1) question to identify data structure used to store transactions.
2) RAG achitecture explanation which i used in my project.
3) Trapping Rain water question.
[Common ques asked to other candidates - Dijkstra, meeting rooms question, dp on stocks, anagram question, subset sum equal to target]
Not qualified for round 2.
Number of candidates selected=3
Questions asked (9)
- 01
Longest Palindromic Subsequence
Data Structures & Algorithms
Given a string, find the length of the longest subsequence that is also a palindrome.
- 02
Trapping Rain Water
Data Structures & Algorithms
Given an array of non‑negative integers representing elevation map where the width of each bar is 1, compute how much water it can trap after raining.
- 03
Dijkstra's Shortest Path
Data Structures & Algorithms
Implement Dijkstra's algorithm to find the shortest path from a source vertex to all other vertices in a weighted graph with non‑negative edge weights.
- 04
Meeting Rooms
Data Structures & Algorithms
Given an array of meeting time intervals consisting of start and end times, determine if a person can attend all meetings without overlaps.
- 05
Best Time to Buy and Sell Stock (DP)
Data Structures & Algorithms
Given an array where the i‑th element is the price of a given stock on day i, compute the maximum profit you can achieve. You may complete as many transactions as you like (buy and sell multiple times).
- 06
Anagram Check
Data Structures & Algorithms
Given two strings, determine if one is an anagram of the other (i.e., they contain the same characters in a possibly different order).
- 07
Subset Sum Equal to Target
Data Structures & Algorithms
Given a set of positive integers and a target sum, determine if there is a subset of the numbers that adds up exactly to the target.
- 08
Identify Data Structure for Transactions
Data Structures & Algorithms
Explain which data structure would be most appropriate to store a sequence of financial transactions and why.
- 09
RAG Architecture Explanation
System Design
Describe the Retrieval‑Augmented Generation (RAG) architecture, its components, and how it is used in a project.