Available question text
Given nums and queries [l, r, k, v], each query multiplies every element at indices i = l, l+k, l+2k, ... ≤ r by v modulo 1e9+7; after all queries return the bitwise XOR of the final array. The core challenge is efficiently applying many strided (arithmetic-progression) multiplicative range updates under a large modulus and combining the results.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3653. XOR After Range Multiplication Queries I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source