Dinner.js

// function ShortestRotationDinner(A, B) {
//     if (A.length !== B.length) {
//       return -1; 
//     }
  
//     let minimumCount = A.length; 
  
//     for (let rotation = 0; rotation < A.length; rotation++) {
//       let count = 0;
//       let b = [B[B.length - 1]];
  
//       for (let i = 0; i < B.length - 1; i++) {
//         b.push(B[i]);
//         const currentValue = b[i];
    
  
//         for (let j = 0; j < A.length; j++) {
//           let currentValueInDish = A[j];
//           if (currentValueInDish === currentValue) {
//             count++;
//           }
//         }
//       }
//       if (count < minimumCount) {
//         minimumCount = count;
//       }
//     }
  
//     return minimumCount;
//   }
  
//   let A1 = [1, 3, 5, 2, 8, 7];
//   let B1 = [7, 1, 9, 8, 5, 7];
//   console.log(ShortestRotationDinner(A1, B1)); // Output should be 2
  
 
function solution(A, B) {
  if (A.length !== B.length) {
    return -1;
  }

  const n = A.length;

  for (let i = 0; i < n; i++) {
    let isSatisfied = true;
    let rotations = i;  // Initialize with the current rotation count

    for (let j = 0; j < n; j++) {
      if (A[j] === B[(j + i) % n]) {
        console.log(rotations)
        isSatisfied = false;
        break;
      }
    }

    if (isSatisfied) {
      return rotations;
    }
  }

  return -1;
}


  
  console.log(solution([1, 3, 5, 2, 8, 7], [7, 1, 9, 8, 5, 7])); // Output should be 2