code every day with me

--DAY 9--

Hi, I am going to make #100DaysOfCode Challenge. Everyday I will try solve 1 problem from leetcode or hackerrank. Hope you can go with me until end.
Now let's solve problem today:
-Problem: Maximum Subarray
-Detail: https://leetcode.com/problems/maximum-subarray/
-My solution (javascript):

var maxSubArray = function(a) {
  let max=a[0],maxE=0;
  for(let i in a){
    maxE+=a[i];
    if(maxE>max) max=maxE;
    if(maxE<0) maxE=0;
  }
  return max;
};

-->If you have better solution or any question, please comment below. I will appreciate.