How should I practice Alternating Index Square Sum?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Accenture onsite interview problems in FastPrep.

Is Alternating Index Square Sum associated with Accenture?

FastPrep tags this as a Accenture onsite interview coding practice problem when the problem catalog has that company and stage context.

Alternating Index Square Sum

Accenture● EasyNEW GRADONSITE INTERVIEW

Learn

Problem statement

Given an integer array values, compute an alternating signed sum of squares:

Add values[i]^2 when i is even.
Subtract values[i]^2 when i is odd.

Indexes are zero-based. Return the resulting 64-bit integer.

Function

alternatingSquareSum(values: int[]) → long

Examples

Example 1

values = [1,2,3,4]return = -10

The result is 1^2 - 2^2 + 3^2 - 4^2 = -10.

Example 2

values = [5]return = 25

The only element is at even index 0, so its square is added.

Example 3

values = [-2,-3,4]return = 11

Squaring removes the signs, so the result is 4 - 9 + 16 = 11.

Constraints

1 <= values.length <= 10^5.
-10^6 <= values[i] <= 10^6.
The final result fits in a signed 64-bit integer.