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.