How should I practice Balance a Two-Letter String with at Most Two Cuts?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Balance a Two-Letter String with at Most Two Cuts associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Balance a Two-Letter String with at Most Two Cuts

Google● MediumFULLTIMEONSITE INTERVIEW

Problem statement

A string s contains only a and b, with an even total count of each letter. Split it into contiguous pieces using at most two internal cuts, then give whole pieces to two recipients so each receives exactly half of all a characters and half of all b characters.

The problem statement continues

Pro

Examples

Example 1

s = "abba"return = [2]

Case 1 exercises the documented deterministic contract.

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Google hiring insights