Available question text
Given a binary string where every second all occurrences of "01" simultaneously become "10", determine how many seconds until no "01" remains; the core challenge is modeling the parallel, cascading swaps to compute how far ones must move past zeros (can be solved in O(n)).
Related questions
Continue with questions that share topics or the same question type.
- Add Binary
Coding · Bit Manipulation · Math · Simulation
- Number of Ways to Form a Target String Given a Dictionary
Coding · Array · Dynamic Programming · String
- Valid Parenthesis String
Coding · Bracket Sequences · Dynamic Programming · Greedy
- Decode Ways
Coding · Dynamic Programming · String
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Salesforce
Leetcode 2380. Time Needed to Rearrange a Binary String
Reported Jun 30, 2026 · 4 source reports
SENIOR
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Salesforce
Time Needed to Rearrange a Binary String
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 85.2. This is not an interview probability.
View source