input: Write a function to move all zeros in a list to the end of the list while maintaining the relative order of the non-zero elements. If the given list is empty, return an empty list.
  def move_zeroes(lst):
      num_non_zeroes = sum(1 for num in lst if num != 0)
      new_lst = [num for num in lst if num != 0] + [0] * (len(lst) - num_non_zeroes)
      return new_lst
  
  assert move_zeroes([3, 0, 1, 0, 5, 0, 2])==[3, 1, 5, 2, 0, 0, 0]
  assert move_zeroes([0, 0, 0, 1, 2, 3])==[1, 2, 3, 0, 0, 0]
  assert move_zeroes([0, 1, 0, 3, 0, 4])==[1, 3, 4, 0, 0, 0]
  assert move_zeroes([1, 2, 3, 0, 0, 0])==[1, 2, 3, 0, 0, 0]
  assert move_zeroes([])==[]
output: def move_zeroes(lst):
      num_non_zeroes = sum(1 for num in lst if num != 0)
      new_lst = [num for num in lst if num != 0] + [0] * (len(lst) - num_non_zeroes)
      return new_lst