Fixed coverage

Author: javadev

src/main/java/g3401_3500/s3428_maximum_and_minimum_sums_of_at_most_size_k_subsequences/Solution.java

@@ -47,9 +47,6 @@ private void buildFactorials(int n) {
     }
 
     private long comb(int n, int r) {
-        if (r < 0 || r > n) {
-            return 0;
-        }
         return fact[n] * invFact[r] % MOD * invFact[n - r] % MOD;
     }