3388. Count Beautiful Splits in an Array

LeetCodeArrayDynamic ProgrammingOpen on judge ↗

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. Example 1: Input: nums = [1,1,2,1] Out

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI