← Paytm questions

Remove minimum size subarray to make sum divisible by k

Filed under Paytm

Given an array of positive integers and an integer k, find the minimum size subarray (of size at least 2) to remove such that the sum of the remaining elements is divisible by k. Return the removed…

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 Paytm questions

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