Interview Experience Analysis for Goldman%20Sachs

**OA:** 2 questions were asked. Both were Leetcode medium difficulty. Only DSA questions. **Coderpad Round:** There are some set of people represented as graph(Uni-directional and no cycles). Each people has a id. Given a id of a person, that person gets the virus. Ret...

Most important tip: Be very careful in resume. Example if you had put a word 'caching'. Let's say you worked **only** in write-through cache. But still they might ask different cache mechanism types, different cache eviction policies or anything. When you a put a word in resume, make sure you know i...

## Coderpad round - 1 Was asked to solve 2 DSA questions - 1. Basically an easier version of https://algo.monster/liteproblems/1804 with only `insert(word)` and `countWordsStartingWith(prefix)` 2. Find the size of the largest connected component in a forest. ## Coderpad round - 2 Was asked to sol...

I recently interviewed with Goldman Sachs for an Analyst role in Bangalore and wanted to share my experience and the type of questions I faced. 📋 Process Overview Online Assessment (OA) (Hackerrank) Standard coding problems focused on arrays, strings, and time/space complexity. CoderPad Screening ...

GS Applied Through Referral OA Two medium level leetcode questions CoderPad - 1 (1 Hr C++) 1. Trie based question 2. Simple Dfs based question Round - 1 (DSA)(1 Hr C++) 1. Some resume based questions 2. Dsa question - based on hashmap 3. Binary Search tree question + two pointers Round...

Interview Mode: OnlineMonth: June 2025 - August 2025Process: Online Assessment + 4 Rounds (Technical ~1 hour) + HM round (~30 min)Location: BangaloreYOE: 3 yearsOnline Assessment2 Questions (LeetCode style)1 easy1 medium (time complexity focused)Cleared and got mail in ~3 days for interviews.Round 1...

Interviewer joined on time and started with introduction.I was aksed two questions:Given a string, find all the unique substrings of length 'len'.As a follow up interviewer asked to handle multiple edge cases through exception handling.Given a forest ( one or more disconnected trees ), find the root...

YOE-3 , Recuriter reached out to me , Position was for Data Engineer(Hadoop/Spark) Roud1(HackerRank) : - Medium level Stack based question - Medium level Slinding Window question Round2(CoderPad) : - Given list of Child->Parent(Trees) relations in a forest , Need to find the number of unconnec...

Current Company - Service Based Current Compensation - 8 LPA YOE - 3 yrs I applied directly on their portal and recruiter reached out to me and shared a test link which was on HackerRank. **1st Round - OA** There were 2 Medium questions in this test. **2nd Round - Coding(Codepad)** Interviewer ca...