:warnig: Este no es ssu codigo pero les puede dar una idea de como se resuelve con el localcompare podrian haber solo comparado el length de los strings

switch( true ) {
  case (lex < 0): 
    console.log(`The driver's name goes first`);
    break;
  case (lex > 0):
    console.log(`Yo, the navigator goes first definitely`);
    break;
  case (lex == 0):
    console.log(`What?! You both got the same name?`);
    break;
}```

me imageine que ice algo mal en el pull request
anexo el código nuestro sólo por si acaso

let nav=hacker2
let pmenosl=""
if(driver.length>nav.length){
console.log("The Driver has the longest name, it has "+driver.length+" characters")
pmenosl=nav
} else if(driver.length<nav.length){
console.log("Yo, navigator got the longest name, it has "+nav.length+" characters")
pmenosl=driver
} else{
console.log("wow, you both got equally long names, "+driver.length+" characters!!")
pmenosl=nav
}

var cap=""
for(var j=0;j<driver.length;j++)
cap+=" "+driver[j].toUpperCase()
console.log(cap)

var rev=""
for(var i=0;i<nav.length;i++)
rev+=nav[nav.length-1-i]

let alpha=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
console.log(rev)
let d=n=""
for(l=0;l<driver.length;l++)
if(driver[l].match(/[a-z,A-Z]/i))
d+=driver[l]

for(m=0;m<nav)

for(k=0;k<pmenosl.length;k++)
if()
//Bonus
resb=true
for(var h=0;h<palabra.length;h++)
if(palabra[palabra.length-1-h]!==plabra[h])

if(resb)
console.log("la palabra es palindromo")
else
console.log("la palabra no es palindromo")