Algorithm to find the largest palindrome in a string

palindrome.js

function SearchingChallenge(str) { 
  let arrayString = str.split("")
  let reversedArrayString = str.split("").reverse()
  let reversedString = reversedArrayString.join("")
  let result = ''
  let hasNext = true
  let i = 0
   
  while(hasNext){
    for(let j = i + 1 ; j<= arrayString.length ; j ++){
      const slicedString = arrayString.slice(i,j).join("")
      if(slicedString && slicedString.length>2 && reversedString.includes(slicedString)){
          if(slicedString.length > result.length) result = slicedString
      }
    }
    i = i+1
    if(i >= arrayString.length){
      hasNext = false
    }
  }
  return result.length > 2 ? result : 'none'
}
   
// keep this function call here 
console.log(SearchingChallenge(readline()));