3_when_to_use

dz / leetcode / explore / dynamic_programming / 0_intro / 3_when_to_use

Node Tree

• 1_find_optimum_value
  • 2_future_decisions_depend_on_earlier_ones
    • leetcode/problems/198_house_robber
    • leetcode/problems/300_longest_increasing_subsequence

Nodes

1_find_optimum_value
content	A characteristic that is common in DP problems is asking for the optimum value (min/max) of something. For example, the minimum cost of doing..., the max profit of from ..., how many ways to..., what is the longest possible..., is it possible to reach a certain point..
children	2_future_decisions_depend_on_earlier_ones
parents	leetcode/paradigms/greedy, leetcode/explore/dynamic_programming/0_intro/3_when_to_use
location	knowledge/leetcode/leetcode.dz:1183

2_future_decisions_depend_on_earlier_ones
content	A characteristic of DP problems is that Future decisions depend on eariler ones.
children	leetcode/problems/198_house_robber (each decision will affect which options are,available to the rubber in the future), leetcode/problems/300_longest_increasing_subsequence
parents	leetcode/paradigms/greedy, leetcode/explore/dynamic_programming/0_intro/3_when_to_use, 1_find_optimum_value
location	knowledge/leetcode/leetcode.dz:1195