i think we are moving minimum because at LeetCode We define the range [a, b] is smaller than range [c, d] if b - a < d - c or a < c if b - a == d - c. hence starting from minimum give correct answer
Amezing explanation buddy.. If pair is not allowed in gfg then we can create k separate single LL and use the priority queue to get the range. How do you feel about this approach?
i think we are moving minimum because at LeetCode
We define the range [a, b] is smaller than range [c, d] if b - a < d - c or a < c if b - a == d - c.
hence starting from minimum give correct answer
Your way of explaining difficult concepts is great. Keep going
[1,2] will be smallest at 11:11
You are doing great work, you deserve much more attention and recognition.
Thank you so much 😀
what is the intuition behind picking minumum and moving from minimum index ?
Love it ! you're amazing !!!!!
AS USUAL EXCELLENT EXPLAINATION ADITYA
can u plz explain why did u used a.value>b.value .Since we want to arrange them in increasing order so it should hold like a.value
prority of small element is greater in minHeap. It returns element having higher priority
very nice explanation
Your accent matches with Ravindrababu Ravula. Great explanation btw!!!
Ohh really?, Thanks btw!!.
Please share the channel with all your friends!
1.can u plz explain why did u used a.value>b.value .Since we want to arrange them in increasing order so it should hold like a.value
Same dout ,if you have found any solution then pls explain to me.
Thanks in advance
In priority queue, we have to make class so that we can make overloading operator.
prority of small element is greater in minHeap. It returns element having higher priority
Amazing video excellent sir thankyou
Hey don't call me sir😂.
Glad it helped you😀.
Please share the channel with all your friends and subscribe 😀🙏.
Great solution
Why are moving min pointer instead of max one ? since range can be decreased by moving max pointer as well ? even if array is sorted
because we want to find the smallest range and the more you decrease the max, bigger the range will be.
Thanks a lot
Amazing Explanation Bro!!... Thanks alot
Glad that it helped you 😀.
Please share the channel with all your friends and subscribe 😀🙏.
Amezing explanation buddy..
If pair is not allowed in gfg then we can create k separate single LL and use the priority queue to get the range.
How do you feel about this approach?
I shall think about this and let you know
Ya sure 🤘
good solution
nice explanation....!!
Glad that it helped you!. Please Share the channel with all your friends and subscribe!
pls send link of the book
nice one
Thank you!. Glad it helped.
Please check out the other videos on this channel.
Share with your y and subscribe 😀🙏.
worth watching
Glad to know 😀.
Please share the channel with all your friends and subscribe 😀🙏.
sorry to say but your explaination is not upto mark 😔😔