Palindrome, Fibonacci, First non repeating index

algorithms.js

function isPalindrome1(word) {
    const len = word.length;
    for (let i = 0; i < len / 2; i++) {
        if (word[i] !== word[len-1-i]) {
            return false;
        }
    }
    return true;
}

function isPalindrome2(word) {
    const values = word.split("");
    const reverse = values.reverse();
    const reverseValues = reverse.join('');
    return word == reverseValues;
}

console.log(isPalindrome2("krk"));
console.log(isPalindrome2("petr"));

function getFibonacci(num) {
    let n1 = 0, n2 = 1, nextNumber;
    let fibonacci = [];

    for (let i = 1; i <= num; i++) {
        fibonacci.push(n1);
        nextNumber = n1+n2;
        n1 = n2;
        n2 = nextNumber;
    }

    return fibonacci;
}

function firstNonRepeatingIndex(input) {
    const setSize = new Set(input).size;
    if (setSize == input.length || setSize === 1) {
        return -1;
    }
    const characters = input.split("");
    for (let x = 0; x < characters.length; x++) {
        let char = input.charAt(x);
        if (input.indexOf(char) == x && input.indexOf(char, x+1) == -1) {
            return input.indexOf(char);
        }
    }
}