We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 10 Days of Statistics
  4. Day 0: Mean, Median, and Mode
  5. Discussions

Day 0: Mean, Median, and Mode

Sort by

recency

|

874 Discussions

|

  • jessbedolla3
     + 0 comments

    python

    import numpy as np

    from collections import Counter

    array_size = int(input())

    array_numbers = list(map(int, input().split()))

    mean = np.mean(array_numbers)

    median = np.median(array_numbers)

    counts= Counter(array_numbers)

    max_count= max(counts.values())

    modes= [number for number, count in counts.items() if count == max_count]

    mode = min(modes)

    print(mean) print(median) print(mode)

  • illogicalsleepi1
     + 0 comments
    from collections import Counter

n=int(input())
arr=list(map(int,input().split()))

mean=sum(arr)/n

freq=Counter(arr)
sorted_dict = {
    k: v for k, v in sorted(freq.items(), key=lambda item: (-item[1], item[0]))
}
mode,*_=sorted_dict

arr=sorted(arr)
if n%2==0:
    median=(arr[n//2]+arr[(n//2)-1])/2
else:
    median=arr[(n//2)-1]

print(mean)
print(median)
print(mode)

    or

    import statistics
from collections import Counter
n = int(input())
arr = list(map(int, input().split()))
mean = statistics.mean(arr)
median = statistics.median(arr)
freq=Counter(arr)
mode = max(freq.items(), key=lambda item: (item[1], -item[0]))[0]

print(f"{mean:.1f}")
print(f"{median:.1f}")
print(mode)

  • ananthukrishna_3
     + 0 comments

    include

    include

    include

    include // For controlling the output format

    using namespace std;

    int main() { // Step 1: Read the number of elements (not actually used, we just need the list) int n; cin >> n;

    // Step 2: Read the list of numbers into a vector
vector<int> nums(n);
for (int i = 0; i < n; ++i) {
    cin >> nums[i];
}

// Step 3: Calculate the average
double sum = 0;
for (int num : nums) {
    sum += num;
}
double average = sum / n;

// Step 4: Find the minimum number
int min_val = *min_element(nums.begin(), nums.end());

// Step 5: Output the results
// Print the average rounded to 1 decimal place
cout << fixed << setprecision(1) << average << endl;

// Print the average rounded to the nearest whole number
cout << round(average) << endl;

// Print the smallest number
cout << min_val << endl;

return 0;

    }

  • jeremiahnji
     + 0 comments

    For anyone having trouble in Java: I have yet to optimize this but I was able to pass all test cases except the last one (TestCase 3): 

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        List<Float> arr = new ArrayList<>();
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()) {
            float f = sc.nextFloat();
            arr.add(f);
        }
        int size = arr.size()-1;
        arr.remove(0); // remove first element because it's just size of array
        float mean = 0;
        float median = 0;
        float mode = 0;
        
        // Sort array
        Collections.sort(arr);
        
        // Calculate mean
        for(int i = 0; i < arr.size(); i++) {
            mean += arr.get(i);
        }
        mean = (mean/arr.size());
        System.out.println(mean); // Print out mean
        
        // Calculate median 
        if(arr.size() % 2 == 0) {
            float num1 = arr.get((int)(arr.size()/2));
            float num2 = arr.get((int)(arr.size()/2)-1);
            median = ((num1+num2)/2);
        } else {
            median = arr.get(((int)arr.size()/2)+1);
        }
        System.out.println(median); // Print out median
        
        // Calculate mode
        Map<Float,Integer> modeMap = new TreeMap<>();
        
        for(float f: arr) {
            if(modeMap.containsKey(f)) {
                int count = modeMap.get(f);
                modeMap.replace(f,count++);
            } else {
                modeMap.put(f,0);
            }
        }
        
        int count = 1; // counter to exit loop
        for(Map.Entry<Float,Integer> entry1 : modeMap.entrySet()) {
            while(count < arr.size()){
                for(Map.Entry<Float,Integer> entry2 : modeMap.entrySet()) {
                    if(entry1.getValue() >= entry2.getValue() && entry1.getKey() < entry2.getKey()) {
                        mode = entry1.getKey();
                        break;
                    }
                    else if(entry1.getKey() == entry2.getKey()) {
                        mode = entry1.getKey();
                    }
                    count++;
                }
            }
        }
    
        System.out.println(mode); // Print out mode
        
    }

  • vedantwalia
     + 0 comments

    Enter your code here. Read input from STDIN. Print output to STDOUT

    ''' from statistics import mean, median, mode

    n = input() x = sorted(list(map(int, input().split(" "))))

    print(mean(x)) print(median(x)) print(mode(x)) ''' from collections import Counter

    n = input() x = sorted(list(map(int, input().split(" "))))

    def mean(i): output = sum(i)/len(i) return output

    def median(i): i.sort() mid = len(i) // 2

    if len(i) % 2 == 0:
    med = (i[mid] + i[mid - 1]) / 2
else:
    med = i[mid]
return med

    def mode(i): count = Counter(i) max_count = max(count.values()) modes = [key for key, count in count.items() if count == max_count] return min(modes) if len(modes) > 1 else modes[0]

    print(mean(x)) print(median(x)) print(mode(x))

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in