You are given an integer array nums.

A split of the array nums into three non-empty contiguous subarrays nums1, nums2, and nums3 is called beautiful if their concatenation forms nums and at least one of the following conditions holds:

• nums1 is a prefix of nums2.

• nums2 is a prefix of nums3.

Return the total number of beautiful splits of nums.

Constraints:

• $1 \leq$ nums.length $\leq 5000$

• $0 \leq$ nums[i] $\leq 50$

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.