← Amazon questions

Find reachable tokens given inference rules

Filed under Amazon

Given a set of directed inference rules (A -> B) and a starting set of tokens, find all reachable tokens. The system must handle cycles and transitive dependencies.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.