Glossary: Coding Interviews in Go
Bottom-up
Also written: bottom-up DP
Dynamic programming with no recursion: you fill a table starting from the smallest subproblem and work upward. `fewestTable` does this for bag counts.
Glossary: Coding Interviews in Go
Also written: bottom-up DP
Dynamic programming with no recursion: you fill a table starting from the smallest subproblem and work upward. `fewestTable` does this for bag counts.