Problem: Find Longest Self-Contained Substring

Hard

40 min

Explore how to identify and return the length of the longest self-contained substring in a string, where each character is unique to that substring. This lesson helps you apply hash maps effectively to solve this specific character uniqueness problem.

Statement

You are given a string, s, consisting of lowercase English letters. Your task is to find the length of the longest self-contained substring of s.

A substring t of s is called self-contained if:

t is not equal to the entire string s.
Every character in t does not appear anywhere else in s (outside of t).

In other words, all characters in t are completely unique to that substring within the string s.

Return the length of the longest self-contained substring. If no such substring exists, return -1.

Constraints:

$2 \leq$ s.length $\leq 1000$
s consists only of lowercase English letters.

Problem: Find Longest Self-Contained Substring

Hard

40 min

Statement

You are given a string, s, consisting of lowercase English letters. Your task is to find the length of the longest self-contained substring of s.

A substring t of s is called self-contained if:

t is not equal to the entire string s.
Every character in t does not appear anywhere else in s (outside of t).

In other words, all characters in t are completely unique to that substring within the string s.

Return the length of the longest self-contained substring. If no such substring exists, return -1.

Constraints:

$2 \leq$ s.length $\leq 1000$
s consists only of lowercase English letters.

Problem: Find Longest Self-Contained Substring

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Find Longest Self-Contained Substring

Statement

Examples

Understand the problem

Figure it out!

Try it yourself