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

Découvrez les meilleurs dépôts open-source grâce à notre recherche par IA.

ExplorerRecherches sélectionnéesAlternatives open sourceLogiciels auto-hébergésBlogPlan du site
ProjetServeur MCPÀ proposNotre méthodologiePresse
Mentions légalesConfidentialitéConditions d'utilisation
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 dépôts

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

Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
  • azl397985856/leetcodeAvatar de azl397985856

    azl397985856/leetcode

    55,758Voir sur 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

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

    JavaScriptalgoalgorithmalgorithms
    Voir sur GitHub↗55,758
  • sharingsource/logicstack-leetcodeAvatar de SharingSource

    SharingSource/LogicStack-LeetCode

    7,495Voir sur GitHub↗

    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
    Voir sur GitHub↗7,495
  1. Home
  2. Scientific & Mathematical Computing
  3. Subarray Sum Algorithms
  4. Constrained Subarray Counting