Available question text
Given a permutation flips describing the order in which bits in an all-zero length-n binary string are turned to 1, count how many steps i produce a prefix-aligned string (positions 1..i all ones and the rest zeros). Equivalently, count the moments when the maximum index flipped so far equals the current step i.
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
Salesforce
Leetcode 1375. Number of Times Binary String Is Prefix-Aligned
Reported Feb 10, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source