title: Maximum Number Chocolates Distributed Equally Among K Students
signature: maximumNumberChocolatesDistributedEquallyAmongKStudents :: [Integer] -> Integer -> Integer -> Integer
  maximumNumberChocolatesDistributedEquallyAmongKStudents arr n k = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: [Integer] -> Integer -> Integer -> Integer -> String
  driver arr n k expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME arr n k) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver ([2, 3, 8, 8, 12, 14, 23, 25, 25, 27, 27, 29, 40, 42, 49, 52, 52, 54, 56, 57, 61, 68, 74, 77, 81, 82, 83, 84, 85, 85, 85, 87, 87, 88, 88, 90, 92, 96, 96]) (27) (32) (29) )
  
      printf "TEST-1...%s\n" (driver ([-90, -34, 26, -20, -12, -42, 28, 12, -6, 58, -46, 4, -30, -28, -14]) (8) (14) (0) )
  
      printf "TEST-2...%s\n" (driver ([0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]) (7) (9) (0) )
  
      printf "TEST-3...%s\n" (driver ([58, 81, 36, 2, 51, 71, 77, 34, 91, 82, 47, 4, 91, 83, 26, 96, 3, 6]) (16) (12) (48) )
  
      printf "TEST-4...%s\n" (driver ([-92, -86, -82, -68, -60, -46, -40, -28, -26, -24, -2, -2, 2, 2, 10, 10, 10, 16, 16, 18, 20, 20, 22, 30, 34, 38, 56, 56, 60, 62, 62, 68, 82, 94, 94, 98]) (20) (31) (2) )
  
      printf "TEST-5...%s\n" (driver ([0, 1, 0]) (2) (2) (0) )
  
      printf "TEST-6...%s\n" (driver ([3, 8, 15, 19, 21, 26, 28, 31, 31, 42, 45, 48, 57, 75, 75, 78, 79, 85, 91, 99]) (17) (16) (36) )
  
      printf "TEST-7...%s\n" (driver ([-38, 42, 40, -60, -16, -36, 44, 60, -86, -38, 30, -22, -30, -96, -66]) (12) (10) (6) )
  
      printf "TEST-8...%s\n" (driver ([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1]) (13) (16) (0) )
  
      printf "TEST-9...%s\n" (driver ([95, 38, 91, 75, 43, 95, 23, 36, 51, 4, 38, 53, 52, 58, 55, 3, 19, 22, 84, 9]) (14) (19) (31) )
  
source_py: def maximum_number_chocolates_distributed_equally_among_k_students(arr, n, k):
      (um, curr_rem, maxSum) = ({
          
      }, 0, 0)
      sm = ([0] * n)
      sm[0] = arr[0]
      for i in range(1, n):
          sm[i] = (sm[(i - 1)] + arr[i])
      for i in range(n):
          curr_rem = (sm[i] % k)
          if ((not curr_rem) and (maxSum < sm[i])):
              maxSum = sm[i]
          elif (not (curr_rem in um)):
              um[curr_rem] = i
          elif (maxSum < (sm[i] - sm[um[curr_rem]])):
              maxSum = (sm[i] - sm[um[curr_rem]])
      return (maxSum // k)
source_cpp: int maximum_number_chocolates_distributed_equally_among_k_students(vector<int> arr, int n, int k) {
    unordered_map < int, int > um;
    int sum [ n ], curr_rem;
    int maxSum = 0;
    sum [ 0 ] = arr [ 0 ];
    for ( int i = 1;
    i < n;
    i ++ ) sum [ i ] = sum [ i - 1 ] + arr [ i ];
    for ( int i = 0;
    i < n;
    i ++ ) {
      curr_rem = sum [ i ] % k;
      if ( curr_rem == 0 ) {
        if ( maxSum < sum [ i ] ) maxSum = sum [ i ];
      }
      else if ( um . find ( curr_rem ) == um . end ( ) ) um [ curr_rem ] = i;
      else if ( maxSum < ( sum [ i ] - sum [ um [ curr_rem ] ] ) ) maxSum = sum [ i ] - sum [ um [ curr_rem ] ];
    }
    return ( maxSum / k );
  }