# Java Challenge - Calculate the Mean and Mode

This community-built FAQ covers the “Calculate the Mean and Mode” code challenge in Java. You can find that challenge here, or pick any challenge you like from our list.

## Top Discussions on the Java challenge Calculate the Mean and Mode

There are currently no frequently asked questions or top answers associated with this challenge – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this challenge. Ask a question or post a solution by clicking reply () below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this challenge, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

## Join the Discussion. Help a fellow learner on their journey.

You can also find further discussion and get answers to your questions over in #get-help.

Agree with a comment or answer? Like () to up-vote the contribution!

Need broader help or resources? Head to #get-help and #community:tips-and-resources. If you are wanting feedback or inspiration for a project, check out #project.

Looking for motivation to keep learning? Join our wider discussions in #community

Found a bug? Report it online, or post in #community:Codecademy-Bug-Reporting

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

I calculated the frequency of each number in the array, and I used a loop in a loop to do that.
So this is O(n^2)
I stored all the frequencies in another array, which probably was not necessary.

public class StatsFinder {
public static void main(String[] args) {
int[] testArray = new int[]{500, 400, 400, 375, 300, 350, 325, 300};
double[] ans = statsFinder(testArray);
System.out.print("[");
System.out.print(ans[0]);
System.out.print(", ");
System.out.print(ans[1]);
System.out.println("]");
}

public static double[] statsFinder(int[] array) {
int length = array.length;
if (length < 1) {
return new double[]{0.0, 0.0};
}
int sum = 0;
int[] frequency = new int[length];
int maxFrequency = 0;
int valueWithMaxFrequency = array[0];
for (int i = 0; i < length; i++) {
sum += array[i];
frequency[i] = 0;
for (int j = 0; j < length; j++) {
if (array[j] == array[i]) {
frequency[i] ++;
}
}
if (frequency[i] > maxFrequency) {
valueWithMaxFrequency = array[i];
maxFrequency = frequency[i];
}
}
double mean = (double)sum / length;
return new double[]{mean, valueWithMaxFrequency};
}
}

No curly braces:

public static double[] statsFinder(int[] array) {

double mean = 0;
double mode = 0;
double[] returnValue = new double[2];
int[] occ = new int[array.length];
int max = 0;

/*mean*/
for(int e:array)
mean+=e;
mean/=array.length;

/*mode*/
/*calculate occurrences*/
for(int i = 0; i < array.length; ++i)
for(int j = 0; j < i; ++j)
if(array[i] == array[j])
if(++occ[j]>max)
++max;

/*filter the most occurring*/
for(int i : occ)
if(i==max)
if((mode=array[i])>0)
break;

/*finish*/
returnValue[0] = mean;
returnValue[1] = mode;
return returnValue;
}