Leetcode 1775. Equal Sum Arrays With Minimum Number of Operations

Given two arrays with values 1..6, change any elements to any value (1..6) and return the minimum operations to make their sums equal or -1 if impossible. The core challenge is covering the sum difference with as few operations as possible by greedily using the largest per-element adjustments (up to 5), typically implemented with frequency buckets of potential gains.