2 个仓库
Sliding window algorithms for counting subarrays containing a limited number of unique elements.
Distinct from Subarray Sum Algorithms: Focuses on unique element counts within the window rather than the numerical sum of the subarray.
Explore 2 awesome GitHub repositories matching scientific & mathematical computing · Distinct Element Subarray Counting. Refine with filters or upvote what's useful.
This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t
Finds the number of subarrays containing a limited number of unique elements using a sliding window.
This 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
Implements sliding window algorithms for counting subarrays containing a limited number of unique elements.