Sort Characters By Frequency | Sorting | Lambda | Leetcode 451

[@naturevinu7886]

aap jo story batate ho to lagta he bhai coding to me bhi kar sakta hu or bahot had tar to problme khud hi solve kar pata hu love you sir

[@aws_handles]

I get relaxed when I see you already have a video on youtube for a problem.

[@amanisdreaming3914]

lol same

[@aninima01]

same xD

[@AdityaSharma-sf1yh]

You are genius, you don't know but you have explained it perfectly and far better than other KZbin tutors. Thank you so much!

[@codestorywithMIK]

Means a lot to me. Thank you so much 🙏😇

[@FanIQQuiz]

💯

[@rachitaa._]

Solved this using priority queue somehow(like solving a puzzle) , but still couldn't get how it was working, came here to actually know . I knew I would be satisfied with only your explanation of the question.

[@hrithikrudra4292]

Amazing brother....Keep uploading such wow content..

[@codestorywithMIK]

Thanks a lot Hrithik ❤️❤️❤️

[@udaytewary3809]

Really thankyou bhaiya for making it so easy to understand and also learn new things about comparator from you

[@codestorywithMIK]

I am so glad to hear that Uday ❤️❤️❤️

[@priyamittal8302]

Finally understood this concept. thanks a lot!

[@Ankitkumar-fz3kc]

Thanks, I solved it by myself still came here to learn something new and learnt something thanks.

[@codestorywithMIK]

So glad to know ❤️❤️🙏🙏 Always note down the things which you are learning in a note book, or note it down somewhere so that you can revisit them later

[@Ankitkumar-fz3kc]

@@codestorywithMIK sir how to take notes and how to revise can you please share some insight regarding this.

[@FifthArima]

@@Ankitkumar-fz3kc had the same doubt. @codestorywithmik pls share your inputs

[@codestorywithMIK]

For taking notes, What I did was note the important points on a Notebook earlier. But I wanted to access it anywhere so I started to make notes online (google doc etc) so that I can access it online from anywhere. Make. Google doc dedicated to every topic and keep the notes in those. Keep revisiting them time to time

[@souravjoshi2293]

Thanks a lot man. simple and crystal clear

[@souradeepghosh9888]

Nice explanation bhaiya

[@wearevacationuncoverers]

Keep uploading such amazing contents.

[@saumyasrivastava5390]

Please upload the PQ solution as well. I implemented this but I am unable to think in that direction

[@souravjoshi2293]

Me too. It would be great to have a PQ solution as well for this from you @Interview_DS_Algo Thanks in advance

[@codestorywithMIK]

Sure. I am on it. Give me sometime. I will upload it today only. Thanks again for your question and watching my videos

[@codestorywithMIK]

Uploaded the Heap(PQ) approach Link :kzbin.info/www/bejne/fqimipRnlJepobc

[@aws_handles]

Thanks a lot@@codestorywithMIK

[@FanIQQuiz]

@@codestorywithMIK I was looking for this. Thank you

[@theOmKumar]

I solved it like this. string frequencySort(string s) { string ans; int freq[128] = {0}; for(int i = 0; i < s.size(); i++){ freq[s[i]]++; } map m; for(int i = 0; i < 128; i++){ m[ freq[i] ] += string(freq[i], (char)i); } for(auto it = m.rbegin(); it != m.rend(); it++){ ans += it->second; } return ans; }

[@divyanshualiwal]

Awsm explanation !

[@varunsheth1003]

Amazing brother...

[@codestorywithMIK]

Thanks a lot Varun ❤️❤️❤️

[@gauravbanerjee2898]

Thanks a lot bhaiya ❤❤

[@ShubhiSrivastava-dc6zk]

is code ki space complexity or time complexity explain kr dijiye plz plz

[@DevOpskagyaan]

Done ❤️

[@rajeevkumarsingh8719]

i m confused that how the pair get stored in vector can anyone help. line 9-11

[@codestorywithMIK]

Hi Rajeev, let's look at an example to understand this. Suppose we have example : "tree" Now let's populate : vector vec; i = 0, 't', we don't have 't' populated in vector as of now. vec = { {'t', 1}} i = 1, 'r', we don't have 'r' populated in vector as of now. vec = { {'t', 1}, {'r', 1}} i = 2, 'e', we don't have 'e' populated in vector as of now. vec = { {'t', 1}, {'r', 1}, {'e', 1}} Now, for i = 3, 'e', we already have {'e', 1} in our vector So, take out frequency of 'e' already present in vector : i.e. freq = 1 int freq = 1 Now, we add 1 more to it, because we have got another 'e' at index = 3 and then insert it back to vec (updated value) vec = { {'t', 1}, {'r', 1}, {'e', 2}} Hope I was able to clear now. Thank you for watching

[@rajeevkumarsingh8719]

Yeah very helpful

[@codestorywithMIK]

Glad to know that Rajeev. Thanks

[@factshubonly]

ordered map already sorted hota hai usse nhi kar sakte kya?

[@codingwithsukesh]

Github pe java code bhi upload kro sir

[@kumarashutosh-p3n]

unordered_mapm; for(auto x:s) m[x]++; sort(begin(s),end(s),[&](char a, char b){ return m[a]!=m[b]?m[a]>m[b]:a

[@VinayKumar-vm1hg]

vec[ch] or we have to take index

[@dayashankarlakhotia4943]

class Solution { public String frequencySort(String str){ char[]s=str.toCharArray(); int[]freq=new int[128]; for(int i=0;i

[@xboy2374]

bhaiua run time error aa rhaa 32 test case mai se 29 chle

[@codestorywithMIK]

My code seems to be working fine. Can you share your code ?

[@prathamdhiman7071]

Sir can you also code in java

[@tech_funda_official]

is solution me kya problem h? class Solution { public: string frequencySort(string s) { typedef pair P; vector arr(122); for (char& i : s) { int freq = arr[i].second; arr[i] = {i, freq + 1}; } auto lambda = [&](P &p1, P &p2) { return p1.second > p2.second; }; sort(arr.begin(), arr.end(), lambda); string ans = ""; for (int i = 0; i

[@harshkumar4047]

Mention in the video title only for C++ language, bcz Java valo ko toh kuch samjh hi nhi aya.

[@harshasshet6755]

bro concept to same hai just language is diferent learn concept and for code ask chatgpt and all fine

[@harshkumar4047]

@@harshasshet6755 Beta 9:00 minute se jo isne bataya hai voh code based hai (C++ language specific), isme conceptual kuch nhi hai. Real conceptual videos irrespective of lang. dekhne hai toh jaa kr Striver dekh munna.