input: 
  def divide_in_two_equal_parts(lst):
      """ Given a list of numbers, divide it into two parts such that the difference 
      between the sum of the two parts is minimized.
      >>> divide_in_two_equal_parts([2, 3, 4, 5, 6, 7])
      ([2, 3, 6], [4, 5, 7])
      >>> divide_in_two_equal_parts([10, 20, 30, 40])
      ([10, 40], [20, 30])
      """
      target = sum(lst) // 2
      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
  
output:     target = sum(lst) // 2
      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