#3388

Count Beautiful Splits in an Array

medium · 18.6% accepted · 105 likes · top 1%

array · dynamic programming

Description

You are given an array nums.

A split of an array nums is beautiful if:

- The array nums is split into three subarrays: nums1, nums2, and nums3, such that nums can be formed by concatenating nums1, nums2, and nums3 in that order.

- The subarray nums1 is a prefix of nums2 OR nums2 is a prefix of nums3.

Return the number of ways you can make this split.

Solution