Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1775. Equal Sum Arrays With Minimum Number of Operations
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source