Leetcode 2811. Check if it is Possible to Split Array

Determine whether you can recursively split the array into contiguous segments until all are singletons, where each split is allowed only if both resulting parts are "good" (length 1 or sum >= m). This is equivalent to checking existence of a valid binary split tree over intervals and is typically solved with interval DP or memoized recursion using prefix sums.