LeetCode 265: Paint House II
A clear explanation of the Paint House II problem using optimized dynamic programming with minimum and second minimum tracking.
Tag
Optimization
8 notes
Parametric Search
Convert an optimization problem into a decision problem and search the parameter space.
Continuous Ternary Search
Find the maximum or minimum of a unimodal function over a continuous domain.
Discrete Ternary Search
Find the maximum or minimum of a unimodal function defined on discrete indices.
Binary Search on Answer
Find an optimal value by binary searching a monotone feasibility condition.
Pairwise Min Max Search
Find both minimum and maximum with fewer comparisons by processing elements in pairs.
90. Operations Research, Mathematical Programming
This volume studies decision-making under constraints using mathematical models.
49. Calculus of Variations and Optimal Control; Optimization
This volume studies optimization of functionals and systems.