Available question text
Determine whether you can make nums strictly increasing by, for each index at most once, subtracting any prime smaller than nums[i] (or leaving it unchanged). The core challenge is choosing per-element prime subtractions (or none) so that after a left-to-right feasibility check every element exceeds its predecessor.
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 2601. Prime Subtraction Operation
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source