3090. Maximum Length Substring With Two Occurrences

LeetCodeHash TableStringSliding WindowOpen on judge ↗

Given a string s, return the maximum length of a substring such that it contains at most two occurrences of each character. Example 1: Input: s = "bcbbbcba" Output: 4 Explanation: The following substring has a length of 4 and contains at most two occurrences of each character: "bcbbbcba". Example 2: Input: s = "aaaa" Output: 2 Explanation: The following substring has a length of 2 and c

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI