Goldman Sachs Programming Challenge (OA)

Posted
19 Jul 2025
318 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.

How it went

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

Questions asked (2)

  1. 01

    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. 02

    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)

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Goldman Sachs recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!