Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2601. Prime Subtraction Operation
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.
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.