Goldman Sachs OA Interview｜Questions + Practice + Programhelp Remote Recording

Every year when it comes to summer internship season, Goldman Sachs's Summer Analyst Program is the dream offer for countless CS / DS / Quant majors. The Summer Analyst Program at Goldman Sachs is the dream offer for countless CS / DS / Quant majors.
Not just because of the big company's aura, but also because of the great program exposure, high transfer rate, and good opportunities to jump outside of the school recruiting process.

OA Process & Question Types Overview

Problem 1: Find the Damaged Toy

Problem

At a birthday party. N kids (numbered from 1 to N) are sitting in a circle. The host has T toys and starts distributing them one at a time, beginning with the kid with ID DAfter reaching kid N, the count wraps around to kid 1.

You are to find out which kid will get the last (damaged) toy.

Input

• N: Total number of kids
• T: Number of toys
• D: Starting ID of the kid

Output

The ID of the kid who receives the last toy (damaged one).

Example

Input: N = 5, T = 2, D = 1
Output: 2

Explanation

• First toy → Kid 1
• Second toy → Kid 2 (this is the damaged one)

Problem 2: Encode or Decode Message

Problem

You are given a message (string) and a key (positive integer). Your task is to either encode or decode the message based on a given operation type.

• 1 = Encode: For each character, repeat it key[i] times (cyclically).
• 2 = Decode: Compress repeated characters based on the digits of the key (cyclically). If the pattern doesn't match the key, return -1.

Input

• Operation type. 1 (Encode) or 2 (Decode)
• Message (string)
• Key (positive integer)

Output

Transformed string, or -1 for invalid decoding.

Examples

Input: operation = 1, message = "Open", key = 123
Output: "Oppeen"

Input: operation = 2, message = "Oppeen", key = 123
Output: "Open"

Notes

• If the key is shorter than the message, repeat the key cyclically.
• For decoding, if the actual repeats don't match the expected key digits, return -1.

Problem 3: Minimum Moves in a Maze

Problem

There is an n × m maze (grid), where.

• 0 = Empty cell
• 1 = Obstacle

You are at (0, 0) and want to reach (n - 1, m - 1). You can move in four directions (up, down, left, right), and in one move, jump 1 to k steps in that direction only if all the jumped-over cells are 0.

Function Signature

def getMinimumMoves(maze: List[List[int]], k: int) -> int

Output

Return the minimum number of moves needed to reach the end, or -1 if impossible.

Examples

Input: maze = [[0,1],[1,0]], k = 2
Output: 2

Input: maze = [[0,0,0],[1,0,0],[1,0,0]], k = 5
Output: 2

Input: maze = [[0,1,0],[1,0,0],[1,0,0]], k = 5
Output: -1

Constraints

• 1 ≤ n, m ≤ 100
• 1 ≤ k ≤ 100
• Maze contains only 0 or 1

Summary Advice + Tips for White Whoring

Prepare recommendations

• Clear direction: GS prefers to test detailing skills, so we recommend focusing on LeetCode high-frequency medium questions + math/logic questions;
• Verbal Expression Cannot Be Missed: Although OA is not a VO, HackerRank has screen recording + microphone monitoring, so it is recommended to train the expression of thoughts appropriately;
• English review skills should be practiced: some of the questions are not concise, it is recommended to brush up on the "semantically unclear" LeetCode English original questions before the exam.

Programhelp Strength of escort｜From OA to final interview, we accompany the whole process.

Goldman Sachs' OA not only examines your understanding of algorithms and logic, but also emphasizes time management and the ability to think in parallel with multiple questions.

we use no-trace remote assistance + real-time voice reminders to really solve the "can't do it" or "no time to finish" problem when you are facing high-pressure OA or online interviews.
Multi-platform proficiency, including HackerRank, Codility, CodeSignal, Karat, etc.

We have helped more than 3,000 students to pass OA and get offers from Goldman Sachs, JP Morgan, Citadel, Two Sigma, etc.

ProgramHelp

See Full Bio