Minimum Number of Arrows to Burst Balloons 🔥| Leetcode 452 | Greedy | Sorting

[@PuneetKumar-uq4ru]

Thanks a lot 😊 , feels like because of you I will go consistency solving problem everyday.

[@AyushiSharmaDSA]

Welcome Rohit😄😄🥺

[@ChandraShekhar-by3cd]

Thanks a lot for the great explanation and consistency!

[@AyushiSharmaDSA]

Welcome Chandra, glad they are helpful :)

[@TalhaTabrez7]

thank you! understood it well, was close to my intuition, but i didn't think about sorting the arrays within and was thinking the other way!

[@AyushiSharmaDSA]

Welcome! 😄 glad it was helpful

[@borse2982]

Thank you for explaining this problem in easier way..

[@AyushiSharmaDSA]

You are most welcome🤗

[@gauravchauhan7195]

Great explanation.

[@thesaurabh62057]

due to u,i got more confidence in coding

[@AyushiSharmaDSA]

Thank you, this means a lot 🤗

[@everytimecricket8884]

Clearly explained video and explanation

[@thegreekgoat98]

Very nice explanation! Understood perfactly.

[@AyushiSharmaDSA]

Glad it was helpful!🤗🤗

[@SoumyaRanjanSahoo-kq4ez]

nice explanation... very easy to undertand

[@AyushiSharmaDSA]

Thank you Soumya 😊

[@ayushjain386]

Thanx, for new approach ,i am doing this question ,merge interval

[@AyushiSharmaDSA]

Welcome, glad it was helpful :)

[@RishabSharma6969]

Thanks didi , great explaination.

[@AyushiSharmaDSA]

Welcome 🤗 glad it was helpful

[@shatakshivishnoi916]

clear explanation🙌

[@AyushiSharmaDSA]

Glad you think so!🤗

[@phaneendhrachinta7295]

Very Informative, Thank You

[@AyushiSharmaDSA]

Glad it was helpful!🤗🤗🤩

[@SuryaChallagali]

daily its a motivation, doing daily challenges with you.

[@AyushiSharmaDSA]

Great :)

[@sundarp7552]

Clearly explained. Thank you for your video

[@AyushiSharmaDSA]

Welcome :) glad it was helpful

[@smile8510]

Nice Explanation!

[@AyushiSharmaDSA]

Thanks 😊

[@Darshan-p5r5k]

thank you aisha akka

[@shreekrishna3453]

wow, great explanation

[@AyushiSharmaDSA]

Thank you, glad it was helpful :)

[@siddharthamishra7598]

Thanks so much for the video !!!!

[@AyushiSharmaDSA]

You are so welcome!🤗

[@jeeldasvani5015]

grt explanation ayushi as always

[@AyushiSharmaDSA]

Thank you, glad it was helpful :)

[@raj_kundalia]

thank you!

[@desihiphop4998]

Di consistency ke liye respect++ !!!!!!!!

[@AyushiSharmaDSA]

🥺🥺🥺 thanks mate

[@RohitSaini52945]

Thanks Ayushi! You are doing great job. Just one feedback - Before going into the actual solution please try to provide a dry run on any test case so that the question will be more clear to us.

[@AyushiSharmaDSA]

Hi Rohit, thanks sure, will keep in mind :)

[@AshwaniKumar-im6zb]

Thanks Ayushi. It helps me alot.

[@AyushiSharmaDSA]

Welcome Ashwani, glad it is helpful :)

[@SavitarOP]

OP Solution

[@AyushiSharmaDSA]

Thank you, glad it was helpful :)

[@kholiyamails1257]

thanks sis aag lgadi dont stop 😅

[@AyushiSharmaDSA]

Thanks yrrr🤩🥹

[@sumanshekhar8110]

It took some time to understand the if condition part, nevertheless nice explaination.

[@AyushiSharmaDSA]

thank you :)

[@Sejal-Maheshwari-2002]

Thanks for being consistent !

[@AyushiSharmaDSA]

Welcome, glad the videos are helpful :)

[@Rahulyadav-oh3yp]

I feel u solve the imp and problems whose chances of coming in interviews is mots! do u have any list of problems concatinated somehwere so that i solve those? like over some doc?

[@jaicev8412]

7 ,12 is also overlapping.. why we cant burst it ?

[@pranavkumarparihar1397]

Thanks di

[@AyushiSharmaDSA]

Welcome, glad it was helpful :)

[@rohit_700]

Is this some kind of series', Found your channel on LinkedIn!!

[@AyushiSharmaDSA]

It's leetcode daily challenge :)

[@SoumikGhosh-ef1jn]

Maam I have tried writing down the solution in java : class Solution { public int findMinArrowShots(int[][] points) { Arrays.sort(points,(a,b)-> a[1]- b[1]); int end=points[0][1]; int arrows=1; for(int i=1;iend) { ++arrows; end =points[i][1]; } } return arrows; } } but just 1 test case is not getting executed : points = [[-2147483646,-2147483645],[2147483646,2147483647]] Output : 1 Expected : 2 Please help me out in rectifying the issue in my code ma'am.

[@darshantrivedi5390]

Hii Ayushi dii, can you tell me How to get intership in good startup off campus ?

[@AyushiSharmaDSA]

Hi Darshan, keep looking for openings and if opening is there, then check if the job requirements matches your resume. In some startups, they ask DSA and in some they ask related to development or whatever skill they are looking for, so you need to prepare accordingly :)

[@darshantrivedi5390]

@@AyushiSharmaDSA ohk thanks

[@puneetkaur3061]

Didi I wanted to ask you what effect does declaration of comparator inside and outside class have on complexity ?

[@ganeshkamath89]

There is no difference in the complexity

[@anshvashisht8519]

anyone has java solution with same approach?

[@yashchamoli8695]

class Solution { public int findMinArrowShots(int[][] points) { Arrays.sort(points,(a,b)->a[1]-b[1]); int arrows=1; int end=points[0][1]; for(int i=1;iend){ end= points[i][1]; arrows++; } } return arrows; } } but dont know why it fails in 1 case [[-2147483646,-2147483645],[2147483646,2147483647]] this one

[@jaipurite8119]

int findMinArrowShots(vector& points) { int ans=1; sort(points.begin(), points.end()); int xend=points[0][1]; for(int i=1; i points[i][1])?points[i][1]:xend; } } return ans; }

[@rishabhbatra3022]

why we not sort according to start, why with the end?

[@AyushiSharmaDSA]

That can also be done :) try doing it with a test case

[@maddycoder1294]

[@samlinus836]

Nice xplanation sis However if you are workin on java... * [[-2147483646,-2147483645],[2147483646,2147483647]] this testcase might fail if you use Arrays.sort(intervals, (a, b) -> a[0] - b[0]); to sort the array... Now I did a quick analysis on why it doesn't work? You would understand it clearly if you clearly understand the working mechanism of compare(a-b) #Analysis if(a-b) is > 0 means, b comes before a else if (a-b) b)||(a