[JS] Minimize permutations

minPerms.js

function getPermutations(arr, minOp, original = []) { 
  const result = []; 
  for(let size = 2; size <= arr.length; size++) { 
    for(let i = 0; i + size <= arr.length; i ++) { 
      const permutation = [
        ...arr.slice(0, i),  
        ...arr.slice(i, i + size).reverse(), 
        ...arr.slice(i + size) 
      ];
      if(!isEqual(original, permutation)) {
        result.push({
          permutation,
          minOp,
          original: arr,
        });
      }
    }
  }
  return result;
}

function isEqual(arr1, arr2) {
  if(arr1.length !== arr2.length) return false;
  
  for(const [idx, val] of arr1.entries()) {
    if(val !== arr2[idx]) return false;
  }
  return true;
}

function minOperations(arr) {
  let minOp = 1;
  const sortedArr = [...arr].sort((a, b) => a > b ? 1 : -1); 
  const queue = getPermutations(arr, minOp);
  while(queue.length) {
    const {permutation, minOp, original} = queue.shift();
    if(isEqual(permutation, sortedArr)) return minOp;
    queue.push(...getPermutations(permutation, minOp + 1, original));
  }
  
  throw "Invalid input: " + arr.join();
}