Javascript challenge Question2

Can you guys, help me with this in javascript, I am a completely beginner, I have been struggling with it more than hour and I can’ t figure out.

There two arrays of integers arr1 and arr2. One moves is defined as an increment or decrement by one of each digit of the item in the array. How many moves would it take to match the array arr1 with the array arr2. No reordering of the digits is allowed.

arr1 = [123, 4543]
arr2 = [321, 279]

Hello, webmaster.

It is difficult to help you, if we do not know what you already know, or what you have already tried.

Do you know you can access the first element of arr1 like this: arr1[0]. This would give you 123. Now, do the same with arr2, and subtract to find the number of moves it would take.

Hope this helps.

Firstly, welcome to the forums.

While we are primarily here to help people with their Free Code Camp progress, we are open to people on other paths, too. Some of what you are asking is pretty trivial in the Free Code Camp context, so you might find that if you’re not getting the instruction and material you need in your current studies, the FCC curriculum will really help you get started. At a modest guess I’d say investing a 4-5 hours working through the curriculum here will really pay off. You can find the curriculum at

With your current questions, we don’t have enough context to know what you already know or don’t know, so it is impossible to guide you without just telling you the answer (which we won’t do).

It is pretty typical on here for people to share a codepen / / jsfiddle example of what they have tried so that anyone helping has more of an idea of what help is actually helpful.

Please provide some example of what you’ve tried and I’m sure you’ll get more help.

Happy coding :slight_smile: