title: Count Number Of Ways To Cover A Distance 1
signature: def countNumberOfWaysToCoverADistance1(dist: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Long , expected: Long): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(dist: Int, expected: Long): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(dist),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        37, 
        3831006429L    
      )}")   
  
  
      println(s"TEST-1...${driver(
        58, 
        1383410902447554L    
      )}")   
  
  
      println(s"TEST-2...${driver(
        53, 
        65720971788709L    
      )}")   
  
  
      println(s"TEST-3...${driver(
        11, 
        504L    
      )}")   
  
  
      println(s"TEST-4...${driver(
        58, 
        1383410902447554L    
      )}")   
  
  }
  
source_py: def count_number_of_ways_to_cover_a_distance_1(dist):
      count = ([0] * (dist + 1))
      count[0] = 1
      count[1] = 1
      count[2] = 2
      for i in range(3, (dist + 1)):
          count[i] = ((count[(i - 1)] + count[(i - 2)]) + count[(i - 3)])
      return count[dist]
source_cpp: int count_number_of_ways_to_cover_a_distance_1(int dist) {
    int count [ dist + 1 ];
    count [ 0 ] = 1, count [ 1 ] = 1, count [ 2 ] = 2;
    for ( int i = 3;
    i <= dist;
    i ++ ) count [ i ] = count [ i - 1 ] + count [ i - 2 ] + count [ i - 3 ];
    return count [ dist ];
  }