Triesmedium45 minData Engineer

Lineage Prefix Intent Index

Data Engineer signal: trie + prefix counts in a data lineage graph context. This is a ProdMatch-owned data engineer drill, framed as a March 2026 Lenskart Data Platform simulation, not a copied platform question.

Company context

Lenskart · Data Platform

Freshness

March 2026

Product surface

data lineage graph

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

Question

Build a prefix index for data lineage graph. Support insert(term, weight), delete(term), and topPrefix(prefix) returning the best active term by weight then lexicographic order.

Input

A sequence of index operations.

Output

Return values for topPrefix operations.

Constraints

1 <= operations <= 200000
Total characters <= 1000000
Weights can change through reinsertion.

Concepts

stream windows
watermarks
lineage DAGs
trie
prefix counts
autocomplete

insert pay 5, insert payout 7, topPrefix pa -> payout

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

Deletion is hard if nodes cache best child; use lazy invalidation or per-node heap when deletes are frequent.
Tie-break lexicographically for deterministic output.

Next Similar Problems

Watermark Prefix Intent Indexhard Dedupe Prefix Intent Indexmedium Join Prefix Intent Indexmedium