Online Assessment

Two-Hour Online Assessment with Two Problems

Goldman SachsSoftware Engineer · Online Assessment · Dec 2025

2 hours to solve two problems: Transaction Segments Given an array transactionValues of length n, where transactionValues[i] is the transaction amount at time i. Count the number of contiguous subarrays that are strictly increasing and have length exactly k. Strictly increasing means: transactionValues[i]

Shared by a candidate · reported Dec 2025. Interview formats change; use it as a guide, not a script.