Shortest Palindrome

https://leetcode.com/problems/shortest-palindrome/

JavaScript

/**
 * @param {string} s
 * @return {string}
 */
var shortestPalindrome = function (s) {
    var chars = s.split(''),
        reversed = chars.slice().reverse();
    if (isPalindrome(s)) return s;
    for (var i = 0, n = chars.length - 1; i < n; i++) {
        var joined = reversed.slice(0, i + 1).concat(chars).join('');
        if (isPalindrome(joined)) {
            return joined;
        }
    }
};

var isPalindrome = function (str) {
    var chars = str.split('');
    for (var i = 0, n = Math.floor(chars.length / 2); i < n; i++) {
        if (chars[i] !== chars[chars.length - i - 1]) {
            return false;
        }
    }
    return true;
};


console.log(shortestPalindrome('akdnasdasldlndsas'));