Pergunta de entrevista da empresa CEVA

Q1: You have an array of N integer numbers (positive and negative). Suggest an algorithm that finds sub-array with maximal sum of its numbers with O(n)