title: Finding the minimum number of moves changing integers to match others in a list
body: <p>I am extremely new to coding, and as part of an application to a bootcamp was presented with a problem I have been working on all day but Im stumped. It is also timed and I only have about 12 hours left. I must take two integers and match them to a second pair of integers by moving each digit up or down, then adding the minimum number of moves it took me to do so, which would be the final answer. This is my first time using any kind of proramming languge past CSS, so please bear with me. The eample is as follows: </p>
  
  <p>"Andrea and Maria each have an array of integers. Andrea wants to change her array to match Maria's. For each element of her array, sha can increment or decrement on digit in one item in one move. How many moves will it take Andrea to match Marias array.</p>
  
  <p>Complete the function minimumMoves</p>
  
  <p>minimumMoves has the following paramaeters:
  a[a[0],...a[n-1]]:
  m[m[0],...m[n-1]]:</p>
  
  <p>Im so lost and I really need someone to point me in the right direction. Please Help!!!</p>
  
  <p>Ive googled and googled but I just cant wrap my head around it, how to pick out each digit from the integer and go through each one without writing a new line of code for every digit.</p>
  
  <pre><code>#!/bin/python3
  
  import math
  import os
  import random
  import re
  import sys
  
  
  
  #
  # Complete the 'minimumMoves' function below.
  #
  # The function is expected to return an INTEGER.
  # The function accepts following parameters:
  #  1. INTEGER_ARRAY a
  #  2. INTEGER_ARRAY m
  #
  
  def minimumMoves(a, m):
      # Write your code here
      a = [4321, 3211]
      m = [5432, 4302]
      total=0
          if a[0] &lt;= b[0]
             a[0] += 1
          else if a[0] &gt;= b[0]
              a[0] += 1
  </code></pre>