#2213Hard~50 min

Longest Substring of One Repeating Character

Time O(nlogn) · Space O(n) · Official statement on LeetCode

Solutions

// Time:  O(nlogn)
// Space: O(n)

template <typename Node, typename T>
class SegmentTree {
 public:
    explicit SegmentTree(
        int N,
        const function<Node(const int&)>& build_fn,
        const function<Node(const T&)>& update_fn,
        const function<Node(const Node&, const Node&)>& query_fn)
      : tree(N > 1 ? 1 << (__lg(N - 1) + 2) : 2),
        base_(N > 1 ? 1 << (__lg(N - 1) + 1) : 1),
        build_fn_(build_fn),
        query_fn_(query_fn),
        update_fn_(update_fn) {

        for (int i = base_; i < base_ + N; ++i) {
            tree[i] = build_fn_(i - base_);
        }
        for (int i = base_ - 1; i >= 1; --i) {
            tree[i] = query_fn_(tree[2 * i], tree[2 * i + 1]);
        }
    }

    void update(int i, const T& h) {
        int x = base_ + i;
        tree[x] = update_fn_(h);
        while (x > 1) {
            x /= 2;
            tree[x] = query_fn_(tree[x * 2], tree[x * 2 + 1]);
        }
    }

    vector<Node> tree;

private:
    int base_;
    const function<Node(const int&)> build_fn_;
    const function<Node(const T&)> update_fn_;
    const function<Node(const Node&, const Node&)> query_fn_;
};

// segment tree
class Solution {
public:
    vector<int> longestRepeating(string s, string queryCharacters, vector<int>& queryIndices) {
        struct Node {
            Node(char left = 0, char right = 0, int left_len = 0, int right_len = 0, int len = 0, int max_len = 0) 
             : left(left), right(right), left_len(left_len), right_len(right_len), len(len), max_len(max_len) {
            }

            char left;
            char right;
            int left_len;
            int right_len;
            int len;
            int max_len;
        };
        const auto& update = [] (const auto& c) {
            return Node(c, c, 1, 1, 1, 1);
        };
        const auto& build = [&s, &update] (const auto& i) {
            return update(s[i]);
        };
        const auto& query = [] (const auto& x, const auto& y) {
            if (x.len == 0) {
                return y;
            }
            if (y.len == 0) {
                return x;
            }
            return Node(x.left,
                        y.right,
                        x.left_len + ((x.left_len == x.len && x.right == y.left) ? y.left_len : 0),
                        y.right_len + ((y.right_len == y.len && y.left == x.right) ? x.right_len : 0),
                        x.len + y.len,
                        max({x.max_len, y.max_len, (x.right == y.left) ? x.right_len + y.left_len : 0}));
        };
        vector<int> result;
        SegmentTree<Node, char> st(size(s), build, update, query);
        for (int i = 0; i < size(queryCharacters); ++i) {
            st.update(queryIndices[i], queryCharacters[i]);
            result.emplace_back(st.tree[1].max_len);
        }
        return result;
    }
};

// Time:  O(nlogn)
// Space: O(n)

template <typename Node, typename T>
class SegmentTree2 {
 public:
    explicit SegmentTree2(
        int N,
        const function<Node(const int&)>& build_fn,
        const function<Node(const T&)>& update_fn,
        const function<Node(const Node&, const Node&)>& query_fn)
      : tree_(N > 1 ? 1 << (__lg(N - 1) + 2) : 2),
        base_(N > 1 ? 1 << (__lg(N - 1) + 1) : 1),
        build_fn_(build_fn),
        query_fn_(query_fn),
        update_fn_(update_fn) {

        for (int i = base_; i < base_ + N; ++i) {
            tree_[i] = build_fn_(i - base_);
        }
        for (int i = base_ - 1; i >= 1; --i) {
            tree_[i] = query_fn_(tree_[2 * i], tree_[2 * i + 1]);
        }
    }

    void update(int i, const T& h) {
        int x = base_ + i;
        tree_[x] = update_fn_(h);
        while (x > 1) {
            x /= 2;
            tree_[x] = query_fn_(tree_[x * 2], tree_[x * 2 + 1]);
        }
    }

    Node query(int L, int R) {
        Node none;
        if (L > R) {
            return none;
        }
        L += base_;
        R += base_;
        auto left = none;
        auto right = none;
        for (; L <= R; L /= 2, R /= 2) {
            if (L & 1) {
                left = query_fn_(left, tree_[L]);
                ++L;
            }
            if ((R & 1) == 0) {
                right = query_fn_(tree_[R], right);
                --R;
            }
        }
        return query_fn_(left, right);
    }

private:
    vector<Node> tree_;
    int base_;
    const function<Node(const int&)> build_fn_;
    const function<Node(const T&)> update_fn_;
    const function<Node(const Node&, const Node&)> query_fn_;
};

// segment tree
class Solution2 {
public:
    vector<int> longestRepeating(string s, string queryCharacters, vector<int>& queryIndices) {
        struct Node {
            Node(char left = 0, char right = 0, int left_len = 0, int right_len = 0, int len = 0, int max_len = 0) 
             : left(left), right(right), left_len(left_len), right_len(right_len), len(len), max_len(max_len) {
            }

            char left;
            char right;
            int left_len;
            int right_len;
            int len;
            int max_len;
        };
        const auto& update = [] (const auto& c) {
            return Node(c, c, 1, 1, 1, 1);
        };
        const auto& build = [&s, &update] (const auto& i) {
            return update(s[i]);
        };
        const auto& query = [] (const auto& x, const auto& y) {
            if (x.len == 0) {
                return y;
            }
            if (y.len == 0) {
                return x;
            }
            return Node(x.left,
                        y.right,
                        x.left_len + ((x.left_len == x.len && x.right == y.left) ? y.left_len : 0),
                        y.right_len + ((y.right_len == y.len && y.left == x.right) ? x.right_len : 0),
                        x.len + y.len,
                        max({x.max_len, y.max_len, (x.right == y.left) ? x.right_len + y.left_len : 0}));
        };
        vector<int> result;
        SegmentTree2<Node, char> st(size(s), build, update, query);
        for (int i = 0; i < size(queryCharacters); ++i) {
            st.update(queryIndices[i], queryCharacters[i]);
            result.emplace_back(st.query(0, size(s) - 1).max_len);
        }
        return result;
    }
};

Beginner Explanation

What is Longest Substring of One Repeating Character?

Longest Substring of One Repeating Character (LeetCode #2213) is a Hard problem that primarily trains string.

How to think about it

Restate the goal in your own words before coding.
Work a tiny example by hand so the invariant becomes obvious.
Identify the pattern — this problem aligns with segment tree.
Only then translate the idea into code.

Why this problem matters

Hard problems force you to combine patterns and prove complexity carefully — interview gold. Official solution notes mention: Segment Tree.

AlgoForge explanations are original teaching notes. Always open the official problem statement on LeetCode for constraints and examples.

Interview Walkthrough

Interview approach for Longest Substring of One Repeating Character

Opening (30–60 seconds)

Clarify inputs/outputs and edge cases (empty input, single element, duplicates, overflow).
State a brute force so the interviewer knows you can solve it naively.
Propose the optimal direction tied to segment tree.

Core solution narrative

Define the state you track (pointers, DP cell, set membership, stack top, etc.).
Explain the transition when you process the next element.
Call out time (O(nlogn)) and space (O(n)) before coding.
Code cleanly; narrate variable names.

What interviewers listen for

Correctness on edge cases
Complexity honesty
Ability to discuss trade-offs (e.g., hash map space vs. sort + two pointers)

Follow-up questions they may ask

Can you solve it with less memory?
What if the input stream is infinite / doesn't fit in RAM?
How would tests look for adversarial inputs?

Optimized Approach

Optimized solution notes

The reference solutions on AlgoForge target O(nlogn) time and O(n) space.

Pattern focus: segment tree

Use the pattern as a checklist:

segment tree — confirm the invariant holds after each step

Multiple methods appear in the source solutions — compare them and explain when each is preferable.

Implementation tips

Prefer readable names over micro-optimizations in interviews.
Extract helpers only when they clarify (e.g., expand-around-center, DFS visit).
After AC-level logic, re-scan for off-by-one and null checks.

Complexity Analysis

Complexity

Measure	Bound
Time	O(nlogn)
Space	O(n)

How to justify this in an interview

Time: count loops, map/set operations, and recursive branching; state average vs worst case if relevant.
Space: include hash maps, recursion stack, and output allocation when the problem asks for it.

If your implementation differs from the reference, re-derive big-O from your code — never memorize a complexity you cannot defend.

Common Mistakes

Common mistakes on Longest Substring of One Repeating Character

Skipping edge cases — empty collections, single-element inputs, max constraints.
Wrong invariant for segment tree — updating state too early or too late.
Mutating input unexpectedly when the problem forbids it.
Off-by-one in windows, ranges, or binary search bounds.
Ignoring overflow / precision for integer arithmetic problems.
Overengineering — jumping to an advanced structure when a simpler approach works.

Alternative Approaches

Alternatives

The source file includes more than one method. Compare:

Primary optimized path — best complexity for typical interviews.
Secondary approach — often brute force, sorting-based, or space-optimized variant.

Practice articulating when you would pick each (constraints, readability, follow-ups).

Edge Cases

Edge cases checklist

Minimum input size
Maximum input size / time limits
Duplicates and already-sorted input
Negative numbers / zeros (if applicable)
Disconnected structures (graphs/trees)
Single path vs branching recursion depth

Pattern Recognition

Spotting this pattern

Signal phrases that point to segment tree:

Sorted input or ability to sort without changing the answer class
Need for contiguous subarray / substring → consider sliding window
Need for O(1) membership → hash set/map
Optimal substructure + overlapping subproblems → DP
Connectivity / components → graph DFS/BFS or Union-Find

Primary topics: string.

Follow-up Interview Questions

Follow-ups

How does the solution change if the input is a stream?
Can you solve it in-place?
What if duplicates must be handled differently?
How would you parallelize the approach?
Design tests that would break a buggy implementation.

Practice Recommendations

What to practice next

Re-solve Longest Substring of One Repeating Character in a second language (cpp, python).
Drill 3–5 more problems tagged string.
Teach the solution out loud in under 5 minutes.
Add this problem to your revision calendar in 3 days and 14 days.

Visualization

Conceptual diagram for Longest Substring of One Repeating Character: show input structure (string), highlight the moving parts of the segment tree approach, and annotate each step with the maintained invariant and complexity.

Study checklist

Read the official problem statement on LeetCode
Solve on paper / whiteboard first
Implement the segment tree approach
Verify edge cases from the checklist
State time and space complexity aloud
Compare with the AlgoForge reference solution
Schedule a revision session

Revision notes

Longest Substring of One Repeating Character (#2213) — Hard. Pattern: segment tree. Complexity: O(nlogn) time / O(n) space. Re-derive the invariant before coding.

FAQs

What is the time complexity of Longest Substring of One Repeating Character?+

The reference solutions aim for O(nlogn) time and O(n) space. Always re-derive complexity from the code you write in the interview.

What pattern does Longest Substring of One Repeating Character use?+

It primarily maps to segment tree, within the broader topic of string.

Is Longest Substring of One Repeating Character good for interviews?+

Yes — as a Hard problem it is a solid practice target. Pair it with related problems in the same pattern family for spaced repetition.

Where can I read the official statement?+

Open the official LeetCode page for constraints and examples: https://leetcode.com/problems/longest-substring-of-one-repeating-character/

#	Title	Difficulty	Topics
699	Falling Squares	Hard	tree
850	Rectangle Area II	Hard	tree
2407	Longest Increasing Subsequence II	Hard	array
2569	Handling Sum Queries After Update	Hard	array
3165	Maximum Sum of Subsequence With Non-adjacent Elements	Hard	binary search tree
2523	Closest Prime Numbers in Range	Medium	math
68	Text Justification	Hard	string
214	Shortest Palindrome	Hard	string