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

Once a year, during the summer internship hiring season, theGoldman SachsThe Summer Analyst Program has been a dream offer for countless CS / DS / Quant majors.
It is not only because of the big factory's aura, but also because of the large project exposure, high transfer rate, and the good jumping outside the school recruitment. Because of this, the competition for OA at GS is super fierce, and many people start to brush up the questions and find someone to mock a few months in advance.
Below is a complete OA process breakdown of a student assisted by us at Programhelp, with question recall, practical tips and details of our remote and untraceable online assistance, which we hope will help you prepare efficiently!

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

OA Process & Question Types Overview

sports event clarification
flat-roofed building HackerRank
total duration 90 minutes or so
Number of topics 2~3 programming questions + 2 math/logic questions
language restriction Java / Python / C++ / JS and other common languages are available.
Distribution of questions Array + String Handling, Graph Theory Morphing, Logical Reasoning Questions

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

Preparation of recommendations

  • Brush up with clear direction: GS prefers to test detailing skills, so we recommend focusing on LeetCode high-frequency medium questions + math/logic questions;
  • Oral presentation cannot be understated: OA is not a VO, but HackerRank has screen recording + microphone monitoring, so it is recommended to train the expression of thoughts appropriately;
  • Practice your English reviewing skills: Some of the questions are not concise, so it is recommended that you brush up on the "semantically unclear" original LeetCode questions before taking the test.

Programhelp is here to help|We accompany you from OA to the final interview.

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. Many students have obviously brushed up a lot of questions, but when it comes to the official exam, they are still so nervous that their heads are blank. This is where Programhelp can be of great help.

We don't just talk about the 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. "We do not just talk - we use seamless remote assistance + real-time voice reminders when you face high-pressure OA or online interviews.
Online Programming for Real-Time Collaboration
Voice Guidance + Prompts for Ideas
Multi-language support, covering Python / Java / C++ and other mainstream languages
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. If you are also preparing for the written exams of investment banks or tech firms, welcome to send us a private message to learn more about our service solutions.

author avatar
ProgramHelp
END
 0
Comment(没有评论)