title: Find Sum Modulo K First N Natural Number
signature: def findSumModuloKFirstNNaturalNumber(n: Int, k: 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(n: Int, k: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, k),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        11, 5, 
        21    
      )}")   
  
  
      println(s"TEST-1...${driver(
        36, 69, 
        666    
      )}")   
  
  
      println(s"TEST-2...${driver(
        71, 28, 
        876    
      )}")   
  
  
      println(s"TEST-3...${driver(
        74, 1, 
        0    
      )}")   
  
  
      println(s"TEST-4...${driver(
        66, 84, 
        2211    
      )}")   
  
  
      println(s"TEST-5...${driver(
        38, 14, 
        237    
      )}")   
  
  
      println(s"TEST-6...${driver(
        2, 11, 
        3    
      )}")   
  
  
      println(s"TEST-7...${driver(
        73, 87, 
        2701    
      )}")   
  
  
      println(s"TEST-8...${driver(
        79, 11, 
        388    
      )}")   
  
  
      println(s"TEST-9...${driver(
        30, 55, 
        465    
      )}")   
  
  }
  
source_py: def find_sum_modulo_k_first_n_natural_number(N, K):
      ans = 0
      for i in range(1, (N + 1)):
          ans += (i % K)
      return ans
source_cpp: int find_sum_modulo_k_first_n_natural_number(int N, int K) {
    int ans = 0;
    for ( int i = 1;
    i <= N;
    i ++ ) ans += ( i % K );
    return ans;
  }