Google 2026 New Grad OA: Split-and-Sort Cut Points and Minimum Absolute Sum

Role: Software Engineer, New Grad — Campus
Result: Advanced within hours of completing the OA
OA date: November 2, 2025

Question 1: Split and Sort

Given an integer array A, split it into two non-empty parts, sort each part independently, and concatenate them. Count the split positions that make the final array nondecreasing.

The candidate computed:

• A prefix-maximum array
• A suffix-minimum array

A cut before index i is valid when prefixMax[i-1] <= suffixMin[i].

Practice: Split and Sort

Question 2: Minimum Absolute Sum

Given an integer array, optionally multiply at most one element by -1. Minimize the absolute value of the final array sum.

If the original sum is S, flipping value x changes it to S - 2x. The candidate checked every possible element and kept the smallest abs(S - 2x), including the option of no flip.

Practice: Minimum Absolute Sum

The candidate reported that the same two questions had appeared across other platforms and that the next-step notification arrived a few hours after submission.