Leetcode 3117. Minimum Sum of Values by Dividing Array

Partition the array nums into m disjoint contiguous subarrays in order so that the bitwise AND of the i-th subarray equals andValues[i], and return the minimum possible sum of the subarrays' values (defined as each subarray's last element), or -1 if no valid partition exists.