input: Write a function to move all zeroes in a list to the end of the list while maintaining the order of other elements. If the list is empty, return an empty list.
  def move_zeroes(lst):
      # Count the number of non-zero elements
      num_non_zeroes = sum(1 for num in lst if num != 0)
    
      # Create a new list with non-zero elements first
      new_lst = [num for num in lst if num != 0]
    
      # Append 0's to the end
      new_lst.extend([0] * (len(lst) - num_non_zeroes))
    
      # Return the new list
      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, 0, 1])==[1, 0, 0, 0, 0]
  assert move_zeroes([1, 2, 3, 4, 5])==[1, 2, 3, 4, 5]
  assert move_zeroes([])==[]
  assert move_zeroes([0, 0, 0])==[0, 0, 0]
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]
      new_lst.extend([0] * (len(lst) - num_non_zeroes))
      return new_lst