awesome-repositories.com
Blog
awesome-repositories.com

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

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

1 Repo

Awesome GitHub RepositoriesKnapsack Problem Solving

Algorithmic implementations of knapsack-style problems to maximize value under constraints.

Distinct from Dynamic Programming: Focuses specifically on the knapsack optimization pattern rather than general dynamic programming techniques.

Explore 1 awesome GitHub repository matching scientific & mathematical computing · Knapsack Problem Solving. Refine with filters or upvote what's useful.

Awesome Knapsack Problem Solving GitHub Repositories

Finde die besten Repos mit KI.Wir suchen mit KI nach den am besten passenden Repositories.
  • 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

    Applies dynamic programming to partition, subset-sum, and resource-allocation challenges commonly found in technical interviews.

    algorithminterview-practiceinterview-questions
    Auf GitHub ansehen↗7,495
  1. Home
  2. Scientific & Mathematical Computing
  3. Dynamic Programming
  4. Knapsack Problem Solving

Unter-Tags erkunden

  • General Dynamic ProgrammingTechniques for solving problems by breaking them into overlapping subproblems and caching results. **Distinct from Knapsack Problem Solving:** Distinct from Knapsack Problem Solving: covers the general DP paradigm, not just knapsack-specific solutions.