โ† Amazon questions

Maximum sum substring divisible by k

Filed under Amazon

Given an unsorted array of integers A and an integer k, find the maximum sum of a contiguous subarray (substring) such that the sum is divisible by 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 Amazon questions

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