LLD - Design — Splitwise (Expense Sharing)
Given net balances: John: +60, Mary: -20, Paul: -40, what is the minimum number of transactions required to settle all debts using the Simplify debts algorithm?
Given net balances: John: +60, Mary: -20, Paul: -40, what is the minimum number of transactions required to settle all debts using the Simplify debts algorithm?
medium📝 Analysis Q4 of Q15
Step-by-Step Solution
Solution:
Step 1: Analyze net balances
John is owed 60, Mary owes 20, Paul owes 40.Step 2: Match creditors and debtors
Mary pays John 20, Paul pays John 40.Step 3: Count transactions
Two transactions settle all debts.Final Answer:
2 -> Option BQuick Check:
Sum of debts equals sum of credits, transactions match debtors count [OK]
Quick Trick: Minimum transactions equal number of debtors after simplification [OK]
Common Mistakes:
MISTAKES- Assuming each person must pay multiple times
- Counting total people instead of transactions
- Ignoring net balance signs
Master "Design — Splitwise (Expense Sharing)" in LLD
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore LLD Quizzes