Available question text
Pick a subset of walls for the paid painter to minimize total cost such that his total working time allows the free painter (who paints any wall in 1 time unit but only while the paid painter is busy) to finish the remaining walls. Equivalently, it's a 0/1 knapsack/DP: choosing wall i contributes weight time[i]+1 and you need total weight ≥ n at minimum cost.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2742. Painting the Walls
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source