New update is available. Click here to update.

Posted: 22 Oct, 2020

Difficulty: Easy

```
It can be shown that Mean and Median is in the form of P/Q, where P and Q are coprime integers and Q != 0. You need to return P and Q.
For Mode, if the highest frequency of more than one element is the same, return the smallest element.
For Example, for the given array {1, 1, 2, 2, 3, 3, 4}, the mode will be 1 as it is the smallest of all the possible modes i.e 1, 2 and 3.
```

```
The first line of input contains an integer T denoting the number of queries or test cases.
The first line of every test case contains an integer N denoting the size of the input array.
The second line of every test case contains N single space-separated integers representing the elements of the input array.
```

```
For each test case,
The first line of output will contain 2 single space-separated integers representing P, and Q for the Mean of the array.
The second line of output will contain 2 single space-separated integers representing P, and Q for the Median of the array.
The third line of the output will contain an integer representing the Mode of the array.
```

```
You do not need to print anything, it has already been taken care of. Just implement the given functions.
```

```
1 <= T <= 5
1 <= N <= 10^5
1 <= ARR[i] <= 10^6
Where 'ARR[i]' denotes the 'ith' element of the array.
Time limit: 1 sec
```

SIMILAR PROBLEMS

Longest Subarray With Zero Sum

Posted: 3 Nov, 2022

Difficulty: Moderate

Merge Two Sorted Arrays Without Extra Space

Posted: 19 Nov, 2022

Difficulty: Moderate

Ninja And The Strictly Increasing Array

Posted: 27 Nov, 2022

Difficulty: Moderate

Co-Prime

Posted: 14 Dec, 2022

Difficulty: Hard

Negative To The End

Posted: 16 Dec, 2022

Difficulty: Easy

Categories:

Popular Courses: