Partition String Into Minimum Beautiful Substrings(Leetcode Problem).

Given a binary string s, partition the string into one or more substrings such that each substring is beautiful.A string is beautiful if 1)It doesn't contain leading zeros.2)It's the binary representation of a number that is a power of 5. Return the minimum number of substrings in such partition. If it is impossible to partition the string s into beautiful substrings, return -1. https://www.youtube.com/@UCpAtfb16p06rxTjVSku3ehA