Overview of the Goldman Sachs 2026 Online Assessment

The Goldman Sachs Online Assessment (OA) for engineering and technical roles evaluates algorithmic skill, logical reasoning, and time management. The assessment is commonly hosted on HackerRank and has multiple formats depending on role and application profile. Expect a combination of coding problems and math or logic questions designed to assess problem-solving under time constraints.

Assessment Formats and Timing

Common Pattern 1: Pure coding test, typically 3 to 4 coding questions in about 120 minutes.
Common Pattern 2: Mixed assessment, often 2 coding questions plus multiple math/logic problems; total time can be 135 to 180 minutes depending on the variant.
Alternative Variants: Some reports indicate a 38-question mixed assessment in 135 minutes with shorter coding and technical reasoning sections.

Supported Languages and Proctoring

Languages: Python, Java, C, C++, JavaScript, Scala, and other common HackerRank options.
Proctoring: Webcam monitoring, screen recording, and identity verification are commonly enforced.

High-Frequency Coding Topics

The coding difficulty commonly sits around LeetCode Medium. High-frequency topics include arrays, strings, BFS/DFS graph variations, simulation problems, dynamic programming, greedy strategies, and careful edge-case handling.

Representative Problems and Solution Approaches

Find the Damaged Toy (Circular Distribution Simulation)

Problem summary: N children sit in a circle. Starting from position D, distribute T toys one by one clockwise. Return the 1-based index of the child who receives the last toy.

Solution approach: Use modular arithmetic. Compute the final index with the expression (D + T – 2) % N + 1. Handle edge cases such as N = 1 or T = 1, and large T values by applying modulo early for numeric stability.
Encode or Decode Message (String with Cyclic Key)

Problem summary: Given an operation (1 for encode, 2 for decode), a message string, and a numeric key, encoding repeats each character according to successive digits of the key in cyclic order. Decoding reverses the process and must strictly validate repetition counts.

Solution approach: For encoding, iterate over the message while cycling key digits and append repeated characters accordingly. For decoding, iterate using a pointer to check expected repetition groups; return -1 on mismatch. Watch for empty strings and correct cycling of the key pattern.
Minimum Moves in a Maze (BFS with Jumping)

Problem summary: Given an n by m grid with 0s as free and 1s as blocked, compute minimum moves from (0,0) to (n-1,m-1) when each move can travel 1 to k steps in a direction until blocked.

Solution approach: Use breadth first search with careful bookkeeping of positions visited and the best distance to each cell to avoid redundant exploration. Optimize by stopping extension in a direction when a blocked cell appears and by marking visited cells to prevent O(k) repetition per node where possible.

Evaluation Criteria

Correctness is prioritized over raw speed.
Edge case handling matters: empty inputs, single-element inputs, and maximum constraints must be considered.
Code clarity and computational complexity influence outcomes.
Hidden tests may exist on HackerRank; manual local testing with edge cases is recommended.

Preparation Strategy

A focused multiweek plan increases success probability. Suggested progression:

Week 1: Strengthen fundamentals with arrays, strings, hash maps, and two pointers. Solve multiple LeetCode Medium problems daily.
Week 2: Cover trees, graphs, BFS/DFS, and heap applications. Practice graph shortest path and connectivity.
Week 3: Focus on dynamic programming and greedy patterns. Learn memoization and tabulation for common DP families.
Week 4: Simulate timed HackerRank assessments, review Goldman Sachs tagged problems on LeetCode, and practice math/logic questions under time pressure.

Critical Tips for Test Day

Prioritize simpler math/logic problems first in mixed formats to reserve time for coding questions.
Validate edge cases locally before submitting; hidden test cases can be decisive.
Write clear code with meaningful variable names and proper complexity analysis.
Maintain composure under time constraints and avoid getting stuck too long on a single problem.

Next Rounds and Resources

Successful OA results often lead to pre-recorded behavioral interviews and a Superday consisting of multiple technical and behavioral interviews. System design, deep code review, and domain-specific questions may appear in subsequent rounds.

Recommended resources include LeetCode filtered by Goldman Sachs tags, HackerRank practice environments, and the Goldman Sachs recruiting portal for logistics and status updates.

This guide summarizes candidate-reported formats, sample problems, solution approaches, and a pragmatic preparation plan for the Goldman Sachs 2026 Online Assessment. Consistent practice with attention to edge cases and time management gives the best chance to advance to later interview stages.