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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3117. Minimum Sum of Values by Dividing Array

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact