Status: IN
The distribute-money solution computes an optimistic greedy answer then applies two corrections for constraint violations (surplus absorption and $4 avoidance), a pattern idiomatic for LeetCode distribution problems.
Source: entries/2026/06/06/distribute-money-to-maximum-children-solution.md