Java Solutions to problems on LintCode/LeetCode
dynamicprogramming 开源项目推荐(36 个)
dynamicprogramming 话题在 GitHub 上没有填写简介,这里按 Star 数汇总最相关的热门仓库。
热门项目 前 20
按 Star 数排序展示前 20 个 · GitHub 共 36 个仓库This series aims to teach you DP with everything sequenced step by step, fully readable code with necessary comments. It includes 160+ problems, 115+ from LeetCode, covering 12 DP patterns from 1D to Graph DP. Includes Top-Down & Bottom-Up solutions, multiple ways of writing Top-Down solutions, and space optimizations (e.g., 1D to constant space).
这份学习计划面向希望准备技术面试但不确定该重点攻克哪些题目的人。题目经过精心挑选,1 级和 2 级将引导初学者和中级用户完成覆盖多数中级……面试所需数据结构和算法的问题。
Welcome to DSA in Java, your ultimate resource for mastering Data Structures and Algorithms (DSA) using Java. This repository is designed to help you build a strong foundation in one of the most essential skills for coding interviews, competitive programming, and real-world software development.
Personal repository of Leetcode solutions
A comprehensive repository of CSES Problem Set solutions, covering essential topics in competitive programming such as algorithms, data structures, dynamic programming, and graph algorithms. Contributions are welcome!
Mixed Dynamic-Programming Solutions -Java
My solutions for different online judges: UVa, LightOJ, SPOJ, Codeforces, Codechef, Atcoder, Timus, URI etc.
Solutions to competitive programming problems from different websites which are developed by me.
Data Structures And Algorithms Practice
我的 GitHub 个人资料配置文件。
Dynamic programming is used where we have problems, which can be divided into similar sub-problems, so that their results can be re-used. Mostly, these algorithms are used for optimization.
Hii, here is the leetcode problems i solved in my journey to learn DSA
Problems for Data Structures and Algorithms coded in C++
DynamicProgramming——动态规划-背包问题详解系列
This repo contains the algorithms and solutions to commonly asked interview questions.
Tabular reinforcement learning project comparing policy evaluation, policy iteration, Q-learning, and SARSA in a custom 10×10 maze.
This is final task of design and analysis of algorithm. It's about implementation of brute force, greedy, and dynamic programming on knapsack problem.
A repository for studying dynamic programming
Top interview questions on DSA , a guide for cracking on-campus and off-campus placement
关于这个话题
- 清单取自 GitHub 话题页并按 Star 数排序,每次展示前 20 个项目;原始页面见 https://github.com/topics/dynamicprogramming。
- 该话题在 GitHub 上共有 36 个仓库, 本站收录的是其中最热门的 20 个,不是全量列表。
- Star / Fork 每日自动刷新一次,实时数据以 GitHub 为准。
- 当前 20 个项目累计 4415 Star,覆盖 4 种主要语言,数据更新于 2026-11-07。
- 中文介绍来自 GitHub 官方话题说明(github/explore)的机器翻译,可点「查看原文」对照;译文缺失时会先展示原文。