Відео

Really a good explanation

I did it the dumb way and used a greedy algorithm. Basically I had the sum of 1 to n over 2 and kept finding the maximum value that fits in it and chuck those into set one and put the rest into set 2.

Not even from the textbooks?

The main question is, do I have to pay? 😅

very cool but brother why u talk so fast, its your video you can slow down its ok

pretty cool explanation understood it quickly but you gotta chill 😅🤣

maybe you just don't realize you have more IQ than others. Some concepts are really stupid to understand clearly.

edging?

Leetcode is not for competitive programming, those problems are just for interviews and there's barely a good problem at Codeforces div. 1 level.

I'm finishing Computer Science and recently thought it'd be a better idea to do something more related to Computer Engineering or Electrical Engineering since on the Computer Science side the workforce is highly saturated so I wonder if it's the sqme or different for Computer or Electrical Engineering. Don't know if you can still get into these fields as a Computer Science major or teach yourself how when CS meets the hardware side of things.

12:00 bro was losing it, this is the funniest programming lesson ever, ty dude

Okay, I wasn't able to do this completely by myself, But If you know the starting number which is basically 1, 10,100, 1000 and so on. With some information such as starting_space, starting_number, length_of_single_number, You can find the number easily based on the below logic. Without the use of Binary Search def func(): inps = int(input()) for _ in range(inps): n = int(input()) hashmap = { 9: [1, 1, 1] } prev = 9 i = 1 while i < 19: base = 10 ** i highest = 9 for l in range(i): highest *= 10 highest += 9 main = ((highest - base + 1) * (i+1)) + prev hashmap[main] = [1 + prev, 10**i, i+1] prev = main i += 1 for key in hashmap: if key >= n: break context = hashmap[key] remain = n - (context[0]) incr = remain // context[2] value = context[1] + incr cut = context[2] - (remain % context[2]) for _ in range(1, cut): value //= 10 print(value % 10) func()

Beautifully explained ❤

I don’t even program but this just convinced me to try

YES SIR

thanks bro

😂

can we get that book you opened in middle

真好啊！找了四个视频终于找到浅显易懂的了！终于学会了！谢谢博主！！！

I liked when you went over the earlier examples visually but then you stopped for the later ones.

are you gonna do this?

❤

i love c++

nice video!

what rank are you now on codeforces?

excellent!

And if all of that jumping around does not work, just read the book chapter by chapter.

Great explanation (from india)

Yes 😭😭 preach! I'm a beginner but I will not give up!!!

This guy motivates me!!!

I have a feeling my math, coding skills and motivation will improve after watching this guy! Love the vibe! Subbed!

6:29 it is not a max-heap. It violates the property "for each node, its value is greater or equal to the children's values"

Can u tell me about discrete mathematics with application solution book by susana .Epp

Finally someone who explains this simple

David Googling

I'm doing computer science and engineering

Thanks

Any way we can implement the fast pointer as moving three times faster than the slow one ? What would be the implications on the algorithm in this case?

@16.32 i think windowEnd is windowSize, they wrote it wrong but i get the idea, thanks for this video

me a 7th grrader not understanding a single thing u started doing after u included K

if you have more than one interval in your set

So it's just caching / memoizing for one speicific function (getting prev sum) basically

Thank you so much

Can you give a more in depth video/explanation on this? I just use the progress feature in LeetCode to see what I did.

great job! is there a github for all this? thanks!

Bro, You are god to me !!!!!!!!!!

excellent explanation

That’s so true. I love the energy too. thank you!

did anyone actually think of this without using any other resource or seeing similar questions when they came up with the timeout error for some cases ?

Hey Mike when will you make cp videos again? I was so surprised and happy to see that you gave the last cf contest. And also you seem like you a glow up. good for you man.