← Accenture questions
CodingEasy to Medium

Max and min sum subarray of size k

Filed under Accenture

Given an array of integers and an integer k, find the maximum and minimum sum possible for any contiguous subarray of size k.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Accenture questions

Collected from public candidate posts and coding forums. Updated Nov 2026.