0_intro
dz / leetcode / explore / dynamic_programming / 0_introSubgraphs
Node Tree
Nodes
| 1_what_is | |
| content | What is dynamic programming? |
| children | 1_what_is/kinds_of_problems |
| parents | leetcode/explore/dynamic_programming/0_intro, leetcode/references/fibbonacci |
| hyperlink | https://leetcode.com/explore/featured/card/dynamic-programming/630/an-introduction-to-dynamic-programming/4034/ |
| location | knowledge/leetcode/leetcode.dz:1097 |
| 2_top_down_bottom_up | |
| content | top down vs bottom up |
| children | 2_top_down_bottom_up/which_is_better, 2_top_down_bottom_up/top_down, 2_top_down_bottom_up/bottoms_up |
| parents | leetcode/explore/dynamic_programming/0_intro |
| hyperlink | https://leetcode.com/explore/featured/card/dynamic-programming/630/an-introduction-to-dynamic-programming/4035/ |
| location | knowledge/leetcode/leetcode.dz:1132 |
| 3_when_to_use | |
| content | When to use DP |
| children | 3_when_to_use/1_find_optimum_value, 3_when_to_use/2_future_decisions_depend_on_earlier_ones |
| parents | leetcode/explore/dynamic_programming/0_intro |
| hyperlink | https://leetcode.com/explore/featured/card/dynamic-programming/630/an-introduction-to-dynamic-programming/4094/ |
| location | knowledge/leetcode/leetcode.dz:1176 |