Geeksforgeeks · Technology
Money Division using Coins of 3 Units
Given an array arr[] of size n where each element represents the money a person has, and there's an infinite supply of coins of worth 3 units, find if it's possible to divide the money equally among all persons. If possible, find the minimum number of transactions needed.Examples:Input: arr =
Licensed summary · LicensedSummary