Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3655. XOR After Range Multiplication Queries II
Given nums and queries [l,r,k,v] that multiply every element at indices l, l+k, l+2k,... ≤ r by v (mod 1e9+7), return the bitwise XOR of the final array. With n,q up to 1e5, the core challenge is to apply multiplicative updates to arithmetic subsequences (indices sharing the same residue mod k) efficiently instead of updating each element per query.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.