Leetcode 2767. Partition String Into Minimum Beautiful Substrings
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.