input: Write a python function to find the length of the longest common subarray between two arrays.
  assert find_longest_common_subarray([1, 2, 3, 4, 5], [3, 4, 2, 6]) == 2
  assert find_longest_common_subarray([1, 2, 3, 4, 5], [1, 2, 3, 4, 5]) == 5
  assert find_longest_common_subarray([1, 2, 3], [4, 5, 6]) == 0
  assert find_longest_common_subarray([1, 2, 3, 4, 5], [5, 4, 3, 2, 1]) == 1
output: def find_longest_common_subarray(arr1, arr2):
      m, n = len(arr1), len(arr2)
      dp = [[0] * (n + 1) for _ in range(m + 1)]
      max_len = 0
      
      for i in range(1, m + 1):
          for j in range(1, n + 1):
              if arr1[i - 1] == arr2[j - 1]:
                  dp[i][j] = dp[i - 1][j - 1] + 1
                  max_len = max(max_len, dp[i][j])
      
      return max_len