Hello coders, today we are going to solve **Breaking The Records HackerRank Solution** which is a Part of **HackerRank Algorithm** Series.

**Task**

Maria plays college basketball and wants to go pro. Each season she maintains a record of her play. She tabulates the number of times she breaks her season record for *most points* and *least points* in a game. Points scored in the first game establish her record for the season, and she begins counting from there.

**Example**

*scores* = [12, 24, 10, 24]

Scores are in the same order as the games played. She tabulates her results as follows:

```
Count
Game Score Minimum Maximum Min Max
0 12 12 12 0 0
1 24 12 24 0 1
2 10 10 24 1 1
3 24 10 24 1 1
```

Given the scores for a season, determine the number of times Maria breaks her records for *most* and *least* points scored during the season.

**Function Description**

Complete the *breakingRecords* function in the editor below.

breakingRecords has the following parameter(s):

*int scores[n]:*points scored per game

**Returns**

*int[2]:*An array with the numbers of times she broke her records. Index**0**is for breaking*most points*records, and index**1**is for breaking*least points*records.

**Input Format**

The first line contains an integer ** n**, the number of games.

The second line contains

**space-separated integers describing the respective values of**

*n***,**

*score*_{0}**, . . . ,**

*score*_{1}**.**

*score*_{n – 1}**Constraints**

**1 <=***n*<= 1000**0 <=***scores*[*i*] <= 10^{8}

**Sample Input 0**

```
9
10 5 20 20 4 5 2 25 1
```

**Sample Output 0**

`2 4`

**Explanation 0**

The diagram below depicts the number of times Maria broke her best and worst records throughout the season:

She broke her best record twice (after games **2** and **7**) and her worst record four times (after games **1**, **4**, **6**, and **8**), so we print `2 4`

as our answer. Note that she *did not* break her record for best score during game **3**, as her score during that game was *not* strictly greater than her best record at the time.

**Sample Input 1**

```
10
3 4 21 36 10 28 35 5 24 42
```

**Sample Output 1**

`4 0`

**Explanation 1**

The diagram below depicts the number of times Maria broke her best and worst records throughout the season:

She broke her best record four times (after games **1**, **2**, **3**, and **9**) and her worst record zero times (no score during the season was lower than the one she earned during her first game), so we print `4 0`

as our answer.

**Solution – Breaking The Records**

**C++**

#include<bits/stdc++.h> using namespace std; #define ll long long #define lim 10000007 #define pb push_back #define S second #define pb push_back #define mp make_pair #define INF 1e18 #define fr(i,j,k) for(ll i=j;i<=k;i++) #define frd(i,j,k) for(ll i=j;i>=k;i--) #define F first #define sd(n) scanf("%lld",&n) #define pd(n) printf("%lld\n",n) #define db double #define mod 1000000007 #define pii pair<ll,ll> int main() { ll n; cin>>n; ll mx; cin>>mx; ll mn=mx; ll a1=0,a2=0; n--; ll x; while(n--) { cin>>x; if(x>mx) a1++; if(x<mn) a2++; mx=max(mx,x); mn=min(mn,x); } cout<<a1<<" "<<a2<<endl; }

**Python**

input() a = list(map(int, input().split())) m = M = a[0] x = y = 0 for i in a[1:]: if i > M: M = i x += 1 elif i < m: m = i y += 1 print(x, y)

**Java**

import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] score = new int[n]; for(int score_i=0; score_i < n; score_i++){ score[score_i] = in.nextInt(); } // your code goes here int most = score[0]; int least = score[0]; int mr = 0; int lr = 0; for( int i = 1; i < n; i++ ){ if( score[i] > most ){ mr++; most = score[i]; } if( score[i] < least ){ lr++; least = score[i]; } } System.out.print(mr + " " + lr); } }

**Disclaimer:** The above Problem **(Breaking The Records)** is generated by **Hacker Rank** but the Solution is Provided by **CodingBroz**. This tutorial is only for** Educational** and **Learning** Purpose.