Leetcode 3641. Longest Semi-Repeating Subarray

Find the length of the longest contiguous subarray (or substring) that is "semi-repeating" — i.e., contains at most one value/character that appears more than once. This is typically solved with a sliding-window and frequency counts to maintain the allowed-repeat constraint.

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 3641. Longest Semi-Repeating Subarray

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact