3111. Minimum Rectangles to Cover Points | Sorting & Greedy

[@ARYANMITTAL]

Make sure to join Discord for active Discussions during & post contest - discord.gg/5y4XTfeb

[@crazymemes4080]

class Solution { public: int minRectanglesToCoverPoints(vector& points, int w) { int n = points.size(); sort(points.begin() , points.end()); int ans = 1; int j = 0; int i = 0; while(i

[@242deepak]

the idea is simple but little tricky to code

[@abhinay.k]

Good morning? 🙂

[@ARYANMITTAL]

US time zone me kaam kar raha ho naa😜

[@DineshKumar-pm6iu]

Make LLD Videos