Problem · Array
Initial and Final Accounts in a Transfer Chain
Problem statement
You are given directed account-transfer pairs [from, to] in arbitrary order. Together they form one non-branching chain containing every pair exactly once.
The problem statement continues
ProExamples
Example 1
transfers = [[222,111],[111,333],[444,222]]return = [444,333]The complete chain is 444 to 222 to 111 to 333.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week