Optimal Account Balancing: coding question

Available question text

Given a list of money transfers among people, compute the minimum number of transactions required to settle all debts so every person's net balance becomes zero. After aggregating net balances, the core challenge is to cancel out positive and negative balances optimally—typically solved with backtracking/bitmask DP and aggressive pruning to find the fewest transactions.

Continue with questions that share topics or the same question type.

Beautiful Arrangement
Coding · Array · Backtracking · Bit Manipulation
Number of Ways to Wear Different Hats to Each Other
Coding · Array · Bipartite Graph · Bit Manipulation
Partition Array Into Two Arrays to Minimize Sum Difference
Coding · Array · Binary Search · Bit Manipulation
Smallest Sufficient Team
Coding · Array · Bit Manipulation · Bitmask

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Visa
Leetcode 465. Optimal Account Balancing
Reported Jun 8, 2026 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 4 records

Pinterest
Optimal Account Balancing
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source
Pinterest
Optimal Account Balancing
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 96.7. This is not an interview probability.
View source
Salesforce
Optimal Account Balancing

Available question text

Optimal Account Balancing

Available question text

Related questions

Optimal Account Balancing

Available question text

Related questions