What is wrong with my implementation of Luhn Algorithm?

Question

I am trying to implement Luhn's algorithm for credit card check. I am following all the steps given in the problem on codewars and even getting the correct results but the online judge is not accepting the solution. What am I doing wrong? I know the solution is naive and its a brute force but still why am I unable to pass the test case?

In this Kata, you will implement The Luhn Algorithm, which is used to help validate credit card numbers.

Given a positive integer of up to 16 digits, return true if it is a valid credit card number, and false if it is not.

Here is the algorithm:

If there are an even number of digits, double every other digit starting with the first, and if there are an odd number of digits, double every other digit starting with the second. Another way to think about it is, from the right to left, double every other digit starting with the second to last digit.

1714 => [1*, 7, 1*, 4] => [2, 7, 2, 4]

12345 => [1, 2*, 3, 4*, 5] => [1, 4, 3, 8, 5]

891 => [8, 9*, 1] => [8, 18, 1] If a resulting doubled number is greater than 9, replace it with either the sum of it's own digits, or 9 subtracted from it.

[8, 18*, 1] => [8, (1+8), 1] => [8, 9, 1]

(or)

[8, 18*, 1] => [8, (18-9), 1] => [8, 9, 1] Sum all of the final digits [8, 9, 1] => 8+9+1 => 18 Finally, take that sum and divide it by 10. If the remainder equals zero, the original credit card number is valid.

18 (modulus) 10 => 8.

8 does not equal 0, so 891 is not a valid credit card number.

function validate(n){
    var num = [];
    var i=0;
    var v=n.toString();


    while(i<v.length)
    {
        num.push(parseInt(v[i]));
        i++;
    }

    if(num.length%2===0)
    {
        i=0;
        while(i<num.length)
        {
            if((i+1)%2===1)
            {
                num[i]=num[i]*2;
            }
            i++;
        }
    }
    else
    {
        i=0;
        while(i<num.length)
        {
            if((i+1)%2===0)
            {
                num[i]=num[i]*2;
            }
            i++;
        }
    }



        i=0;
        if(num.length%2===0)
        {
            while(i<num.length)
            {
                if((i+1)%2===1)
                {
                    if(num[i]>9)
                    {
                        num[i]=num[i]-9;
                    }
                }
                i++;
            }
        }
        else
        {
            while(i<num.length)
            {
                if((i+1)%2===0)
                {
                    if(num[i]>9)
                    {
                        num[i]=num[i]-9;
                    }
                }
                i++;
            }
        }


        i=0;
        var sum=0;
        while(i<num.length)
        {
            sum+=num[i];
            i++;
        }

        if(sum%10===0)
        {
            return true;
        }
        else
        {
            return false;
        }
}