msb-public
/
tech-interview-handbook
mirror of https://github.com/yangshun/tech-interview-handbook
2
1
Code Issues Projects Releases Wiki Activity

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

Browse Source
pull/242/head
truongductri01 3 years ago committed by GitHub
parent de9d5d0dfd
commit 67059d0b9c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File

2
contents/algorithms/dynamic-programming.md
Unescape 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/)

Write Preview
Loading…
Cancel
Save