Leetcode 2464. Minimum Subarrays in a Valid Split

Partition an array into the minimum number of contiguous subarrays such that each segment satisfies a given validity condition (e.g., no duplicates, a sum/xor property, or other local constraint). The challenge is to minimize segment count under that constraint, typically solved with DP or greedy approaches that track feasible cut positions via prefix information or sliding-window checks.