Hashing - TOP K MOST FREQUENT ELEMENTS | C++ Placement Course | Lecture 32.7

[vineetmidha]

This is search of first K distinct elements in the array and NOT Top K frequent elements.

[abhaykaushik]

honestly speaking bhaiya, ap accha explain nhi krte.

[gauravupreti]

Actual code of "Top K frequent elements in array"

bool compare(pair<int, int> &p1, pair<int, int> &p2)
{
if (p1.second == p2.second)
{
return (p1.first > p2.first);
}
return (p1.second > p2.second);
}
class Solution
{
public:
vector<int> topK(vector<int>& arr, int k) {
// Code here
vector<int> ans;
int n = arr.size();
if (k > n)
return ans;
unordered_map <int, int> m;
int s;
for (int i = 0; i < n; i++)
{
m[arr[i]]++;
}
arr.clear();
s = m.size();
if (k > s)
return ans;
vector<pair<int, int>> v;
unordered_map <int, int> :: iterator it;
for (it = m.begin(); it != m.end(); it++)
{
v.push_back(*it);
}
m.clear();
sort(v.begin(), v.end(), compare);
for (int i = 0; i < k; i++)
{
ans.push_back(v[i].first);
}
return ans;

}
};

[munmunsahu]

Aman bhaiya please launch apptitude series for placement.... So that we can solve one question in one minute....

[atin_jagotra]

thankyou for all the videos!! jitna bhi appreciate kre ...kum he hai

[sanidhyasharma]

Me waiting for that divine personality to come and bless my parents 😌

[gautam_editsz]

कोरोना के कारण जितने लोगो की मौत हुई है
भगवान से विनती करूँगा कि उनकी आत्मा को शांति मिले जय हिन्द
stay home Stay safe

[riyabharti]

Description me video link dal dia kijie.

[thatnaman]

Yaar question top k most frequent elements ka log first k elements ka karwaa rhe... question to dekh liya Karo code karne se pehle....quantity k chakkar mein ab quality ki maa behen ek kar rhe ho

[ritik]

Please upload all videos at a single time you can upload all .

[sahilsaini]

Aman Bhaiya, waiting for more videos on the web development course?

[shreyankshrestha]

unordered_map<int, int>mp;
priority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>MIN;
vector<int>v={1, 1, 1, 3, 2, 2, 4, 4, 4};
int i, n=v.size();
for(i=0;i<n;i++)
{
mp[v[i]]++;
}
for(auto i=mp.begin();i!=mp.end();i++)
{
MIN.push({i->second, i->first});
if(MIN.size()>2)
MIN.pop();
}
while(MIN.size()>0)
{
cout<<MIN.top().second;
MIN.pop();
}



simple sa code tha bc pata nahi kya khani likh diya .

[mohitjoc]

Continue this series add more advance Concepts

[Apna_dhamaka_]

hashing to tabhi he khelata he jab hum unordered_map use kare....

[shreyashbhandari]

Sir pls upload video on web development too.. I really wanna study futher in that course

[siddharthsinghh]

Web development ka video upload kaeiye bhaiya

[RohanSharma-jhny]

Bhai please help mujse VS code mie apne files delete ho gayi. Ab unhe restore kaise karu🙏🙏🙏🙏🙇🙇

[ankitmahapatra]

very poor explaination continued in hashing after heap

[Hidden..]

Bhiyaa java ka placement courses half m q leave....kiye

[anirudhrajebhosle]

Fact: If you can understand the worst explication (as verbally expressed by the viewers) the you can learn anything expeditious(in time) as compared to others.