All challenges
Easy 0 solved 0% acceptance

Simple Statistics

Return the minimum, maximum and average of a list of whole numbers.

What you'll learn

  • Track the smallest and largest value in one pass
  • Compute an average without integer division
  • Handle an empty list

Problem

After a fundraiser, the club treasurer has the amount each member collected and wants three quick numbers: the smallest amount, the largest amount and the average.

Implement simple_statistics(numbers).

Input

numbers: The amounts collected.

Output

Return [minimum, maximum, average] as numbers. The average is the sum divided by the count, not rounded (checked to within 0.000001). For an empty list return an empty list.

Constraints

0 ≤ length of numbers ≤ 1000

−1,000,000 ≤ each number ≤ 1,000,000

Examples

Example 1
Input:
numbers = [40, 15, 70, 35]

Expected output:
expected = [15.0, 70.0, 40.0]
Input:
std::vector<long long> numbers = {40, 15, 70, 35};

Expected output:
std::vector<double> expected = {15.0, 70.0, 40.0};
Input:
long[] numbers = new long[] {40, 15, 70, 35};

Expected output:
double[] expected = new double[] {15.0, 70.0, 40.0};

Explanation

The smallest is 15, the largest is 70, and the average is 160 / 4 = 40, so [15.0, 70.0, 40.0].

Example 2
Input:
numbers = [5, 6]

Expected output:
expected = [5.0, 6.0, 5.5]
Input:
std::vector<long long> numbers = {5, 6};

Expected output:
std::vector<double> expected = {5.0, 6.0, 5.5};
Input:
long[] numbers = new long[] {5, 6};

Expected output:
double[] expected = new double[] {5.0, 6.0, 5.5};

Explanation

The average of 5 and 6 is 5.5, so [5.0, 6.0, 5.5].

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Start the minimum and maximum at the first value, not at 0.

Hint 2

Keep a running sum as you go.

Hint 3

Convert to a decimal type before dividing the sum by the count.

Expected complexity

O(n) time, O(1) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.