Brian Cimmino cimminob
Schachte
/ LongestSubstringKDistinct.java
Last active
February 7, 2025 11:05
Sliding Window Maximum Sum Subarray
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.util.*; | |
| class LongestSubstringKDistinct { | |
| public static int findLength(String str, int k) { | |
| int windowStart = 0, maxLength = 0; | |
| Map<Character, Integer> charFrequencyMap = new HashMap<>(); | |
| for (int windowEnd = 0; windowEnd < str.length(); windowEnd++) { | |
| char rightChar = str.charAt(windowEnd); | |
| charFrequencyMap.put(rightChar, charFrequencyMap.getOrDefault(rightChar, 0) + 1); |
