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 RepositoriesDisjoint Subarray Sums

Algorithms for finding maximum sums from multiple non-overlapping subarrays of equal length.

Distinct from Subarray Sum Algorithms: Distinct from Subarray Sum Algorithms: specifically targets multiple disjoint subarrays, not single subarray sums.

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

Awesome Disjoint Subarray Sums 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.
  • 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

    Solves the maximum sum of non-overlapping subarrays problem using prefix sums and dynamic programming.

    algorithminterview-practiceinterview-questions
    Voir sur GitHub↗7,495
  • soapyigu/leetcode-swiftAvatar de soapyigu

    soapyigu/LeetCode-Swift

    4,958Voir sur GitHub↗

    LeetCode-Swift is a collection of algorithm solutions written in Swift, designed for coding interview preparation. Each solution is implemented as a self-contained function with no external dependencies, making it easy to run and test. The repository organizes solutions by topic and company, and every file includes time and space complexity annotations, allowing quick evaluation of algorithmic efficiency. What sets this repository apart is its flat file structure and the way solutions are tagged with the companies that asked them in interviews, enabling targeted practice. All code resides in

    Finds the maximum sum achievable from three non-overlapping subarrays using DP.

    Swiftalgorithmdata-structuresinterview
    Voir sur GitHub↗4,958
  1. Home
  2. Scientific & Mathematical Computing
  3. Subarray Sum Algorithms
  4. Disjoint Subarray Sums