Available question text
Repeatedly replace the leftmost minimum in nums with itself times multiplier for k operations and return the array modulo 1e9+7. The core challenge is handling very large k efficiently (n ≤ 1e4, k up to 1e9) by using a min-heap and batching repeated multiplications rather than simulating each step.
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 3266. Final Array State After K Multiplication Operations II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source