Credit Card sum challenge.

Question

Contain all variables and code needed within a function. Have that function take one argument which will be an array of credit card number strings. Determine the sum of digits for each credit card number. Determine which credit card number has the last largest sum of digits. Use a return statement to return the required card number in its’ original form.

I pretty much have this, just need to return the original form of the card.

var reducedCards = [];
console.log(reducedCards)

function printNumbers(arrayOfCards) {
    arrayOfCards.forEach(function(card){
    card = card.replace(/-/g, '').split('').reduce(function(prev, curr){
            return Number(prev) + Number(curr);
        });
    reducedCards.push(card);
    });
  console.log(Math.max.apply(Math, reducedCards));
}
printNumbers(cards)

Answer 1 · 2017-01-07T08:42:44Z

January 7, 2017 8:42am

First - a few notes.

This line:

card.replace(/-/g, '').split('')

is unnecessary. You can just split it directly, like this:

card.split('-')

Here is the code:

var cards = ['9999-9999','1212-1212','2323-2323','3434-3434'];

function getLargerstCreditCard(arrayOfCards) {
    /*
        1) This just essentially makes a new 2D array, with the original card-form and it's sum, like this:

            [ [ '9999-9999', 19998 ],
            [ '1212-1212', 2424 ],
            [ '2323-2323', 4646 ],
            [ '3434-3434', 6868 ] ]

        2) The sort method just sorts it by the sum desc (largest sum first)

        3) the [0][0] in the end is basically get the first credit-card number in the 2D array

    */


    return arrayOfCards
        // 1 - see comments above
        .reduce((a,b) => {
            a.push([b, b.split('-').map(Number).reduce((a,b) => a+b)]);
            return a;
        }, [])

        //2
        .sort((a,b) => b[1] - a[1])[0][0];
}


console.log(getLargerstCreditCard(cards))

Welcome to the Treehouse Community

Looking to learn something new?

Robert Torres

Robert Torres

Credit Card sum challenge.

1 Answer

Thomas Nilsen

Thomas Nilsen

Robert Torres

Robert Torres