Big fann

Lol I just merged the intervals

Understandable and concise explanation/implementation. Subbed

the most voted solution is of sliding window which is really neat

hey could youu please make a video how to deal with questions based on lexicographical no ones ever made any please i am feeling frustated about not being able to solve those based questions

I watch because Larry is a fitness influencer. ;)

Are you anti-anything?

Did you make enough appends?

if you get confused yourself, you can be sure it's not any less confusing for the viewers :D I'd recommend to draw a bit, it would help both sides I'd believe, and please, do edit such parts, it would be a much better 10min than it is 18min one, anyway, appreciated :)

i also thought you were wearing an OnlyFans shirt

the kids do indeed call it drip. your fit was clean and the vibes checked out

Thanks for sharing easy to understandable code instead of fancy code.

i am not able to understand it quite.

Also there was a longer delay in my region i was able to start the contest after 20 mins since i thought the contest was cancelled.

I think i didn't get this :( what i did was to add all the non start characters in a heap that first sort the elements based on the lexicographical order and than if they are same character we just give priority to the right most ones so each time when i encounter * i just pop from this heap and add to the miss idx. but say if the star is at end then it would take nlogn heap operations (logn for each addition ) and then only then i pop . SO my code gives O(nlogn) which works given the constraints but i want to learn the optimised approach. Larry can you do a dry run and explain.

wow it was simple only! I could have solved 3 today! Man its frustrating.

Do yo do codeforces??

It's not funky, actually it's exactly what I did too

Did you get bit by this problem?

Are you seeing stars after this problem?

Do you actually have days without meetings?

How many things are chairs?

ṣeeing larry on full screen is an achievement

congrats on hoodie 🙌

hey hey larry😊

nice shows your dedication.

I've been eyeing the shirt, but I'll have to start try doing some contests, or wait 400 more days HA

Did your string get reversed?

Larry what job are you doing.??

Bro made a 3 n a half minute video and he talked about random things for 2 minutes😂🔥

how old are you

3:18 "...unless you happen to be an Indian.." not sure how I feel about it, proud or disheartened 😅

Love from India

Hello sir, Can you make a playlist of dsa topicwise problems of whatever you had solved till now. So that it would be structured.

Were you able to guess the number?

Did you find all the common elements?

What is the score of your string?

Were you able to remain self-contained?

Man, that's a gorgeous solution. I don't think there's any tricks at all. If you know the idea behind xor'ing all numbers to cancel pairs out, you just need to extract the pair from the result. And if you can interpret what each bit in the result means (in terms of a and b's bits at that position), you can find one of the numbers, which lets you find both of the numbers.

Larry would you tell me about your daily routine excluding coding 😄

If you were to recommend someone to learn dp and other concepts , what resources will u suggest?

Thanks for the explanation of the most optimized solution via combinatory. For those who have been stretching head on why k-=1, that is because you start at floor 1.

I couldn't get this one. I had to look it up :( Either ways I agree that understanding is not problem solving. You can agree with me on each step but at the same time you still wouldn't be able to come up with each step yourself if you went back to the start.

Did you get around all the indexing?

Were you ale to get a single number?

congrats on 1k

how do you get that good in programming? i need some tips on that as well

bro , great explanation. pls turn on dark mode.

what a hard problem...

Did you get around making the strings smaller?