Largest Substring Between Two Equal Characters: coding question

Available question text

Given a string s, compute the maximum number of characters strictly between any two equal characters (i.e., maximize j - i - 1 for s[i] == s[j]); return -1 if no character repeats. This is essentially finding the farthest repeated pair in the string (n ≤ 300, lowercase letters).

Continue with questions that share topics or the same question type.

Longest Substring with At Most Two Distinct Characters
Coding
Apply Operations to Make Two Strings Equal
Coding
Check if All Characters Have Equal Number of Occurrences
Coding
Count Triplets That Can Form Two Arrays of Equal XOR
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 1624. Largest Substring Between Two Equal Characters
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Largest Substring Between Two Equal Characters

Available question text

Related questions

Largest Substring Between Two Equal Characters

Available question text

Related questions