Prime Subtraction Operation In Array
Can make nums strictly increasing by subtracting primes: loop through nums, find largest prime less than num - prevNum and subtract it if possible.
2601. Prime Subtraction Operation Difficulty: Medium Topics: Array, Math, Binary Search, Greedy, Number Theory You are given a 0-indexed integer array nums of length n. You can perform the following operation as many times as you want: Pick an index i that you haven’t picked before, and pick a prime p strictly less than nums[i], then subtract p from nums[i]. Return true if you can make nums a strictly increasing array using the above operation and false otherwise. A strictly increasing array is an array whose each element is strictly greater than its preceding element. Example 1: Input: num...