title: Count Frequency K Matrix Size N Matrixi J Ij
signature: int countFrequencyKMatrixSizeNMatrixiJIj(int n, int k) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int k, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, k), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(90, 74, 73); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(86, 36, 35); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(92, 38, 37); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(72, 71, 70); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(25, 57, -6); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(11, 53, -30); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(94, 80, 79); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(91, 75, 74); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(66, 58, 57); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(34, 88, -19); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def count_frequency_k_matrix_size_n_matrixi_j_ij(n, k):
      if ((n + 1) >= k):
          return (k - 1)
      else:
          return (((2 * n) + 1) - k)
source_cpp: int count_frequency_k_matrix_size_n_matrixi_j_ij(int n, int k) {
    if ( n + 1 >= k ) return ( k - 1 );
    else return ( 2 * n + 1 - k );
  }