The Skyline Problem || Leetcode

[@meme_engineering4521]

subhesh sir, please jitna ho sake aap videos bna diya karo, aap ek baar explain kar dete ho toh 2 min mein code ho jaata hai, your explanation literally has magic, liked from 2 accounts

[@nisargkapadia8548]

For C++ user :
If you are using priorityQueue in c++ stl u will not be able to solve this problem because there is no remove method in c++ stl priority quque so try to use multiset (not set because in edge test case some buildings start and point are same so make sure to use multiset) so for top element use *object_name.rbegin() and for remove element use find method to find element which u want to delete and after that use erase method thats it you solved problem.

[@shvmsh20]

Noted

[@siddharthsingh420]

CPP Code:
```
vector getSkyline(vector& buildings) {
vector res;
multiset pq{0};
vector points; // {start, -height} {end, height}
for(auto b : buildings) {
points.push_back({b[0],-b[2]});
points.push_back({b[1],b[2]});
}
sort(points.begin(),points.end());
int curHeight = 0;
for(int i=0;i

[@deepankerchaudhary7187]

You earned a subscriber because of this explanation

[@arpanbanejee5143]

Great explanation, covering all the edge cases! Thanks a lot!

[@Pepcoding]

Glad it was helpful! To watch more videos like this visit nados.pepcoding.com

[@piyushlohiya1977]

great explanation and that trick of using - for starting height

[@utsavgupta746]

Superb explanation 🙌🙌

[@pratyushprateek2934]

Amazing explanation ! Thank you !

[@vineetgarg9125]

This is awesome explanation. Keep it up.

[@RithikAgarwal-e9b]

Awsome!!!

[@naman1062]

If start point of two rectangles is common, then sorting height in ascending order will not work I guess. Please correct me if I am wrong.
For example: {2,-6}, {2,-8}, {4, 6}, {7, 8}.
Now as heights are in ascending order, skyline would be: [2,6], [2,8], [7,0], right? or am I missing something.

[@priyadharshanreddyseelam5476]

watch from 20:17

[@akashkumarsingh5355]

u will have negative heights for start so the one with larger numeric value ie 8 will actually become -8 and so -8 < -6 hence u will get 8 height first

[@namanjain1474]

Thanks, got it

[@jagdish_pawar]

this solution is O(N^2) right? but the better approach is in O(NlogN)

[@LegitGamer2345]

Awesome explanation sir

[@ankitdebnath2597]

What an explanation.Woaah👍

[@Pepcoding]

Glad you liked it.
For better experience and well organised content sign up on nados.io
And for being updated follow us on Instagram instagram.com/pepcoding/

[@dhruvsinghal6451]

Wonderful explaination

[@Pepcoding]

Glad you liked it.
Keep learning.
And for better experience and well organised content visit nados.pepcoding.com

[@OrewaAkashi]

Very good explanation bro 🔥

[@mickyman753]

jordaar solution

[@girikgarg8]

Done!

[@utkarshsharma1185]

Thanks a lot sir

[@rahulaggarwal3977]

Nice

[@riyakushwaha4347]

Wonderful explanation sir

[@Pepcoding]

Glad it helped.
For better experience, visit nados.io, where you will get well curated content and career opportunities.

[@raghavsinghhal5564]

how to think first time ???

[@anujpatel307]

Impossible for first time unless you have seen such question before!

[@sohaibmansuri279]

upload code in c++ also

[@araragikoyomi7186]

This was a tough one