Design a Food Rating System | Clean Approach | Leetcode-2353

[@UECAshutoshKumar]

Thank you!!!

[@ravirajshelar250]

The idea of taking negative instead of custom comparator🔥🥶

[@codestorywithMIK]

🙏❤️

[@AvinashKumar-ps4tw]

Very well Explained, bahut mehnnat kiye hai aapne to explain us in a structured way. now it duty to practice more Questions based on such patterns.

[@codestorywithMIK]

❤️🙏🙏

[@sabbulingineni]

U r one of the best in the world of c++🤩🤩🤩

[@wearevacationuncoverers]

💯

[@thekindspill]

Hi MIK, i really wish I could do or give something to thank you. Even if you create a Paid course, I would be happy to opt for it. This level of in-depth explanation is not even provided in paid courses. You are a gem and a blessing to all of us.

[@DurgaShiva7574]

Improvisation using negative of rating deserve a separate applause 🎉

[@anushkathakur6531]

shaana tareeka was awesome😂❤

[@Brute_Coder]

in a mixed feeling tried hard this question ... but when i saw your approach ... i was like how can i think at your veteran level ... ....BTW nice explanation ..AYKI doing great ...

[@codestorywithMIK]

🙏🙏❤️❤️

[@molyoxide8358]

The Corner Case was Mind_Blowing

[@wearevacationuncoverers]

How can someone be this good in explanation. It seems that you are the creator of every Qn on leetcode 😅. hats off legend.

[@aelishkumar1852]

thank you so much dude for very beautiful explaination as it is little bit complex

[@codestorywithMIK]

Glad it helped! ❤️

[@adarshjha5126]

Sir please make videos on problem C and D of today's leetcode contest

[@codestorywithMIK]

Qn-4 kzbin.info/www/bejne/f5LdXmuQhr6IrNUsi=4qCFdzYompcrUyhy

[@souravjoshi2293]

8:53 - That's why you are the best

[@aws_handles]

Man, you are gifted with teaching skills.

[@ramakrishnakcr4417]

wow

[@gauravbanerjee2898]

Thanks a lot bhaiya ❤❤

[@sauravchandra10]

Kaafi acha question tha, and so wasthe explanation.

[@DevOpskagyaan]

Mast 👌🏻

[@tutuimam3381]

Thanks 👍

[@piyushraj5464]

Thanks a lot for such a simple and easy explanation. Waiting for the solutions of today's contest.

[@codestorywithMIK]

Qn-4 kzbin.info/www/bejne/f5LdXmuQhr6IrNUsi=4qCFdzYompcrUyhy

[@vineetkumar2899]

Companies Asked -> Amazon in last 1-2 years

[@alokgautam02]

Thnx for this detailed soln . 😍

[@souravjoshi2293]

Asked by amazon

[@anuppatankar4294]

As always great video 👌 Btw one question designing data structures and its functionalities is same as LLD which is asked in interview ?

[@codestorywithMIK]

Hi Anup, No there are many differences in LLD and These Problems. LLD involves not only data structure design, but also data base design, API design (as per requirement), OOP concepts related.

[@anuppatankar4294]

@@codestorywithMIK ok got that 👍🏻

[@RUSTYYYYYYYYY]

maza aa gya

[@manimanohar_001]

Other Channels: Intelligent Gyan, MIK's channel: Ultra_Intelligent_Gyan

[@codestorywithMIK]

🙏🙏❤️❤️

[@32_ec_divagupta22]

Thank u sir !! Sir can you explain today leetcode contest 3rd and 4th problem in a video

[@SadhanaSharma]

for the 3rd qsn you can take reference from this code : class Solution { public: bool pal(long long num){ long long x= num; long long rev=0; while(x>0){ long long ld= x%10; rev=rev*10+ld; x=x/10; } return rev==num; } long long minimumCost(vector& nums) { long long n= nums.size(); sort(nums.begin(),nums.end()); long long median = nums[n/2]; long long x= median;// to get the left recent palindrome long long y= median;// to get the right recent palindrome while(!pal(x)) x--; while(!pal(y)) y++; long long ans=0,p=0,q=0; for(int i=0;i

[@codestorywithMIK]

Qn-4 kzbin.info/www/bejne/f5LdXmuQhr6IrNUsi=4qCFdzYompcrUyhy

[@kamranwarsi12b22]

Can you tell that according to nowday's scenario should we do cp for oa's ?? Also it will be very helpful if you start a playlist regarding oa's question It's a request 🤗

[@codestorywithMIK]

I have seen a rise in difficulty in OAs these days. CP can definitely boost your preformance but it’s not a mandatory parameter. I have seen people who never did CP but cracked difficult OA problems. So at the end, it all boils down to having a good understanding of dsa and being able to solve under pressure of time contraint. That is why giving leetcode weekly/bi-weekly contests is a very good way to prepare for that. (NOTE - you can also give contests on other platforms as per your choice)

[@codestorywithMIK]

And regarding CP playlist, i am planning to start once all basics DSA Concepts playlist are covered. Probably next year, a lot of things are planned for this channel 🙏❤️😇

[@kamranwarsi12b22]

@@codestorywithMIK ok sir, will be eagrly waiting for that

[@codeandtalk6]

❤❤❤

[@aadil4236]

kya hum priority-queue me number se nahi aur number aur food ki pair se koi element insert ya remove kar sakte he? kyu ki agar hum changeragint vaale function me koi food ki rating change kar rahe he aur sirf uski rating se vo food remove aur insert karte he to aisa ho sakta he ke ek hi rating vaale 2 food maujud ho pq me aur hum galat waala update karde. mene pq padha he usme sirf number ke bases par hi insert aur remove karte he.

[@sanjaykatta6499]

Bro, Can you explain why your choice of datastructure was set instead of priority queue? Though priority queue has faster insertion and removal times compared to TreeSet, Leetcode gives me a better Runtime when I use TreeSet rather than Priority Queue. I didn't understand why. AFAIK, TreeSet is useful in the cases where we need to perform range queries, but here we are not doing any range queries.

[@Ramneet04]

You can just pop the top of priority queue, can't do it for specific food. You have to pop all elements occurs before it and then push back them ( in the case of change food rantings )..

[@sanjaykatta6499]

@@Ramneet04 In that case, we can still maitain a mapping between the food and the cuisine as done in this video and delete the old rating (food, old rating object) from the priority queue, Using pq.remove(food, old rating object)

[@KESHAVKUMAR-mb2nm]

Thank U great explanation.

[@codestorywithMIK]

Glad it was helpful! ❤️🙏

[@jagadeeshp1163]

how to write the python code for this 😢 i have never solved such problem

[@NiveditaJaiswal-s2d]

why not code in java

[@KESHAVKUMAR-mb2nm]

bro java code is provided in description box.

[@NiveditaJaiswal-s2d]

I know

[@varunaggarwal7126]

I was doing it the oops way but getting TLE public class Menu { public string food { get; set; } public string cuisine { get; set; } public int rating { get; set;} } public class FoodRatings { public List m = new List(); public FoodRatings(string[] foods, string[] cuisines, int[] ratings) { for (int i = 0; i < foods.Length; i++) { m.Add(new Menu { food = foods[i], cuisine = cuisines[i], rating = ratings[i] }); } } public void ChangeRating(string food, int newRating) { var menuToUpdate = m.FirstOrDefault(rr => rr.food == food); if (menuToUpdate != null) { menuToUpdate.rating = newRating; } } public string HighestRated(string cuisine) { var highestRatedFoods = m .Where(menu => menu.cuisine == cuisine) .GroupBy(menu => menu.rating) .OrderByDescending(group => group.Key) .FirstOrDefault(); if (highestRatedFoods != null) { var sortedFoods = highestRatedFoods .OrderBy(menu => menu.food) .Select(menu => menu.food) .ToList(); return sortedFoods.FirstOrDefault() ?? ""; } return ""; } }