Search
⌘K

Leetcode 2066. Account Balance

Given a list of peer-to-peer transactions, compute each account's net balance and find the minimum number of money transfers required to settle all debts by modeling nonzero nets and searching for optimal pairings (typically solved with DFS/backtracking or bitmask DP with pruning over at most ~20 people).


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.