input: def divide_in_two_equal_parts(lst):
      target = sum(lst) // 2
      part1 = []
      part2 = []
      left_sum = 0
      right_sum = 0
      
      for num in lst:
          if left_sum <= right_sum:
              left_sum += num
              part1.append(num)
          else:
              right_sum += num
              part2.append(num)
           
      return part1, part2
  
  """
  Split a given list of numbers into two equal parts such that the difference between the sums of the two parts is minimized.
  
  >>> part1, part2 = divide_in_two_equal_parts([2, 3, 4, 5, 6, 7])
  >>> part1
  [2, 3, 4, 5]
  >>> part2
  [6, 7]
  """
output:     if sum(lst) % 2 != 0:
          return None
      
      part1 = []
      part2 = []
      left_sum = 0
      right_sum = 0
      
      for num in sorted(lst, reverse=True):
          if left_sum <= right_sum:
              left_sum += num
              part1.append(num)
          else:
              right_sum += num
              part2.append(num)
      
      return part1, part2