Skip to content

Practice Check if Binary String Has at Most One Segment of Ones

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1784
LeetCode Problem

Check if Binary String Has at Most One Segment of Ones

Problem Statement

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

Source: Check if Binary String Has at Most One Segment of Ones on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "1001"
Output
false

# Example 2

Input
s = "110"
Output
true

Constraints

1 <= s.length <= 100
s[i]​​​​ is either '0' or '1'.
s[0] is '1'.

Related LeetCode Problems

Practice more problems similar to Check if Binary String Has at Most One Segment of Ones.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.