Categorise checks for Dynamic Programming: Knapsack, Paths and LIS Families.
Practice this question from Quiz: Dynamic Programming: Knapsack, Paths and LIS Families, with options and an explanation.
Question
Categorise checks for Dynamic Programming: Knapsack, Paths and LIS Families.
Option A
State/invariant
Option B
Complexity
Option C
Only sample case
Explanation
Strong answers explain state, complexity, and more than the sample.