Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given a string s containing 0's and 1's. You have to return a smallest positive integer **C**, such that the binary string can be cut into **C** pieces and each piece should be of the **power of 5 ** with no leading zeros.

**Example 1:**

**Input:**
s = "101101101"**
Output: **3
**Explanation: **We can split the given string
into three “101”s, where 101 is
the binary representation of 5.

**Example 2:**

**Input:
**s = "00000"
**Output: **-1
**Explanation: **0 is not a power of 5.

**Your Task:**

Your task is to complete the function **cuts() **which take a single argument(string s) and return C. You need not take any input or print anything.

**Expected Time Complexity: **O(|s|*|s|*|s|).

**Expected Auxiliary Space: **O(|s|).

**Constraints:**

1<=s.length()<=50

**Note: **The string **s **is a binary string.

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Cutting Binary String

...