Date: Mar 16 2020
Problem: Optimal account balancing https://leetcode.com/problems/optimal-account-balancing/

Given a list of transactions, each transaction consists of two entities lender, receiver and the transaction amount, find a way to perform the transactions with the minimum number of transactions

Example:
A -> B 10
B -> C 10
Solution: A -> C 10 (minimum number =1)

Example2:
A -> B 10
A -> C 10
D -> F 10
E -> F 10
Solution: A -> F 20, D -> B 10, E ->C 10 (minimum number = 3)

There is one point a bit different from usual question on LeetCode. The input structure is not given and you could define your own data structure and use that as your input structure.