maximum-length-difference.js

/*
You are given two arrays a1 and a2 of strings. Each string is composed with letters from a to z. Let x be any string in the first array and y be any string in the second array.

Find max(abs(length(x) − length(y)))

If a1 and/or a2 are empty return -1 in each language except in Haskell (F#) where you will return Nothing (None).

Example:
a1 = ["hoqq", "bbllkw", "oox", "ejjuyyy", "plmiis", "xxxzgpsssa", "xxwwkktt", "znnnnfqknaz", "qqquuhii", "dvvvwz"]
a2 = ["cccooommaaqqoxii", "gggqaffhhh", "tttoowwwmmww"]
mxdiflg(a1, a2) --> 13
Bash note:
input : 2 strings with substrings separated by ,
output: number as a string
*/

function mxdiflg(a1, a2) {
    let retorno = 0
    
    console.log(a1)
    console.log(a2)
    if (a1.length == 0 || a2.length == 0){
      return -1
    }
    else {
      for (let i = 0; i < a1.length; i++){
        for (let j = 0; j < a2.length; j++){
          if (a1[i].length - a2[j].length < 0){
            if ((-1*(a1[i].length - a2[j].length)) > retorno) {
              retorno = -1*(a1[i].length - a2[j].length)
            }
          }
          else if (((a1[i].length - a2[j].length)) > retorno) {
              retorno = (a1[i].length - a2[j].length)
          }
        }
      }
    }
    return retorno
}