Check If Binary String Has At Most One Segment Of Ones · Interview Problem

Leetcode

check-if-binary-string-has-at-most-one-segment-of-ones

Medium

Strings

Greedy

Two Pointers

Check If Binary String Has At Most One Segment Of Ones

Check if a binary string contains at most one contiguous segment of '1's.

Acceptance 100%

Problem Statement

Core description from the backend problem record.

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

A string s consisting of characters '0' and '1'.

Return a boolean value: true or false.

1 <= s.length <= 100

Examples

Sample cases returned by the problem API.

Example 1

Input

Output

true

Explanation

There is only one contiguous segment of ones.

Example 2

Input

Output

false

Explanation

There are two segments of ones separated by zeros.

Loading Preptin