1509. Minimum Difference Between Largest and Smallest Value in Three Moves | Heap | Sorting

1509. Minimum Difference Between Largest and Smallest Value in Three Moves | Heap | Sorting | Greedy

Рет қаралды 5,846

Күн бұрын

In this video, I'll talk about how to solve Leetcode 1509. Minimum Difference Between Largest and Smallest Value in Three Moves | Sorting | Greedy
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / codewitharyanbhai
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/ary...
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

Пікірлер: 28

@purushottamnitwarangal9263 2 ай бұрын

I think there is better approach without using any higher order data structure as below : int minDifference(vector& nums) { sort(nums.begin(),nums.end()); int n=nums.size(); int ans=INT_MAX; if(n

@user-rk9pk9dm4z 2 ай бұрын

Your Teaching Style is Awesome!!! In love with data structures... & appreciate your consistency of uploading daily videos. Keep Going Bruh.. Well wishes.....

@varunjain3947 2 ай бұрын

Thankyou bro i couldn't understand this question earlier but you really make it so simple

@brp3522 2 ай бұрын

9:23 *Holiday bgm playinh*

@cenacr007 2 ай бұрын

Keep up the good work, your daily videos motivate e to do leetcode daily

@italk-gj5kk 2 ай бұрын

salute to your efforts for providing an optimised code as well...

@sanketbhagat1222 2 ай бұрын

Thanks for providing quality content.

@naveroo11 2 ай бұрын

class Solution { public: int minDifference(vector& nums) { int n = nums.size(); if(n

@qwerty_ra_ungamma 2 ай бұрын

Bro, Improve the Audio quality🙂🙂

@ARYANMITTAL 2 ай бұрын

Yaa it is pretty bad this time, i'll surely correct it ❤

@bhamidipatisatwik1165 2 ай бұрын

just want to know the difference in time and space complexity between nth element and partial_sort approach in c++ vs this approach afaik nth element in c++ uses partition method of quick sort so i think time complexity is same as this and what about space complexity

@manishprasad8736 2 ай бұрын

Thank you bhai!! Great explanation!!

@abytespaceneeded 2 ай бұрын

💝💝💝💝

@hardikpatel352 2 ай бұрын

Thanks a lot

@santhosh7042 2 ай бұрын

bhaiya please explain the binary search approach

@asthajain2511 2 ай бұрын

Your efforts sir😇

@user-fl5sw8op1g 2 ай бұрын

its crazy i was looking for this only

@user-fl5sw8op1g 2 ай бұрын

wait its qs of the day

@ayaaniqbal3531 2 ай бұрын

bro can we also do the above problem in O(N) Time Complexity ?

@6mahine_mein_google 2 ай бұрын

heap approach is in O(N) time

@ayaaniqbal3531 2 ай бұрын

@@6mahine_mein_google i don't think so because a single element take logN and N element will take NlogN

@6mahine_mein_google 2 ай бұрын

@@ayaaniqbal3531 here logN factor comes in because of the size of the heap but heap size is never more than 4 which means TC is Nlog4 , u can omit log4 as its a constant , thats why TC is O(N)

@ayaaniqbal3531 2 ай бұрын

@@6mahine_mein_google but bro that is space complexity and I am talking about Time complexity because to get that four element we have to go to each aray element and thus NlogN