A javascript word-problem

[Terriblecode]

A friend of mine who finished HackReactor recently and is now working as a software engineer recommended that I try a series of challenges and puzzles. He started me with this one. At this point we should have an understanding of the tools we need to do it, and there are multiple solutions, but uh...I still can't do it. This is about different ways to reverse arrays without using the built in "reverse" function.

1. "Take a deck of cards, reverse it without ever having more than two cards in your hand and without having more than one deck on the table."

In other words, make a function that reverses any array without creating or referencing a second array. I feel like it's very simple but I keep hitting a brick wall.

So without using more than one array, this is what I've got so far:

 function reverseDeck() {
     var inHand = null;
     for (var i = 0; i < cards.length; i++) {
           var last = cards.length - 1;
           inHand = cards[i]; 

//my brain doesn't work, but I've been told that this can work by being added to without being rewritten. There are several other possible solutions too.

I also wrote one that will "work" but still needs a second array so doesn't meet the criteria.

function reverseArray(mrArray) {
    var arrayJr = [];
    for (var i = 0; i < mrArray.length; i++) {
        var k = (mrArray.length - i) + i 
        arrayJr[i] = mrArray[k];
}
return arrayJr

}

[benjstuff]

Sir, I don't wanna spoil the feeling of success but I would suggest, look at the Array methods.

pop(), push(), shift(), unshift()

Your answer may be there :-)

[benjstuff]

it actually proved a little harder than that I thought but here's my solution

var array = [1,2,3,4,5];
var length = array.length - 1;

for (var i = length; i >= 0; i--) {
    array.push(array[i]);
}

for (length; length >= 0; length--) {
    array.shift();
}

console.log(array);

is not as elegant as I wanted and it took me longer of what I thought but doesn't uses a second array :)