Given a sequence of integers x1, . . . , xn (possibly including negative integers) and an interval of coordinates I = [i, j], write xI to denote the sum P i≤k≤j xk. Give a linear time algorithm to find the interval that maximizes xI .

Jessa bought a yoyo from a company that claims that, with each retraction, the string rolls up by 60% of the original length. she sets up a tape measure and throws the yoyo 3 times. her data are charted below. throw length of string (feet) 1 3 2 1.8 3 1.08 jessa wants to find the sum of the length of string after 10 throws. what is the sum of the lengths, rounded to the nearest hundredth?