input: from typing import List
  
  def divide_in_two_equal_parts(lst: List[int]) -> (List[int], List[int]):
      """
      Given a list of integers, 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, 7, 4], [3, 6, 5])
      """
      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
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