leetcode/explore/dynamic_programming/1_strategic_approach

1_strategic_approach

dz / leetcode / explore / dynamic_programming / 1_strategic_approach

Subgraphs

Node Tree

Nodes

1_framework
content	A framework for DP problems
children	leetcode/problems/70_climbing_stairs (used as a sample problem for applying framework), 1_framework/1_store_answer_for_states, 1_framework/2_recurrence_relation, 1_framework/3_base_cases, 1_framework/state_variables, 1_framework/state
parents	leetcode/explore/dynamic_programming/1_strategic_approach
hyperlink	https://leetcode.com/explore/featured/card/dynamic-programming/631/strategy-for-solving-dp-problems/4096/
location	knowledge/leetcode/leetcode.dz:1221

2_examples
content	Example: House Robber (198), etc
children	leetcode/problems/746_min_cost_climbing_stairs, leetcode/problems/1137_nth_tribonacci_number, 3_multidimensional/1_index_along_input (so far these have been the sole the sole,state variable for all problems looked at,so far), leetcode/problems/740_delete_and_earn, leetcode/problems/198_house_robber
parents	leetcode/explore/dynamic_programming/1_strategic_approach
location	knowledge/leetcode/leetcode.dz:1260

3_multidimensional
content	Multidimensional DP
children	3_multidimensional/1_index_along_input, 3_multidimensional/3_explicit_numerical_constraints, 3_multidimensional/5_data_for_visited, 3_multidimensional/4_variables_describing_state, 3_multidimensional/2_second_index, leetcode/problems/1659_maximize_grid_happiness (multidimensional problem that requires 5 dimensions)
parents	1_framework/state_variables, leetcode/explore/dynamic_programming/1_strategic_approach
hyperlink	https://leetcode.com/explore/featured/card/dynamic-programming/631/strategy-for-solving-dp-problems/4098/
location	knowledge/leetcode/leetcode.dz:1273

2025-01-01 12:12 Reading

4_top_down_to_bottom_up
content	Top-down to bottom-up
children	4_top_down_to_bottom_up/2_initialize_array, 4_top_down_to_bottom_up/6_update_return, 4_top_down_to_bottom_up/1_start_with_top_down, 4_top_down_to_bottom_up/5_copy_function_logic, 4_top_down_to_bottom_up/3_set_base_cases, 4_top_down_to_bottom_up/4_iterate
parents	leetcode/explore/dynamic_programming/1_strategic_approach
hyperlink	https://leetcode.com/explore/featured/card/dynamic-programming/631/strategy-for-solving-dp-problems/4099/
location	knowledge/leetcode/leetcode.dz:1319

5_examples_multidimensional
content	Sample multidimensional problems
children	leetcode/problems/1143_longest_common_subsequence, leetcode/problems/1770_max_score_multiplication_operations, leetcode/problems/221_maximal_square
parents	leetcode/explore/dynamic_programming/1_strategic_approach
hyperlink	https://leetcode.com/explore/featured/card/dynamic-programming/631/strategy-for-solving-dp-problems/4100/
location	knowledge/leetcode/leetcode.dz:1357

2025-01-01 12:45 Examples

6_time_space_complexity
content	time and space complexity
parents	leetcode/explore/dynamic_programming/1_strategic_approach
hyperlink	https://leetcode.com/explore/featured/card/dynamic-programming/631/strategy-for-solving-dp-problems/4101/
location	knowledge/leetcode/leetcode.dz:1365

2025-01-01 18:31 More dynamic programming explore card