Відео

l,f=len(n),sum(n); o=t=sum(n[:f]) for i,v in enumerate(n,f): o=max(o,t:=t+n[i%l]-v) return f-o

I was pretty happy with myself on this one. Solved and coded it in 5 mins! 🎉

I also thought that we can only swap adjacent numbers ... Same boat

Love your videos Larry! Very good job 👍

Did you get all the ones together?

Were you able to transform the array?

so I need that fire, what should I do to keep it burning??

thanks for showing all the ways Larry.. I solved this using 3 variable top-down DP but now after watching your video my understanding of the sub-problems are solidified.

Did you repeat yourself?

How senior are your citizens?

Had a doubt... if the condition of breaking due to width (when the current width accumulated is more than the shelf-width ) occurs, the (offset + index) points to that particular book which hasn't been placed yet. So when you call for the recursive function why do you start from (offset +index + "1")? we should start with the current book which is not placed right? i.e ( index +offset+1).

i am facing same issue with (x1,y1,r1) and (y1,x1,r1) , not able to submit , i think need to verify if mid point of intersection present in rectangle

Oh man, you are so sloppy :D

How are you handling the bookshelves?

This problem really confused me. Looks like DP (remove or keep) but that is really hard to write.

Initializing best=right_a was a good one. I made a mistake of initializing best=N

v=[0,0] for c in [ord(c)-97 for c in s]: v[c]=max(v[0],v[c])+1 return len(s)-max(v)

had to draw again to really understand this logic, but really elegant solution. Love it, thank you!

I’ve never heard about sleep sort, thanks for telling about it 😅 And I was surprised to see square decomposition here 👍🏻

why best initialised with right _a?

hi larry i have a question you make such a good content who do you have so much less views and subscribers you definately deserve more than this . Im learning a lot from you videos Thanks for these.

Did you put this problem on reverse?

Sleep sort would unironically work here! haha

did ok

muscle confusion 12:34

Did you keep the problem balanced?

Hi sir, i am from india 🥲🙁

Hey Larry I could see you selecting or deleting whole line of text pretty fast (I guess without using mouse). How do you do that? Are there any keyboard shortcuts for that?

I got 2 tles on Q2 before realising I have set the sieve limit to 1e6 instead of 1e5 lol ;(

this was awesome

Thanks for the video. Btw, I think calculating an answer in one go is easier to understand compared to calling it twice with reversing an input def get_answer(smaller_left, smaller_right): ans = 0 for i in range(N): left_smaller = smaller_left[i] right_bigger = N - smaller_right[i] - i - 1 left_bigger = i - smaller_left[i] right_smaller = smaller_right[i] ans += left_smaller * right_bigger ans += left_bigger * right_smaller return ans

can you make a video on sorted Containers

Were your coins strange?

How did you do this contest?

How many teams were you able to form?

The approach that implemented while solving in the contest gave TLE. And now I could see that many C++ folks got it correct using the same approach.

ooof this was a really tough one for me.. thanks for the clear explanation and code larry!

This is so well written! Its like classical music I Strive to reach such levels! took me some time. but wow.

Thanks for solving every week for us : )

Thank you for the explaination Larry!

Is there any of your videos where you explained in details how to implement Dijkstra and floyd-warshall algorithms?

💗💗

I almost did apply the exact same logic but still couldn't wrap my head around some corner cases. This video really helped me learn about how to go about solving a problem. Thanks :)

Did you get around to the final destination?

got tle in the contest while solving

Do you feel sorry for Bob?

How special are your numbers?

Did you dominate this problem?

Did you get your corners covered?

Good stuff