Given an integer array nums of length n, return true if there exists a triplet of indices (i, j, k) satisfying $0 <$ i and i $+ 1 <$ j and j $+ 1 <$ k $< n - 1$ such that the sums of the following four subarrays are equal:

• The sum of elements from index $0$ to index i $- 1$

• The sum of elements from index i $+ 1$ to index j $- 1$

• The sum of elements from index j $+ 1$ to index k $- 1$

• The sum of elements from index k $+ 1$ to index n $- 1$

Return false if no such triplet exists.

Constraints:

• n == nums.length

• $1 \leq$ n $\leq 2000$

• $-10^6 \leq$ nums[i] $\leq 10^6$

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.