Online Assesment Question 1: Question on string subsequence [Easy]\u2705 Question 2: Monotonic Stack and string (https://leetcode.com/problems/construct-smallest-number-from-di-string/description/)\u2705 **Round 1 Question 1: String [Easy]\u2705 Question 2: Find the Shortest path from 1 city to another [Medium]\u2705 Round 2** Question...

LeetCode Experience · Mar 2025 · Los Angeles

Goldman Sachs | Interview Experience

SWE Phone Screen Easy

19 views 2 replies

Interview Experience

Online Assesment Question 1: Question on string subsequence [Easy]\u2705 Question 2: Monotonic Stack and string ( Round 1 Question 1: String [Easy]\u2705 Question 2: Find the Shortest path from 1 city to another [Medium]\u2705 Round 2 Question...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Graph Stack Strings

More from Goldman Sachs

1p3a Goldman Sachs Software Engineer Superday and DSA Interview Experience 1p3a Goldman Sachs Data Engineer Associate Interview Experience (2024) 1p3a Goldman Sachs Associate Onsite Interview Experience LeetCode Goldman Sachs | Associate | NYC LeetCode Goldman Sachs Interview problem

← All Goldman Sachs questions Goldman Sachs Software Engineer Questions → All Algorithms Questions →