Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Determine the Minimum Sum of a k-avoiding Array
Coding
- Find the Minimum Possible Sum of a Beautiful Array
Coding
- Minimum Array Sum
Coding
- Minimum Operations to Halve Array Sum
Coding · Array · Greedy · Heap (Priority Queue)
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3117. Minimum Sum of Values by Dividing Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source