Leetcode 3430. Maximum and Minimum Sums of at Most Size K Subarrays

Compute the total sum of the minimum plus maximum element for every subarray of nums with length at most k. The challenge is to do this efficiently (near-linear time) for n up to 80,000 rather than enumerating all subarrays.

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 3430. Maximum and Minimum Sums of at Most Size K Subarrays

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact