1784. Check if Binary String Has at Most One Segment of Ones

LeetCodeStringOpen on judge ↗

Given a binary string s without leading zeros, return true if s contains at most one contiguous segment of ones. Otherwise, return false. Example 1: Input: s = "1001" Output: false Explanation: The string has two segments of size 1. Example 2: Input: s = "110" Output: true Constraints: - 1 <= s.length <= 100 - s[i] is either '0' or '1'. - s[0] is '1'.

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI