leetcode/explore/dynamic_programming/1_strategic_approach/3_multidimensional

3_multidimensional

dz / leetcode / explore / dynamic_programming / 1_strategic_approach / 3_multidimensional

Node Tree

Nodes

1_index_along_input
content index along some input. This is usually used if an input is given as an array or string.
parents leetcode/explore/dynamic_programming/1_strategic_approach/2_examples, leetcode/explore/dynamic_programming/1_strategic_approach/3_multidimensional
location knowledge/leetcode/leetcode.dz:1285

2_second_index
content second index along some input
parents leetcode/explore/dynamic_programming/1_strategic_approach/3_multidimensional
location knowledge/leetcode/leetcode.dz:1294

3_explicit_numerical_constraints
content Explicit numerical constraints in the problem, ex: "you are only allowed to complete K transactions" or "you are allowed to break up K obstacles", etc
parents leetcode/explore/dynamic_programming/1_strategic_approach/3_multidimensional
location knowledge/leetcode/leetcode.dz:1298

4_variables_describing_state
content Variables describing status in a given state. Ex: "true if currently holding key, false if not", "currently holding k packages", etc
parents leetcode/explore/dynamic_programming/1_strategic_approach/3_multidimensional
location knowledge/leetcode/leetcode.dz:1305

5_data_for_visited
content some sort of data or bitmask to indicate things like being "visited" or "used".
parents leetcode/explore/dynamic_programming/1_strategic_approach/3_multidimensional
location knowledge/leetcode/leetcode.dz:1311