Відео

10:52 , shouldn't you check if(s[i]='0') you cant add answer to it? ex: 2019 will be 2 not 1 because 019 and 19 have the same suffix edit: lol my bad, i didnt read the problem constraint carefully

These videos are gold mines, an ultimate treasure. Loved it.

What happened to this guy is he still in Competitive programming

nice

This is him messing with computers since childhood, parents forced him through hard shooling math is essential for this type of programming

more videoss please

I used to waste a lot of time while solving a problem. I will stay on the problem for 1 day that was huge waste. This is a good advice think for about 20 minutes.

You are an amazing teacher

THANK YOU

hey, ty for this video <3

A wiesz jak zaprojektować duży system z użyciem DDD?

Да говори нормально, все свои

Can taking modulo M ensure the program would have produced correct results if we didn't take the modulo? As taking modulo with M will only produce results in [0, M-1] range. So, there might be some case, where two implementations (one is correct, and another is wrong) of the same problem might give the same results when we take the modulo and can bypass the test cases.

Love this video

I've been writing software for years and haven't interviewed in about 10. This is never used on the job so why is it tested for during interviews? Wouldn't system design make much more sense?

your article is just awesome

first time seeing this, proud of myself that i was able to come up with the alternative prefix sum algorithm within minutes. Never heard of kadane's algorithm before.

Can any one help me how can i apply binary search here ? An image is represented by a binary matrix with 0 as a white pixel and 1 as a black pixel. The black pixels are connected, i.e., there is only one black region. Pixels are connected horizontally and vertically. Given the location (x, y) of one of the black pixels, return the area of the smallest (axis-aligned) rectangle that encloses all black pixels. [ [0,1,0,1,0] [0,1,0,1,0], [1,1,0,1,0], [0,1,1,1,0] ] output = 16

The last problem "Count Coin change" can be solved in a much simpler way using 1D array: dp[0] = 1; for x in nums: for i from (1 to x): dp[ i ] += dp[ i - x ]; print dp[x]

This video is What i have WAITED to see for YEARS . You are FIRE 🔥

I like more the first one, for me it's the most important, just PRACTICE.

I thought about the fake-number-solution before. Why do we need to use -1? Just use any number not in the array, for example max(array)+1

You should explain your code with a working example

Thank you so so so much <3 <3

What language is he coding in?

I’m studying Python, thank you sir Jer salute🫡

You never dissappoint!

His chair left him to be red coder at the end

this guy learned english, and computer science and how to explain things clearly and put it all on youtube for free so us dumb people can learn, what a legend

And my Amazon phone screen interviewer wanted me to do this in 20 mins.

I have no math background. Can i still do this?

Wow I just watched it on the 1st of April

If someone has filename a.cpp... it means they are ☠️☠️💀

You're an amazing competitive programmer, but probably you should learn the c++ language a bit. For example, it was surprising to me that you didn't know about local variable's lilfetime and that it is an issue to return reference to it as it is already destroyed.

I'm convinced Errichto was sent by God

Great explanation! can you provide more problems to practice after each tutorial please? or in general what should one do after watching a tutorial like this? keep solving on the same topic or just solve problems in general? thanks a lot!

👩🏼‍❤️‍💋‍👨🏼🇮🇳🇮🇳🥥🥥🚠🚠🥇👩🏻‍❤️‍👨🏻💝💝🙏🏻🏠🏠👨‍👩‍👧👰🏻‍♀️🏏🏠🏠🏠

👨🏻‍🎓🥇🥇🗝️🗝️💝👰🏻‍♀️😄🥥🏠👨‍👩‍👧🕊️🥥👰🏻‍♀️💝🥇🥇🚠

where are you bro i even forget you exist

What if I just want to stuck for Long hours?

what if the question asks the maximum rectangle possible?

Dimension of dp is the number of variables which can completely define a state

dp is used to save time which gets wasted into doing repeated work Generally this happens when one state depends on more than one state

I like solving cs problems but this overwhelmed me

My man didn't even bother running the tests he went right to submit. I will never be that brave

We love Errichto..he is the best!

we can find nth fibonacci same fast than nth prime, but we can get is this prime faster than is this fibonacci LOL

Prefix sum really sizzled my brain two years into leetcoding. Phew!

5:29 yes bcoz you moved and it did something else. now it do same thing. and we not use % we use math,fom() its better

(ans-1+mod)%mod is important instead of simply ans-1 .. I couldn't figure it out myself.. for problem S-Digit Sum