You are given an array of non-negative integers numbers. You are allowed to choose any number from this array and swap any two digits in it. If after the swap operation, the number contains leading zeros, they can be omitted and not considered (eg: 010 will be considered just 10).You task is to check whether it is possible to apply the swap operation at most once, so that the elements of the resulting array are strictly increasing.eg. [1,5,900,10] return trueThinking of doing checking the array for modifications first, once a number to modify is found, will try to get the permutations with duplicates (subsets II) , removing 0s at the same time, which will return a list of permutations. Check if any number in that permutation list greater than nums[i - 1] or smaller than nums[i + 1], if no value fits that category, return false.