You are viewing a single comment's thread. Return to all comments →
js Sol:O(n)
let map=new Map(); for(let i=0;i<arr.length;i++){ map.set(arr[i],i); } let n=arr.length; let i=0; while(k!=0 && n>0){ //1 let val=arr[i]; //2 if(n>val){ //2 arr[i]=n; // arr[map.get(n)]=val map.set(val,map.get(n)); map.delete(n); k--; } i++; n--; } return arr;
Largest Permutation
You are viewing a single comment's thread. Return to all comments →
js Sol:O(n)