# Splitwise: Minimize Cash Flow Algorithm

Minimize Cash Flow among a given set of friends who have borrowed money from each other.

Given a number of friends who have to give or take some amount of money from one another. Design an algorithm by which the total cash flow among all the friends is minimized.

### Approach :

Greedy. Settle the debts of the people with Max and Min. Credits.

### Data Structure Used :

- Array : To storr the final outputs.
- Map : To store and get remaining individual transaction amounts in O(1) time complexity.

### Implementation :

npm install splitwise-js-map

const Splitwise = require('splitwise-js-map'); var input = [ { 'paidBy': 'A', 'paidFor': { 'B': 300, 'C': 40, 'D': 30 } }, { 'paidBy': 'B', 'paidFor': { 'A': 50, 'B': 100, 'C': 200 } } ] const splits = Splitwise(input); console.log(splits);

Output: [ `from`

, `to`

, `value`

]

[ [ 'C', 'A', 240 ], [ 'B', 'A', 50 ], [ 'D', 'A', 30 ] ]

### Updates :

Feel free to submit PRs for any improvements that you find.