awesome-repositories.com
博客
MCP
awesome-repositories.com

通过 AI 驱动的搜索,发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目MCP 服务器关于排名机制媒体报道
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 个仓库

Awesome GitHub RepositoriesDistinct Element Subarray Counting

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.

Awesome Distinct Element Subarray Counting GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • azl397985856/leetcodeazl397985856 的头像

    azl397985856/leetcode

    55,758在 GitHub 上查看↗

    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.

    JavaScriptalgoalgorithmalgorithms
    在 GitHub 上查看↗55,758
  • hoanhan101/algohoanhan101 的头像

    hoanhan101/algo

    3,678在 GitHub 上查看↗

    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.

    Go
    在 GitHub 上查看↗3,678
  1. Home
  2. Scientific & Mathematical Computing
  3. Subarray Sum Algorithms
  4. Distinct Element Subarray Counting