mediumCountingGreedyString 0 views
Maximum Number of Operations to Move Ones to the End
You are given a binary string s.
You are given a binary string s.
You can perform the following operation on the string any number of times:
Return the maximum number of operations that you can perform.
Example 1
Input: s = "1001101"
Output: 4
Explanation: We can perform the following operations:
Example 2
Input: s = "00111"
Output: 0
Constraints
- 1 <= s.length <= 10^5
- s[i] is either '0' or '1'.
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.