title: Maximum Sum Iarri Among Rotations Given Array 1
signature: def maximumSumIarriAmongRotationsGivenArray1(arr: List[Int], n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(arr: List[Int], n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        List(6, 6, 13, 14, 16, 20, 24, 24, 24, 27, 28, 36, 49, 51, 55, 56, 62, 69, 74, 74, 76, 85, 86, 90, 92, 98), 13, 
        2249    
      )}")   
  
  
      println(s"TEST-1...${driver(
        List(-42, 96, 68, 64, 14, -74, 76, 42, 34, -92, -20, 28, -80, -34, -22, 96, -46, 96, 10, -82, 82, 50, -24, 48, 56, 72, -40, -86, 84, 66, -62, 50, -76, 34), 27, 
        9152    
      )}")   
  
  
      println(s"TEST-2...${driver(
        List(0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1), 10, 
        35    
      )}")   
  
  
      println(s"TEST-3...${driver(
        List(37, 88, 70, 86, 24, 62, 34, 44, 37, 42, 46, 34, 23, 32, 55, 2, 5, 70, 30, 46, 40, 65, 91, 4, 7, 74, 46, 12, 30, 22, 1, 91, 89, 88, 97, 6, 6, 11, 33, 14, 68, 24), 39, 
        34887    
      )}")   
  
  
      println(s"TEST-4...${driver(
        List(-92, -90, -70, -70, -10, 2, 10, 12, 14, 40, 44, 46, 64, 68, 68, 96), 11, 
        586    
      )}")   
  
  
      println(s"TEST-5...${driver(
        List(1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1), 15, 
        58    
      )}")   
  
  
      println(s"TEST-6...${driver(
        List(9, 15, 15, 17, 19, 20, 21, 23, 25, 25, 25, 32, 32, 33, 45, 51, 54, 59, 68, 71, 71, 71, 72, 75, 78, 80, 82, 82, 88, 89, 92, 93, 94, 97), 22, 
        11145    
      )}")   
  
  
      println(s"TEST-7...${driver(
        List(52, -78, -80, 32, -56, -98, -36, 86, 34, -36, 42, 46, 50, 0, 34, -46, -2, -18, -96, 12, -42, 62, 32, 78, 66, -8, 50, 60, 10, -18, 66, 80, -24, -98, 8, 48, 34, 44, -80, -34, 72, 0, -60, 52, 40, 20), 45, 
        14776    
      )}")   
  
  
      println(s"TEST-8...${driver(
        List(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1), 33, 
        297    
      )}")   
  
  
      println(s"TEST-9...${driver(
        List(45, 35, 25, 7, 24, 73, 25, 86, 48, 70, 47, 91, 96, 15, 39, 9), 8, 
        1359    
      )}")   
  
  }
  
source_py: def maximum_sum_iarri_among_rotations_given_array_1(arr, n):
      cum_sum = 0
      for i in range(0, n):
          cum_sum += arr[i]
      curr_val = 0
      for i in range(0, n):
          curr_val += (i * arr[i])
      res = curr_val
      for i in range(1, n):
          next_val = ((curr_val - (cum_sum - arr[(i - 1)])) + (arr[(i - 1)] * (n - 1)))
          curr_val = next_val
          res = max(res, next_val)
      return res
source_cpp: int maximum_sum_iarri_among_rotations_given_array_1(vector<int> arr, int n) {
    int cum_sum = 0;
    for ( int i = 0;
    i < n;
    i ++ ) cum_sum += arr [ i ];
    int curr_val = 0;
    for ( int i = 0;
    i < n;
    i ++ ) curr_val += i * arr [ i ];
    int res = curr_val;
    for ( int i = 1;
    i < n;
    i ++ ) {
      int next_val = curr_val - ( cum_sum - arr [ i - 1 ] ) + arr [ i - 1 ] * ( n - 1 );
      curr_val = next_val;
      res = max ( res, next_val );
    }
    return res;
  }