migratory birds in c++ hackerrank solution

You have been asked to help study the population of birds migrating across the continent. Each type of bird you are interested in will be identified by an integer value. Each time a particular kind of bird is spotted, its id number will be added to your array of sightings. You would like to be able to find out which type of bird is most common given a list of sightings. Your task is to print the type number of that bird and if two or more types of birds are equally common, choose the type with the smallest ID number.

For example, assume your bird sightings are of types . There are two each of types  and , and one sighting of type . Pick the lower of the two types seen twice: type .

Function Description

Complete the migratoryBirds function in the editor below. It should return the lowest type number of the most frequently sighted bird.

migratoryBirds has the following parameter(s):

  • arr: an array of integers representing types of birds sighted

Input Format

The first line contains an integer denoting , the number of birds sighted and reported in the array . 
The second line describes  as  space-separated integers representing the type numbers of each bird sighted.

Constraints

  • It is guaranteed that each type is , , , , or .

Output Format

Print the type number of the most common bird; if two or more types of birds are equally common, choose the type with the smallest ID number.

Sample Input 0

6
1 4 4 4 5 3

Sample Output 0

4

Explanation 0

The different types of birds occur in the following frequencies:

  • Type :  bird
  • Type :  birds
  • Type :  bird
  • Type :  birds
  • Type :  bird

The type number that occurs at the highest frequency is type , so we print  as our answer.

Sample Input 1

11
1 2 3 4 5 4 3 2 1 3 4

Sample Output 1

3

Explanation 1

The different types of birds occur in the following frequencies:

  • Type : 
  • Type : 
  • Type : 
  • Type : 
  • Type : 

Two types have a frequency of , and the lower of those is type .

#include<bits/stdc++.h>
using namespace std;
int main()
{
 int i,j,n;
    cin>>n;
    int b[6];
   int a[n],s=0,c=0,p;
    for(i=0;i<n;i++)
    cin>>a[i];
    for(j=1;j<6;j++)
    {
        c=0;
        for(i=0;i<n;i++)
        {
            if(a[i]==j)
               c=c+1;
               b[j]=c;
        }
        
    }
    s=b[1];
    for(j=1;j<6;j++)
    {
        if(b[j]>s){
        s=b[j];
        p=j;
        }
    }
    cout<<p;
    return 0;
}

Comments

Post a Comment

If you have any doubt you ask me in comment section

Popular posts from this blog

Create account in java |deposit money|withdraw money

Image
 class bank{ int ac_no; String name, type; float amount; void details (int n, String nm, String t, float a)  { ac_no=n; name=nm; type=t; amount=a; } void show()  { System. out. println(ac_no+" "+name+" "+type+" "+amount) ; } void deposit (float a)  {amount =amount+a; System.out.println(" Deposit amount:"+a) ; } void withdraw (float a)  { if(amount<a)  System.out.println("Balance is insufficient "); else{ amount=amount-a; System.out.println("Withdraw amount:"+a) ; } } void checkbalance()  { System.out.println("Balance is:"+amount); } } class test{ public static void main(String args[])  { bank b=new bank() ; b. details (123456, "Ankit", " Saving ", 1000) ; b. show() ; b. deposit (40000) ; b. checkbalance () ; b. withdraw (10000) ;  b. checkbalance () ; } } Output- 123456 Ankit Saving 1000.0 Deposit amount: 40000.0  Balance is :41000.0 Withdraw amount: 10000 Balance is: 31000
Read more

Library Management System in python OOPs Concept

Image
 class Library:     def__init__(self,listofbooks,libraryname):         self.lst = listofbooks         self.name = libraryname     def displaybook(self):         return f"\t\t\t\tWelcome to {self.name} \         \navaliable books are -\n {self.lst}"     def lendbook(self,lendname,bookname):         if bookname in lst and bookname not in d:             print(f"{bookname} lend to {lendname}")             d.__setitem__(bookname,lendname)         elif bookname in d:             lst.remove(bookname)             print("Book is not available lend to-",d[bookname],"\nwe only have-",lst)         else:             print("Book is not in the library we only have-",lst)     def addbook(self,bookname):         print("Book added successfully in the library")         lst.append(bookname)     def returnbook(self,returenername,bookname):         if returenername in d[bookname]:             print("Book successfully returned")          
Read more

List comprehension hackerrank solution in python

Image
  Let's learn about list comprehensions! You are given three integers     and     representing the dimensions of a cuboid along with an integer   . Print a list of all possible coordinates given by     on a 3D grid where the sum of     is not equal to   . Here,   . Please use list comprehensions rather than multiple loops, as a learning exercise. Example All permutations of   are: . Print an array of the elements that do not sum to  . Input Format Four integers   and  , each on a separate line. Constraints Print the list in lexicographic increasing order. Sample Input 0 1 1 1 2 Sample Output 0 [[0, 0, 0], [0, 0, 1], [0, 1, 0], [1, 0, 0], [1, 1, 1]] Explanation 0 Each variable   and   will have values of   or  . All permutations of lists in the form  . Remove all arrays that sum to   to leave only the valid permutations. Sample Input 1 2 2 2 2 Sample Output 1 [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 2], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 2], [1, 1, 1], [1, 1, 2], [1, 2
Read more