Practice Expedia Coding Question | Real Coding Interviews

Quick Summary

Apply a sequence of range negation updates to an integer array using 1-based indexing.
Each update flips the sign of all elements within a specified inclusive range.
Return the final array state after processing all updates optimally.

What This Tests

Efficient range update techniques beyond brute force iteration
Index conversion between 1-based problem statements and 0-based arrays
Difference array construction and prefix sum accumulation
Parity checking to determine net effect of overlapping ranges

Common Patterns

Difference Array

Prefix Sum

Array Manipulation

A data analyst is given an array data of integers representing daily data values. Elements may be positive, negative, or zero.

An array of range-negate updates is then applied in sequence. Each update updates[i] = [l, r] negates every element from index l to index r inclusively, using 1-based indexing. Negating an element means multiplying it by −1.

Test Cases

Input

Output

Expected