Goldman Sachs CoderPad Interview | Goldman Sachs OA | Goldman on 1point3acres

1,658 Views

Goldman Sachs 's interview with Goldman Sachs has always been known as "difficult", not only the Behavioral part will dig into the details, the Technical is also examined quite strictly, almost do not give any room for chance. Therefore, if you want to get an interview with Goldman Sachs, you have to make sufficient and comprehensive preparations.

Their technical interviews are usually coding questions on CoderPad, which is a true reproduction of the working scenario. This week I just supported a student to complete the Goldman Sachs OA + VO, and organized the latest test points and process to give you a visual reference.

Goldman Sachs CoderPad Interview | Goldman Sachs OA | Goldman on 1point3acres

OA 2 Coding + 9 Math Multiple Choice Questions

CoderPad 1:Area of box, given 2d array queries with [[row, col]], how many boxes can be formed for each query? A box is a a × a box for 1 ≤ a ≤ min(row, col)

  • The solution to this problem is not difficult, the main thing is to find the law, draw it out and finished, the formula is (row - a + 1) * (col - a + 1)The code is a few lines long and simple, just find all the possible squares and add them up.
def count_squares_for_queries(queries).
    results = []

    for row, col in queries.
        total_squares = 0
        max_size = min(row, col)

        for a in range(1, max_size + 1): total_squares += (row - a + 1) * (col - a + 1).
            total_squares += (row - a + 1) * (col - a + 1)

        results.append(total_squares)

    return results

CoderPad 2:Longest subarray, give the maximum length of subarray with sum ≤ k

  • Use a sliding window, keep moving the left and right pointers, and just use a variable to record the maximum subarray length.
def longest_subarray_with_sum_at_most_k(nums, k):
    left = 0
    current_sum = 0
    max_length = 0

    for right in range(len(nums)): current_sum += nums[k].
        current_sum += nums[right].

        while current_sum > k: current_sum -= nums[left].
            current_sum -= nums[left]: current_sum += nums[right].
            left += 1

        max_length = max(max_length, right - left + 1)

    return max_length

Next up were the math multiple choice questions, which were 9 questions in total and took about 40 minutes to complete.

  1. Shake the dice 456 your opponent's gets a point 123 you get a point, the winner must get to 5 or more and have a score 2 greater than your opponent's. Now it's a 5 tie, what's the probability that I win?
  2. 5 random poker cards, 3 are aces, ask the probability that 4 are aces
  3. Finding the general term of a series given an integral
  4. Finding the derivative of an integral
  5. A system of 3 × 3 linear equations, asking whether the solutions are CONSISTENT and UNIQUE
  6. Shake the dice. Shake to 1 to reroll and ask the probability of winning if the tie is lost
  7. path integral (math.)
  8. Give 3 statements of algebra to determine right or wrong. Related to eigenvalue, determinant and identity matrix.
  9. Sum of 100 Bernoulli variables with p=0.5 to find the probability of less than 60

Hirevue issues

Goldman's Hirevue has a total of six questions, 45 seconds to prepare before the interview, and 2 minutes to answer a question, which is still quite tight!
1. Walk through your resume
2. Working with someone who was not completing his or her part. What did you do?
3. A time you met a high challenge goal that someone else thought you could not make it
4. A time you turned down a project or opportunity because you have a conflict
5. You decide to take extra class and you are overwhelmed. You are doing an individual project that prohibits teamwork and your classmate want to help you? You are doing an individual project that prohibits teamwork and your classmate want to help you?
6. How do you debug?

Read More

Goldman Sachs Interview Preparation

Goldman Sachs Coderpad OA | Acreage

Contact Us

Through this full-process guidance, many students not only successfully cleared Goldman’s OA and interviews, but also truly refined their thinking and honed their communication along the way. What interviewers see isn’t just your code—it’s your ability to think clearly and communicate effectively when facing complex problems. That’s actually what they value the most. Wishing everyone to bring this calm confidence into their interviews and land their dream offers! I hope you all approach your interviews with this clarity and self-assurance—and feel free toContact us,and tackle the next stage just as smoothly and confidently!

author avatar
Alex Ma Staff Software Engineer
Currently working at Google, with more than 10 years of development experience, currently serving as Senior Solution Architect. He has a bachelor's degree in computer science from Peking University and is good at various algorithms, Java, C++ and other programming languages. While in school, he participated in many competitions such as ACM and Tianchi Big Data, and owned a number of top papers and patents.
END