awesome-repositories.com
Blog
MCP
awesome-repositories.com

Entdecke die besten Open-Source-Repositories mit KI-gestützter Suche.

EntdeckenKuratierte SuchenOpen-Source-AlternativenSelf-hosted SoftwareBlogSitemap
ProjektMCP-ServerÜber unsRanking-MethodikPresse
RechtlichesDatenschutzAGB
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 Repos

Awesome GitHub RepositoriesConstrained Subarray Counting

Algorithms for counting contiguous subarrays that satisfy specific numerical or value-based constraints.

Distinct from Subarray Sum Algorithms: Generalizes beyond just sum-based constraints to include range and value equality criteria.

Explore 2 awesome GitHub repositories matching scientific & mathematical computing · Constrained Subarray Counting. Refine with filters or upvote what's useful.

Awesome Constrained Subarray Counting GitHub Repositories

Finde die besten Repos mit KI.Wir suchen mit KI nach den am besten passenden Repositories.
  • azl397985856/leetcodeAvatar von azl397985856

    azl397985856/leetcode

    55,758Auf GitHub ansehen↗

    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

    Provides methods for calculating the number of subarrays where all elements meet specific value or range criteria.

    JavaScriptalgoalgorithmalgorithms
    Auf GitHub ansehen↗55,758
  • sharingsource/logicstack-leetcodeAvatar von SharingSource

    SharingSource/LogicStack-LeetCode

    7,495Auf GitHub ansehen↗

    LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro

    Leverages prefix-sum patterns to tally subarrays meeting conditions like sum, XOR, or length constraints.

    algorithminterview-practiceinterview-questions
    Auf GitHub ansehen↗7,495
  1. Home
  2. Scientific & Mathematical Computing
  3. Subarray Sum Algorithms
  4. Constrained Subarray Counting