Given an array of integers arr, return true if the array can be partitioned into $3$ non empty contiguous parts with equal sums, and false otherwise.

Formally, the array can be partitioned if there exist indices i and j with $i + 1 < j$ such that:
(arr[$0$] + arr[$1$] + $\dots$ + arr[i]) = (arr[i + $1$] + arr[i + $2$] + $\dots$ + arr[j - $1$]) = (arr[j + $1$] + $\dots$ + arr[arr.length - $1$])

Constraints:

• $3 \leq$ arr.length $\leq 5 \times 10^4$

• $-10^4 \leq$ arr[i] $\leq 10^4$

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.