Leetcode Problem 395. Longest Substring with At Least K Repeating Characters

395. Longest Substring with At Least K Repeating Characters

Leetcode Solutions

Approach: Sliding Window

  1. Determine the maximum number of unique characters in the string s and store it in maxUnique.
  2. Iterate from 1 to maxUnique using a variable currUnique to represent the number of unique characters allowed in the window.
  3. Use two pointers, windowStart and windowEnd, to represent the sliding window.
  4. Slide the window across the string, expanding it if the number of unique characters is less than or equal to currUnique, and shrinking it otherwise.
  5. Keep track of the number of unique characters that have at least k frequency with countAtLeastK.
  6. Update the result if all characters in the window have at least k frequency.
UML Thumbnail

Approach: Brute Force

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...