Leetcode 3010. Divide an Array Into Subarrays With Minimum Cost I

Partition the array into three contiguous parts by choosing two cut indices; the cost is the sum of the first elements of each part (nums[0] plus the values at the two cut starts). Find the minimum possible cost, i.e., choose increasing indices i<j to minimize nums[0] + nums[i] + nums[j].

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 3010. Divide an Array Into Subarrays With Minimum Cost I

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact