airplane-sorting-algorithm.js

index.js

function solution(N, S) {
  const occupied = S.split(' ')
  let available = 0
  console.log("solution -> available", available)

  
  for (let index = 0; index < N; index++) {
    if (
      occupied[index] === `${index + 1}A` || 
      occupied[index] === `${index + 1}B` || 
      occupied[index] === `${index + 1}C` || 
      occupied[index] === `${index + 1}D` || 
      occupied[index] === `${index + 1}E` || 
      occupied[index] === `${index + 1}F` || 
      occupied[index] === `${index + 1}I` || 
      occupied[index] === `${index + 1}J` || 
      occupied[index] === `${index + 1}K`
    ){
      available++
    }

  }

  console.log("solution -> available", available)
  return available
}

const two = solution(2, '1A 2F 1C')
console.log("available", two)