Google Kick Round-D Question (2020)

05 Dec, 2021
Isyana is given the number of visitors at her local theme park on N consecutive days. The number of visitors on the i-th day is VI. A day is record-breaking if it satisfies both of the following conditions:
The number of visitors on the day is strictly larger than the number of visitors on each of the previous days.Either it is the last day, or the number of visitors on the day is strictly larger than the number of visitors on the following day.
The number of visitors on the day is strictly larger than the number of visitors on each of the previous days.
Either it is the last day, or the number of visitors on the day is strictly larger than the number of visitors on the following day.
Note that the very first day could be a record-breaking day. Please help Isyana find out the number of record-breaking days.
Input: The first line of the input gives the number of test cases, T. T test cases follow. Each test case begins with a line containing the integer N. The second line contains N integers. The i-th integer is Vi.
Output: For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the number of record-breaking days.
Limits
Time limit: 20 seconds per test set.
Memory limit: 1GB.
1 ≤ T ≤ 100.
0 ≤ Vi ≤ 2 × 105.
Test set 1
1 ≤ N ≤ 1000.
Test set 2
1 ≤ N ≤ 2 × 105 for at most 10 test cases.
For the remaining cases, 1 ≤ N ≤ 1000.
Sample
Input
Output
4
8
1 2 0 7 2 0 2 0
6
4 8 15 16 23 42
9
3 1 4 1 5 9 2 6 5
6
9 9 9 9 9 9
Case #1: 2
Case #2: 1
Case #3: 3
Case #4: 0
In Sample Case #1: The bold and underlined numbers in the following represent the record-breaking days: 1 2 0 7 2 0 2 0.
In Sample Case #2: only the last day is a record-breaking day.
In Sample Case #3: The first, the third, and the sixth days are record-breaking days.
In Sample Case #4: there is no record-breaking day.
C++
C#
Javascript
#include<iostream>using namespace std; int main(){    int n;    cin>>n;    int a[n];    for(int i=0;i<n;i++)    {        cin>>a[i];    }    int count=0;    for(int i=1;i<n;i++)    {       if(a[i]>a[i-1]&&a[i]>a[i+1])       {            count++;       }    }    cout<<count<<endl;    return 0;}
// C# program for the above approachusing System; public class GFG{         static int calculate(int[] arr, int n)    {        int cnt = 0;               // initialising prevmax as -infinity        int prevmax = Int32.MinValue;             for (int i = 0; i < n; i++)        {                       // check for condition 2            if (i == n - 1) {                if (arr[i] > prevmax)                    cnt++;            }                       // check for condition 1            else if (arr[i] > prevmax && arr[i] > arr[i + 1]) {                cnt++;            }            // update prevmax            prevmax = Math.Max(prevmax, arr[i]);        }             return cnt;    }     // Driver Code    static public void Main ()    {        int t = 1;               // Taking the input for every test case        while (t-- != 0)        {            int n = 9;            int[] arr = { 3, 1, 4, 1, 5, 9, 2, 6, 5 };            Console.Write(calculate(arr, n));        }    }} // This code is contributed by shubhamsingh10
<script> // Javascript program for the above approachfunction calculate(arr, n){    var cnt = 0;         // Initialising prevmax as -infinity    var prevmax = Number.MIN_VALUE;     for(var i = 0; i < n; i++)    {                 // Check for condition 2        if (i == n - 1)        {            if (arr[i] > prevmax)                cnt++;        }                 // Check for condition 1        else if (arr[i] > prevmax &&                 arr[i] > arr[i + 1])        {            cnt++;        }                 // Update prevmax        prevmax = Math.max(prevmax, arr[i]);    }    return cnt;} // Driver Codevar t = 1; // Taking the input for every test casewhile (t-- != 0){    var n = 9;    var arr = [ 3, 1, 4, 1, 5, 9, 2, 6, 5 ];         document.write(calculate(arr, n));} // This code is contributed by shivanisinghss2110 </script>
3
Google
Interview Experiences
Google
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.