Reddit Question · Oct 2025 · Bangalore

Interview Experience | Goldman Sachs | Software Engineering Analyst | 1.2 YOE

10 upvotes 8 replies

Question Details

Application: Recruiter reached out to me over email with job link (Job location was of Bangalore, India) and the HackerRank assessment link. I applied through that and completed the online test. *

Full Details

Application: Recruiter reached out to me over email with job link (Job location was of Bangalore, India) and the HackerRank assessment link. I applied through that and completed the online test.

**

Round 1 Online Assessment (HackerRank)** There were 2 coding questions: Q1: Easy-level math-based question involving modular arithmetic. Q2: Array + logic-based combinatorics problem (medium difficulty). I was able to solve both completely.

**

Round 2 CoderPad Technical Round** Platform: CoderPad (Live Coding) Q1: Max IP Count problem - involved handling log data and finding the IP address with maximum count. Discussed multiple follow-ups and corner cases. Q2: Grid-based Dynamic Programming problem - standard variation requiring counting paths with maximum value (classic DP grid traversal pattern). I solved both problems, though I was slightly stuck on one of the follow-up questions in Problem 1.

**

Round 3 Superday Round (Data Structures)** This was a live virtual panel round with 2 interviewers. Q1: Median of Two Sorted Arrays - discussed brute-force, optimal binary search approach, and time/space complexity. Q2: Longest Substring Without Repeating Characters - explained brute-force and optimized sliding window approach, also covered complexity analysis. Round went well - I was able to explain my thought process, and the interviewer seemed satisfied, mentioning “good” a couple of times.

Result: After this round, I was informed that I was not shortlisted for further Superday rounds.

About This Question

This is a reported interview question from a goldman sachs interview for a swe role during the oa round reported in 2025.

It covers the following topics: Arrays, Binary Search, Dynamic Programming, Matrix, Sliding Window, Strings, Two Pointers .

Difficulty rating: Easy