title: Count Number Of Ways To Fill A N X 4 Grid Using 1 X 4 Tiles
signature: func countNumberOfWaysToFillANX4GridUsing1X4Tiles(n int) int64 {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int64, expected int64) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int64) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(61, 188941273)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(22, 657)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(65, 685792227)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(57, 52054840)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(36, 59864)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(25, 1728)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(16, 95)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(26, 2385)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(92, 4123691589365)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(5, 3)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def count_number_of_ways_to_fill_a_n_x_4_grid_using_1_x_4_tiles(n):
      dp = [0 for _ in range((n + 1))]
      for i in range(1, (n + 1)):
          if (i <= 3):
              dp[i] = 1
          elif (i == 4):
              dp[i] = 2
          else:
              dp[i] = (dp[(i - 1)] + dp[(i - 4)])
      return dp[n]
source_cpp: int count_number_of_ways_to_fill_a_n_x_4_grid_using_1_x_4_tiles(int n) {
    int dp [ n + 1 ];
    dp [ 0 ] = 0;
    for ( int i = 1;
    i <= n;
    i ++ ) {
      if ( i >= 1 && i <= 3 ) dp [ i ] = 1;
      else if ( i == 4 ) dp [ i ] = 2;
      else dp [ i ] = dp [ i - 1 ] + dp [ i - 4 ];
    }
    return dp [ n ];
  }