Dynamic Programming / 1Dhard70 minFrontend Engineer

Table Ranking Budget Optimizer

Frontend Engineer signal: dynamic programming + knapsack in a virtualized analytics table context. This is a ProdMatch-owned frontend engineer drill, framed as a March 2026 Apple Dashboard UX simulation, not a copied platform question.

Company context

Apple · Dashboard UX

Freshness

March 2026

Product surface

virtualized analytics table

ProdMatch interview simulation based on product-team patterns; not a claim of a real company question.

Question

Your Dashboard UX roadmap has candidate improvements for virtualized analytics table. Each improvement has cost, lift and risk. Maximize lift under budget while keeping total risk below a threshold.

Input

Items [cost, lift, risk], budget and maxRisk.

Output

Maximum lift achievable.

Constraints

1 <= items.length <= 500
Budget <= 10000
maxRisk <= 10000

Concepts

render scheduling
state graphs
virtualization
dynamic programming
knapsack
ranking trade-off

items [[2,5,1],[4,9,4]], budget=4, risk=4 -> 9

Approach

Try framing your own approach first. The 30 seconds you think before peeking is where learning happens.

Clean Solution

Reveal the approach first.

How well did you understand?

Your rating tunes when this problem shows up again.

Common Mistakes

Unclear state definition usually causes off-by-one bugs.
Do not overwrite a state before all consumers have used it.

Next Similar Problems

Timeline Ranking Budget Optimizermedium Autocomplete Ranking Budget Optimizerhard Canvas Ranking Budget Optimizerhard