Triesmedium45 minSecurity Engineer

Policy Prefix Intent Index

Security Engineer signal: trie + prefix counts in a authorization policy engine context. This is a ProdMatch-owned security engineer drill, framed as a March 2026 Swiggy Identity simulation, not a copied platform question.

Company context

Swiggy · Identity

Freshness

March 2026

Product surface

authorization policy engine

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

Question

Build a prefix index for authorization policy engine. 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

attack graphs
policy tries
anomaly detection
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

Attack Prefix Intent Indexhard Anomaly Prefix Intent Indexmedium Secrets Prefix Intent Indexmedium