Goldman Sachs Programming Challenge (OA)
July 19, 2025 · 48 reads
Summary
I appeared for a Goldman Sachs Online Assessment today after being reached out to by a recruiter on LinkedIn. I successfully solved both programming challenges within 50 minutes.
Full Experience
Appeared for GS OA today Recruiter had reached out via LinkedIn Was able to solve both in about 50 mins. Lets see what happens next
Interview Questions (2)
1.
Number of Cores Needed (CPU Scheduling)
Data Structures & Algorithms
Two arrays, start and end time were given which represented the process's start and end time. An O(n log n) solution was expected.
2.
Longest Subsequence with K XOR Sum
Data Structures & Algorithms
Find the length of the longest subsequence such that XOR of adjacent elements is equal to K. An O(n) solution was expected. (Referenced GFG - GeeksforGeeks)