LeetCode 265: Paint House II
A clear explanation of the Paint House II problem using optimized dynamic programming with minimum and second minimum tracking.
8 notes
A clear explanation of the Paint House II problem using optimized dynamic programming with minimum and second minimum tracking.
Convert an optimization problem into a decision problem and search the parameter space.
Find the maximum or minimum of a unimodal function over a continuous domain.
Find the maximum or minimum of a unimodal function defined on discrete indices.
Find an optimal value by binary searching a monotone feasibility condition.
Find both minimum and maximum with fewer comparisons by processing elements in pairs.
This volume studies decision-making under constraints using mathematical models.
This volume studies optimization of functionals and systems.