comefrom: <awangdev>523. Continuous Subarray Sum_1.java
code: public boolean checkSubarraySum(int[] nums, int k) {
          k = k == 0 ? Integer.MAX_VALUE : Math.abs(k); 
          if (nums.length / 2 > k) return true; 
          
          Set<Integer> set = new HashSet<>();
          int lastMod = 0;
          for (int num : nums) {
              int mod = (lastMod + num) % k;
              if (set.contains(mod)) return true;
              set.add(lastMod);
              lastMod = mod;
          }
  
          return false;
      }
masked: public boolean var_0 ( int [ ] var_1 , int var_2 ) {
    var_2 = var_2 == 0 ? Integer . MAX_VALUE : Math . abs ( var_2 ) ;
    if ( var_1 . length / 2 > var_2 ) return true ;
    Set < Integer > var_3 = new HashSet < > ( ) ;
    int var_4 = 0 ;
    for ( int var_5 : var_1 ) {
      int var_6 = ( var_4 + var_5 ) % var_2 ;
      if ( var_3 . contains ( var_6 ) ) return true ;
      var_3 . add ( var_4 ) ;
      var_4 = var_6 ;
    }
    return false ;
  }
  