Find the max subsequent sum for a random array of numbers

Question

Rahul Gupta · Accepted Answer

int maxSum(int arr[], int size)
{
  int maxSum= 0;
  int currMaxSum = 0;
  for (int i = 0; i < size ; i++)
  {
     currMaxSum += arr[i];
     if (currMaxSum < 0)
      {
           currMaxSum = 0;
      }
      if (maxSum < currMaxSum )
       {
             maxSum  =  currMaxSum ;
        }
     }
    returb naxSum;
     
  }
}

Dhimant · Answer

private static int findMaxSubSeqSum(ArrayList allRecords)
    {
        int maxSum = 0;

        int prevSum = 0;
        int currentSum = 0;
        for (int i = 0; i  maxSum)
            {
                maxSum = currentSum;
            }
            if (currentSum < prevSum)
            {
                currentSum = 0;
            }
        } 
        return maxSum;
    }

Amazon

Pregunta de entrevista de Amazon

Respuestas de entrevistas

Empresas seguidas

Búsquedas de empleo