Leetcode 3090. Maximum Length Substring With Two Occurrences

Find the length of the longest substring in which every character appears at most twice. This is a sliding-window/counting problem over a small lowercase alphabet (2 <= |s| <= 100).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3090. Maximum Length Substring With Two Occurrences

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact