algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-28 04:33:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: add suggestion problem to knapsack knowledge (#239)

Browse Source
This commit is contained in:
truongductri01
2021-10-07 12:19:58 -05:00
committed by GitHub
parent de9d5d0dfd
commit 67059d0b9c
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
contents/algorithms/dynamic-programming.md
View File

@ -16,7 +16,7 @@ Sometimes you do not need to store the whole DP table in memory, the last two va
## Recommended LeetCode questions ## Recommended LeetCode questions
- 0/1 Knapsack - 0/1 Knapsack or [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)
- [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) - [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)
- [Coin Change](https://leetcode.com/problems/coin-change/) - [Coin Change](https://leetcode.com/problems/coin-change/)
- [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) - [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)