{"id":"greedy-with-post-hoc-correction","text":"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.","truth_value":"IN","source":"entries/2026/06/06/distribute-money-to-maximum-children-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"greedy-with-post-hoc-correction","truth_value":"IN","reason":"premise"}]}}