What is the time complexity of LeetCode 1933. Check if String Is Decomposable Into Value-Equal Substrings?

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 1933. Check if String Is Decomposable Into Value-Equal Substrings?

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

Check if String Is Decomposable Into Value-Equal Substrings — LeetCode 1933 Python Solution

EasyLeetCode PremiumString

Problem: #1933
Pattern: Hash Map
Reading time: 2 min
Source: leetcode.com

The problem

A value-equal string is a string where all characters are the same. For example, "1111" and "33" are value-equal strings.

Example

Input: s = "000111000"
Output: false
Explanation: s cannot be decomposed according to the rules because ["000", "111", "000"] does not have a substring of length 2.

Python solution

Python

class Solution:
    def isDecomposable(self, s: str) -> bool:
        cnt2 = 0
        for _, g in groupby(s):
            m = len(list(g))
            if m % 3 == 1:
                return False
            cnt2 += m % 3 == 2
            if cnt2 > 1:
                return False
        return cnt2 == 1

Complexity

Measure	Complexity
Time	O(n), where n is the length of the string s
Space	O(1) auxiliary

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1933. Check if String Is Decomposable Into Value-Equal Substrings 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.

Frequently asked questions

How hard is LeetCode 1933. Check if String Is Decomposable Into Value-Equal Substrings?: LeetCode 1933. Check if String Is Decomposable Into Value-Equal Substrings is rated Easy on LeetCode.
What is the time complexity of LeetCode 1933. Check if String Is Decomposable Into Value-Equal Substrings?: 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 1933. Check if String Is Decomposable Into Value-Equal Substrings?: The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 1933. Check if String Is Decomposable Into Value-Equal Substrings cover?: LeetCode 1933. Check if String Is Decomposable Into Value-Equal Substrings is tagged String on LeetCode.
Is LeetCode 1933. Check if String Is Decomposable Into Value-Equal Substrings a premium problem?: Yes. LeetCode 1933. Check if String Is Decomposable Into Value-Equal Substrings is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.