How should I practice Maximum Index-Weighted Sum with Disjoint Swaps?

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

Is Maximum Index-Weighted Sum with Disjoint Swaps associated with Visa?

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

Maximum Index-Weighted Sum with Disjoint Swaps

Visa● HardFULLTIMEOA

Learn

Problem statement

For an integer array nums, its score is sum(i * nums[i]) using zero-based indices.

You may choose any number of pairwise-disjoint swaps, including zero. A swap may exchange any two positions, but no position may participate in more than one swap. Return the maximum attainable score.

Function

maxIndexWeightedSum(nums: int[]) → long

Examples

Example 1

nums = [2,1,4,3]return = 20

Swapping positions 0 and 1 and positions 2 and 3 produces [1,2,3,4] with score 20.

Example 2

nums = [-1,5,2]return = 12

Swapping positions 1 and 2 gives [-1,2,5], whose score is 12.

Constraints

1 <= nums.length <= 18.
-1000000 <= nums[i] <= 1000000.
The answer fits a signed 64-bit integer.