EasyNo. 1869

Longer Contiguous Segments of Ones than Zeros — LeetCode 1869 Python Solution

Pattern
Hash Map
Topics
String
Reading time
3 min

The problem

Given a binary string s, return true if the longest contiguous segment of 1's is strictly longer than the longest contiguous segment of 0's in s, or return false otherwise. For example, in s = "110100010" the longest continuous segment of 1s has length 2, and the longest continuous segment of 0s has length 3.

Example

Input
s = "1101"
Output
true
Explanation
The longest contiguous segment of 1s has length 2: "1101"

Python solution

PythonSolution
class Solution:
    def checkZeroOnes(self, s: str) -> bool:
        def f(x: str) -> int:
            cnt = mx = 0
            for c in s:
                if c == x:
                    cnt += 1
                    mx = max(mx, cnt)
                else:
                    cnt = 0
            return mx

        return f("1") > f("0")

Complexity

Time
O(n), where n is the length of the string s
Space · auxiliary
$O(1)`

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1869. Longer Contiguous Segments of Ones than Zeros is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems

Related problems
No.ProblemDifficulty
0006Zigzag ConversionMedium
0008String to Integer (atoi)Medium
0038Count and SayMedium
0058Length of Last WordEasy
0065Valid NumberHard
0068Text JustificationHard

Frequently asked questions

How hard is LeetCode 1869. Longer Contiguous Segments of Ones than Zeros?

LeetCode 1869. Longer Contiguous Segments of Ones than Zeros is rated Easy on LeetCode.

What is the time complexity of LeetCode 1869. Longer Contiguous Segments of Ones than Zeros?

The Python solution on this page runs in O(n), where n is the length of the string s.

What is the space complexity of LeetCode 1869. Longer Contiguous Segments of Ones than Zeros?

The Python solution on this page uses $O(1)` auxiliary space.

What topics does LeetCode 1869. Longer Contiguous Segments of Ones than Zeros cover?

LeetCode 1869. Longer Contiguous Segments of Ones than Zeros is tagged String on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.