How should I practice Maximum Subarray Sum After Swaps?

Start by reading the full statement, solve the visible examples, then compare the pattern against related infosys online assessment problems in FastPrep.

Is Maximum Subarray Sum After Swaps associated with infosys?

FastPrep tags this as a infosys online assessment coding practice problem when the problem catalog has that company and stage context.

Problem

Maximum Subarray Sum After Swaps

Learn this problem

infosysOA

Problem statement

You are given an integer array a and an integer k.

You may perform at most k swap operations. In one swap, choose any two indices i and j and swap a[i] with a[j].

After performing at most k swaps, return the maximum possible subarray sum.

Function

maximumSubarraySumAfterSwaps(a: int[], k: int) → int

Examples

Example 1

a = [1,-5,2]k = 1return = 3

Choose the subarray [-5,2] and swap -5 with the outside value 1. The resulting chosen subarray has sum 1 + 2 = 3.

Example 2

a = [4,-10,3,2]k = 1return = 9

Choose the subarray [4,-10,3] and swap -10 with the outside value 2. The subarray sum becomes 4 + 2 + 3 = 9.

Example 3

a = [-2,3,-1]k = 0return = 3

No swaps are allowed, so this is the usual maximum subarray sum.

Constraints

2 <= a.length <= 500
0 <= k <= 500
-1000 <= a[i] <= 1000