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

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

[@purushottamnitwarangal9263]

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

[@brp3522]

9:23 *Holiday bgm playinh*

[@user-rk9pk9dm4z]

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

[@varunjain3947]

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

[@cenacr007]

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

[@italk-gj5kk]

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

[@sanketbhagat1222]

Thanks for providing quality content.

[@qwerty_ra_ungamma]

Bro, Improve the Audio quality🙂🙂

[@ARYANMITTAL]

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

[@naveroo11]

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

[@manishprasad8736]

Thank you bhai!!
Great explanation!!

[@bhamidipatisatwik1165]

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

[@santhosh7042]

bhaiya please explain the binary search approach

[@hardikpatel352]

Thanks a lot

[@asthajain2511]

Your efforts sir😇

[@abytespaceneeded]

💝💝💝💝

[@YashiGupta-r8g]

its crazy i was looking for this only

[@YashiGupta-r8g]

wait its qs of the day

[@ayaaniqbal3531]

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

[@6mahine_mein_google]

heap approach is in O(N) time

[@ayaaniqbal3531]

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

[@6mahine_mein_google]

@@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]

@@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

[@vickyroy3595]

Aryan Missing Goldman sachs Tee!!😂❤

[@30sunique78]

☕ Tea or Tee ?

[@AdityaDhage-1603]

1st Comment

[@ARYANMITTAL]

❤️❤️🫡

[@worldofgaming748]

itni garmi mein ye kya phn rakah hai