1 dépôt
Awesome GitHub RepositoriesDistinct Character Substring Analyzers
Algorithms that identify the longest contiguous segment of a string containing exactly k unique characters.
Distinct from Longest Substring Identification: Targets a specific count of unique characters (k), while the parent covers any general criteria for longest segments.
Explore 1 awesome GitHub repository matching software engineering & architecture · Distinct Character Substring Analyzers. Refine with filters or upvote what's useful.
Awesome Distinct Character Substring Analyzers GitHub Repositories
Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
- hoanhan101/algo
hoanhan101/algo
3,678Voir sur GitHubThis project is a Go algorithm implementation library and a reference for data structures. It serves as a collection of solved coding interview problems and an algorithmic pattern collection, providing a reference of over 100 common challenges implemented in Go. The library focuses on specific problem-solving strategies, including sliding windows, two pointers, and dynamic programming. It provides coded examples of standard sorting, searching, and graph traversal techniques to facilitate the study of algorithmic patterns. The repository covers a broad range of capabilities, including array a
Calculates the length of the longest substring with k unique characters using a sliding window.
Go
