Maximum Beauty of an Array After Applying Operation | Leetcode 2779

[@ayushmourya5629]

Hi sir, I have been following your daily videos for a while and the consistency to post these so early in the morning is truly remarkable. Thank You

[@techdose4u]

Appreciate it, I try my best to keep up the daily rhythm!

[@ricardoriolgonzalez1128]

Nice idea and explanation!

[@techdose4u]

Thank you! Cheers!

[@JuicyM0N]

love your explanation!!! just one thing about this video , there is some kind of electrical disturbance in audio , for reference check 8:25 - 8:35 .

[@techdose4u]

I had noticed while editing. This is due to the mic shaking due to unstable table. The swing arm of the mic holder is not very stable :| Gotta do something about it

[@BigStin-0]

Thank you Sir!

[@techdose4u]

Welcome! 😊

[@nicolaswolyniec1354]

I used the sweep line technique to solve it. I remembered one of your previous videos. Thanks!

[@techdose4u]

nice

[@GauravAttri-j5m]

Can you please post the solution here , i too tried to solve it with sweep but it showed some error

[@nicolaswolyniec1354]

@@GauravAttri-j5m sure thing! class Solution: def maximumBeauty(self, nums: List[int], k: int) -> int: events = [] for n in nums: events.append((n-k, 1)) events.append((n+k+1, -1)) events.sort() ans = 0 curr = 0 for p, e in events: curr += e ans = max(ans, curr) return ans

[@GauravAttri-j5m]

@@nicolaswolyniec1354 thanks

[@LinhĐình-o5o]

thank you for your lesson

[@techdose4u]

Welcome 😊

[@ViratDwivediMIA]

1:20 what calculation is it ? plz i didn't get

[@rutikbhanushali957]

Intuitive approach..

[@techdose4u]

👍🏼

[@sailendrachettri8521]

Thank you sir :)

[@techdose4u]

welcome :)

[@deeshadubey3127]

Nice sir.. But there I one more thing we can keep moving right Pointer and we will only move the left only if it breaks our condition in this way we can do this using single loop❤ Thanks a lot🙏

[@techdose4u]

welcome

[@devmahad]

thanks :)

[@techdose4u]

welcome :)

[@vishweshchaudhari5285]

Hello it would be very use if we get some videos on how to approach problem or pattern in general. Instead solution directly. May improve overall understanding

[@techdose4u]

👌🏽

[@sriraman1817]

Thanks a lot for all the videos. By any chance is there any plan to post videos of contest solutions also ?

[@techdose4u]

welcome. no such plan due to lack of time.

[@prasunroy2802]

Similar questions: 1. 3346 Maximum Frequency of an Element After Performing Operations I 2. 3347 Maximum Frequency of an Element After Performing Operations II

[@techdose4u]

great

[@AlbinSabu-y2v]

Love the way of ur expln calm neat & deep❤🎉 , by the way can u pls explain how we compare the 10to the power of any num (given constraints)compared with TC . Thankyou

[@techdose4u]

kzbin.info/www/bejne/lX2mpKprf5KAoJIsi=y4GmUlGZYMeYmyy9

[@AlbinSabu-y2v]

@techdose4u thnkyou🤍

[@GoodBoy-bi8up]

sir,y v r multipling the value k with 2

[@dushyantsinghkhichi5895]

I + K

[@techdose4u]

i-k to i+k is 2*k

[@vaibhav454]

Please start uploading LeetCode contest solutions....

[@techdose4u]

out of time man :(