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

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

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

2 个仓库

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

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

    SharingSource/LogicStack-LeetCode

    7,495在 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
    在 GitHub 上查看↗7,495
  • soapyigu/leetcode-swiftsoapyigu 的头像

    soapyigu/LeetCode-Swift

    4,958在 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
    在 GitHub 上查看↗4,958
  1. Home
  2. Scientific & Mathematical Computing
  3. Subarray Sum Algorithms
  4. Disjoint Subarray Sums