โ† Infosys questions
CodingMedium

Minimum cost after deleting a subarray of length at most k

Filed under Infosys

Given a permutation of length n and integer k, delete any single subarray of length at most k, concatenate the remaining parts, and find the minimum number of inversion pairs in the resulting array.

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

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