text: Returns sum of maximum sum subarray created after concatenating a [ 0. . n - 1 ] k times .
code: int maxSubArraySumRepeated ( int a [ ] , int n , int k ) { int max_so_far = INT_MIN , max_ending_here = 0 ; for ( int i = 0 ; i < n * k ; i ++ ) {