DSA Unknown Unknown Unknown Check If Binary String Has At Most One Segment Of Ones

Check If Binary String Has At Most One Segment Of Ones

easy

Unknown

Question Solve Solutions

Given a binary string 's' without leading zeroes, return true if s contains at most one contiguous segment of ones. Otherwise, return false.

Input Format

Input and output are managed for you. Just complete the function.

Output Format

Input and output are managed for you. Just complete the function.

Constraints

1 &lt;= s.length &lt;= 100
s[i] is either '0' or '1'
s[0] is '1'

Notice

NA

Example

Input

11100011

Output

false

Minimum Number Of Operations To Move All Balls To Each Box

Maximum Absolute Sum Of Any Subarray

Related Questions

easy Is Prime easy Prime Till N easy Reverse Integer easy GCD easy Fibonacci easy Fib Till N easy Exit Point of a matrix easy Placing N Queen in a matrix easy Arranging Vowels And Consonants easy Addition Of Two Linked List easy Circular Linked List easy Sort The Absolute List easy Decimal Number From Binary Linked List easy Find the largest rectangle in a matrix easy Count Pairs Having Sum X easy Delete alternate nodes of linked list