Dynamic Programming / 2Dhard70 minData Engineer

Lineage Grid Reliability DP

Data Engineer signal: grid DP + path optimization in a data lineage graph context. This is a ProdMatch-owned data engineer drill, framed as a April 2026 Nykaa Data Platform simulation, not a copied platform question.

Company context

Nykaa · Data Platform

Freshness

April 2026

Product surface

data lineage graph

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

Question

Model data lineage graph as a grid of processing zones. Move only right or down. Return the maximum reliability path score while avoiding blocked cells.

Input

Grid of scores with blocked cells marked -1.

Output

Maximum score from top-left to bottom-right, or -1.

Constraints

1 <= rows, cols <= 1000
Scores may be zero.
Start or end may be blocked.

Concepts

stream windows
watermarks
lineage DAGs
grid DP
path optimization
obstacle handling

[[5,1],[2,4]] -> 11

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

Blocked start/end must be handled before the loop.
Use the impossible sentinel consistently.

Next Similar Problems

Watermark Grid Reliability DPhard Dedupe Grid Reliability DPhard Join Grid Reliability DPhard