Special Binary String: coding question

Available question text

Given a special binary string (balanced and every prefix has at least as many 1s as 0s), the task is to repeatedly swap adjacent special substrings to produce the lexicographically largest result — which requires recognizing the nested "balanced" structure and using a recursive divide-and-conquer approach that maximizes each primitive special substring and sorts/reorders them to form the largest concatenation.

Continue with questions that share topics or the same question type.

Binary String With Substrings Representing 1 To N
Coding
Check If a String Contains All Binary Codes of Size K
Coding
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
Coding
Check if Binary String Has at Most One Segment of Ones
Coding

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 761. Special Binary String
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Special Binary String

Available question text

Related questions

Special Binary String

Available question text

Related questions