Available question text
Given a balanced string of 'L' and 'R', partition it into the maximum number of contiguous substrings each having an equal number of L and R. This reduces to scanning the string and counting segments where the running difference between counts of L and R returns to zero.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1221. Split a String in Balanced Strings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source