Available question text
Partition a binary string into the minimum number of contiguous substrings such that each substring has no leading zeros and its binary value is a power of 5; return that minimum count or -1 if no such partition exists.
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 2767. Partition String Into Minimum Beautiful Substrings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source