LeetCode Question · Sep 2020 · Los Angeles

Amazon | Online Screener 2021 | Minimum Moves For Equal Array Sums

4 upvotes 851 views 6 replies

Question Details

Given 2 arrays, return the minimum number of moves needed in order to make the sums of both arrays equal, or return -1 if this is not possible. Ex. 1: Given...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Graph Dynamic Programming Queue