You are given two integer arrays source and target, both of the same length.

In one operation, you can perform the following steps:

• Choose two distinct indices i and j.

• Choose any integer delta.

• Update source[i] to source[i] + source[j] - delta.

• Update source[j] to delta.

Return true if it is possible to transform source into target after applying any number of operations, or false otherwise.

Constraints:

• $2 \leq$ source.length $=$ target.length $\leq 10^5$

• $-10^9 \leq$ source[i], target[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.