input: Write a python function to find the sublist with the maximum sum.
  assert max_sum_sublist([1, 2, 3, -2, 5]) == [1, 2, 3, -2, 5]
  assert max_sum_sublist([-1, -2, -3, -4]) == []
  assert max_sum_sublist([4, -1, 2, 1]) == [4, -1, 2, 1]
output: def max_sum_sublist(nums):
      max_sum = float('-inf')
      current_sum = 0
      start = end = s = 0
  
      for i in range(len(nums)):
          current_sum += nums[i]
  
          if current_sum > max_sum:
              max_sum = current_sum
              start = s
              end = i
  
          if current_sum < 0:
              current_sum = 0
              s = i + 1
  
      return nums[start:end+1] if max_sum > 0 else []