MCPcopy Create free account
hub / github.com/Tiwarishashwat/InterviewCodes / missingRolls

Method missingRolls

findMissingObservations.java:3–23  ·  view source on GitHub ↗
(int[] rolls, int mean, int n)

Source from the content-addressed store, hash-verified

1// Find Missing Observations
2class Solution {
3 public int[] missingRolls(int[] rolls, int mean, int n) {
4 int m = rolls.length;
5 int sum=mean * (n+m);
6 for(int i=0;i<m;i++){
7 sum-=rolls[i];
8 }
9 if(sum < n || sum>6*n){
10 return new int[0];
11 }
12 int avg = sum/n;
13 int rem = sum%n;
14 int res[] = new int[n];
15 for(int i=0;i<n;i++){
16 res[i] = avg;
17 if(rem>0){
18 res[i]++;
19 rem--;
20 }
21 }
22 return res;
23 }
24}

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected