Leetcode 395. Longest Substring with At Least K Repeating Characters

Find the length of the longest substring of a lowercase string s such that every character in that substring appears at least k times. The core challenge is to efficiently locate maximal contiguous segments that meet the per-character frequency constraint (often leveraging the fact the alphabet is only 26 letters).

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 395. Longest Substring with At Least K Repeating Characters

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact