CoderPad round with goldman Sachs
- Posted
- 4 Jun 2025
Summary
I had a CoderPad round with Goldman Sachs, where I was asked two questions: one on activity selection and another on finding the shortest path between stations. I was able to solve both questions with optimized solutions.
How it went
Hi folks,
I had my coderpad round with Goldman sachs two days back, I was asked two questions:-
- Find the maximum number of non-overlapping activities, given their start and end times
- Given a source and destination, print all the stations in the shortest path between them.
I was able to solve both the questions with optimized solutions.
Questions asked (2)
- 01
Maximum Non-Overlapping Activities
Data Structures & Algorithms · Medium
Find the maximum number of non-overlapping activities, given their start and end times
- 02
Shortest Path Stations
Data Structures & Algorithms · Medium
Given a source and destination, print all the stations in the shortest path between them.