input: Write a function to calculate the Euclidean distance between two points in a multidimensional space. The function should take two points as input, where each point is represented as a list of coordinates. The output should be the Euclidean distance between these two points. If either of the points is empty, the function should return 0.
  
  def euclidean_distance(point1, point2):
      if len(point1) == 0 or len(point2) == 0:
          return 0
      sum_squared_distance = 0
      for i in range(len(point1)):
          sum_squared_distance += (point1[i] - point2[i])**2
      return sum_squared_distance**0.5
  
  assert euclidean_distance([1, 2], [4, 6]) == 5.0
  assert euclidean_distance([0, 0, 0], [1, 1, 1]) == 1.7320508075688772
  assert euclidean_distance([], [1, 2, 3]) == 0
  assert euclidean_distance([1, 2, 3], []) == 0
  assert euclidean_distance([], []) == 0
output: def euclidean_distance(point1, point2):
      if len(point1) == 0 or len(point2) == 0:
          return 0
      sum_squared_distance = 0
      for i in range(len(point1)):
          sum_squared_distance += (point1[i] - point2[i])**2
      return sum_squared_distance**0.5