comefrom: <gouthampradhan>dynamic_programming_ContinuousSubarraySum_1.java
code: public boolean checkSubarraySum(int[] nums, int k) {
      Map<Integer, Integer> map = new HashMap<>();
      int sum = 0;
      map.put(0, -1);
      for (int i = 0; i < nums.length; i++) {
        sum += nums[i];
        int mod = (k == 0) ? sum : sum % k; 
        if (map.containsKey(mod)) {
          if (i - map.get(mod) > 1) {
            return true;
          }
        } else {
          map.put(mod, i);
        }
      }
      return false;
    }
masked: public boolean var_0 ( int [ ] var_1 , int var_2 ) {
    Map < Integer , Integer > var_6 = new HashMap < > ( ) ;
    int var_8 = 0 ;
    var_6 . put ( 0 , - 1 ) ;
    for ( int var_11 = 0 ;
    var_11 < var_1 . length ;
    var_11 ++ ) {
      var_8 += var_1 [ var_11 ] ;
      int var_13 = ( var_2 == 0 ) ? var_8 : var_8 % var_2 ;
      if ( var_6 . containsKey ( var_13 ) ) {
        if ( var_11 - var_6 . get ( var_13 ) > 1 ) {
          return true ;
        }
      }
      else {
        var_6 . put ( var_13 , var_11 ) ;
      }
    }
    return false ;
  }
  