Sort by

recency

|

3650 Discussions

|

  • + 0 comments

    Python 3 Solution

    def migratoryBirds(arr):
        freq = [0 for _ in range(6)]
        
        for i in range(len(arr)):
            freq[arr[i]] += 1
            
        max_freq = 0
        max_freq_id = None
        for x in range(len(freq)):
            if freq[x] > max_freq:
                max_freq = freq[x]
                max_freq_id = x
                
        return max_freq_id
    
  • + 0 comments

    C++

    int migratoryBirds(vector<int> arr) {
        vector<int>countBirds(5, 0);
        for (int bird : arr) {
            
            countBirds[bird-1]++;
    
        }
       return distance( countBirds.begin(), max_element(countBirds.begin(), countBirds.end()))+1;    
    }
    
  • + 0 comments

    Python3 Solution

    def migratoryBirds(arr):
        numberOfBirdTypes = {1:0, 2:0, 3:0, 4:0, 5:0}
        
        for birdType in arr:
            numberOfBirdTypes[birdType] += 1
        
        highestNumberBirdType = 0
        highestNumber = -1
        
        for birdType, num in numberOfBirdTypes.items():
            if num > highestNumber:
                highestNumberBirdType = birdType
                highestNumber = num
        
        return highestNumberBirdType
    
  • + 0 comments
    from collections import Counter
    
    def migratoryBirds(arr):
        return Counter(sorted(arr)).most_common(1)[0][0]
    
  • + 0 comments
    import java.io.*;
    import java.math.*;
    import java.security.*;
    import java.text.*;
    import java.util.*;
    import java.util.concurrent.*;
    import java.util.function.*;
    import java.util.regex.*;
    import java.util.stream.*;
    import static java.util.stream.Collectors.joining;
    import static java.util.stream.Collectors.toList;
    
    
    
    public class Solution {
        public static void main(String[] args){
            Scanner sc=new Scanner(System.in);
            int n=sc.nextInt();
            int[] a=new int[n];
            for(int i=0;i<n;i++){
                a[i]=sc.nextInt();
            }
            int t1=0,t2=0,t3=0,t4=0,t5=0;
            for(int i=0;i<n;i++){
                if(a[i]==1){
                    t1++;
                }
                else if(a[i]==2){
                    t2++;
                }
                else if(a[i]==3){
                    t3++;
                }
                else if(a[i]==4){
                    t4++;
                }
                else if(a[i]==5){
                    t5++;
                }
            }
            if(t1>=t2 && t1>=t3 && t1>=t4 && t1>=t5){
                System.out.println("1");
            }
            else if(t2>t1 && t2>=t3 && t2>=t4 && t2>=t5){
                System.out.println("2");
            }
            else if(t3>t1 && t3>t2 && t3>=t4 && t3>=t5){
                System.out.println("3");
            }
            else if(t4>t1 && t4>t2 && t4>t3 && t4>=t5){
                System.out.println("4");
            }
            else{
                System.out.println("5");
            }
        }
    }