Given an array of n integers, Write an algorithm to find the number(s) of the array that cannot be represented as the sum of any pair of numbers within the array. If there is no such element, print appropriate message. code example

Example: create a function that checks the values of the indexes in two arrays and keep a score

const triplets = (arr1,arr2) => {
  let score1 = 0;
  let score2 = 0;
  let resultArr = [0,0]
  for (let i = 0; i < arr1.length; i++){
    if(arr1[i] === arr2[i]) {
      resultArr[0] = score1
      resultArr[1] = score2
    } else if (arr1[i] > arr2[i]) {
      score1++
      resultArr[0] = score1
    } else if (arr1[i] < arr2[i]) {
      score2++
      resultArr[1] = score2
    }
  }
  return resultArr
}