What is the time complexity of LeetCode 2730. Find the Longest Semi-Repetitive Substring?

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

What is the space complexity of LeetCode 2730. Find the Longest Semi-Repetitive Substring?

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

MediumNo. 2730

Find the Longest Semi-Repetitive Substring — LeetCode 2730 Python Solution

Pattern: Sliding Window
Topics: String, Sliding Window
Reading time: 2 min
Source: leetcode.com

The problem

You are given a digit string s that consists of digits from 0 to 9. A string is called semi-repetitive if there is at most one adjacent pair of the same digit.

Python solution

PythonSolution

class Solution:
    def longestSemiRepetitiveSubstring(self, s: str) -> int:
        ans, n = 1, len(s)
        cnt = j = 0
        for i in range(1, n):
            cnt += s[i] == s[i - 1]
            while cnt > 1:
                cnt -= s[j] == s[j + 1]
                j += 1
            ans = max(ans, i - j + 1)
        return ans

Complexity

Time: O(n)where n is the length of the string
Space · auxiliary: O(1)

Pattern: Sliding Window

Collapse a nested loop over every subarray into a single pass with two indices. LeetCode 2730. Find the Longest Semi-Repetitive Substring is filed here because LeetCode tags it Sliding Window, which is the vocabulary this hub collects.

The sliding window guide has the Python template for the pattern and the 116 LeetCode problems that use it.

Related problems
No.	Problem	Difficulty
1044	Longest Duplicate Substring	Hard
1208	Get Equal Substrings Within Budget	Medium
1234	Replace the Substring for Balanced String	Medium
1456	Maximum Number of Vowels in a Substring of Given Length	Medium
1839	Longest Substring Of All Vowels in Order	Medium
1871	Jump Game VII	Medium

Frequently asked questions

How hard is LeetCode 2730. Find the Longest Semi-Repetitive Substring?: LeetCode 2730. Find the Longest Semi-Repetitive Substring is rated Medium on LeetCode.
What is the time complexity of LeetCode 2730. Find the Longest Semi-Repetitive Substring?: The Python solution on this page runs in O(n), where n is the length of the string.
What is the space complexity of LeetCode 2730. Find the Longest Semi-Repetitive Substring?: The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 2730. Find the Longest Semi-Repetitive Substring cover?: LeetCode 2730. Find the Longest Semi-Repetitive Substring is tagged String and Sliding Window 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.

Download for Mac Download for Windows

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

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

Technical interview · 45 minsolution.pyShared editor · Python 3Longest substring without repeatsMediumGiven a string s, return the length of the longest contiguous substring in which every character is unique.s = "abcabcbb"
→ 31def length_of_longest_substring(s: str) -> int:2 last_seen = {}3 left = best = 04 for right, ch in enumerate(s):5 if ch in last_seen and last_seen[ch] >= left:

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 Terra

Transcribing...

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Transcribing...

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Transcribing...

Primary display

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

The problem

Python solution

Complexity

Pattern: Sliding Window

Related problems

Frequently asked questions

Stuck on problems like this in a live interview?

Approach

Approach

Approach