Most Frequent Number Following Key In an Array : T.C ->O(n) S.C.->O(n)
Anonymous User
72
InterviewHash Table

int mostFrequent(vector& nums, int key) {
unordered_map<int,int> m;
for(int i=1;i<nums.size();i++){
if(nums[i-1]==key)
m[nums[i]]++;
}

    int x,y=INT_MIN;
    for(auto i:m){
        y=max(y,i.second);
        if(y==i.second)
            x=i.first;
    }
    return x;
}
Comments (0)