Видео

Thanks so much, really appreciate it!

Thank you, friend

Thank you, friend!

Thanks Saurabh! Appreciate your kind words and your coming back each week!

Very nice! Good job solving all four questions. Yeah the weekly contest time is not ideal for a lot of folks. As usual, appreciate you supporting the channel, RF!

Hmm, I'll try to release some videos in C++. I haven't done C++ in years, and I'll definitely struggle in the contests. I'll practice two weeks and maybe I'll do C++ for Sept 14!

Thank you subhajitdey135! I appreciate your kind words and I usually stream every weekend. Happy to help!

Thank you for your encouragement! Keep on working at it -- getting just one question is a good step forward. Hope you come back next week and get two questions!

Yeah, Q3 is much harder than Q4 this week. I did Q4 first cos I couldn't do Q3, so the contest time is better. Let's hope next week is better for both of us, ITACHI!

Yes, unfortunately I wasn't able to do those questions either. I was certain Q3 was Heap, but there was another trick for dealing with large exponents which I didn't get either. I'll try to solve them later today and release a separate video if I succeed!

@@alex.does.leetcode Looking forward to it! I didn't get #3 or #4 either. I assumed that the heap would be enough for #3, but it wasn't. Looking at some of the other code, it looks like it takes rewriting the pow function to make it more efficient using some fancy bit manipulation that I don't fully understand.

This was a REALLY hard contest, ITACH1! But just by showing up and trying (and learning) you are already winning.

Fantastic question! Your best clue is when there is some long structure of size n (either an actual data structure like a list, or just some kind of sequence of numbers), and: a) It's easy to solve when n = 1, b) It's easy to solve n=i when n=i-1 is known. In Q3, we can solve this easily when nums is of length (n=1). To solve n=2, we group all the monotonic pairs of length 1 by their last arr1 value, then use that count how many new pairs of length 2 can be created. And so on for n=3, etc ... This suggests that you can use a DP approach. Hope this helps!

Thanks for the feedback! I'll try to add to Github, though it's unlikely I will do the contest in Java.

Good attention to detail! Yes it means the index (which is i, not k) only goes up to n-2. Why? Think about the condition "seq[i]!=seq[i+1]". It compares each number at i to the "next number" at (i+1). What is the last value of i you need to check? The second last i at (n-2) will compare itself to the last i at (n-1), and you are done. In fact, index (n-1) has no "next number" to compare to.

You can write it out on paper: when n is 10, i goes from 0 to 9. Which is the last pair you check for "seq[i]!=seq[i+1]"? That's right, it's index 8 and 9, which makes the last i = 8 (aka n-2)

Thanks Satyam! Appreciate your kind words and continued support!

Hi Vaibhav, unfortunately I don't do LinkedIn or anything else, but feel free to connect via comments or come by my livestreams if you want to ask questions or chat!

Okay sir thank ❤​@@alex.does.leetcode

Thanks for your kind words, Ganesh! Appreciate it

Thanks, A_Myth963! Appreciate your kind words!

Great question! Bisect is Python's binary search module. I have a short: ruclips.net/user/shortsXUyAgYQPZYM You can also learn more about it at www.geeksforgeeks.org/bisect-algorithm-functions-in-python/

Thanks man! Glad the stream is helpful to people

@@alex.does.leetcode Yupp... i was stuck on problem 3 nd 4 this is my first contest...

You too, RedFinance. See you next weekend!

Thank you for your kind words! I'm glad the explanations were helpful to you

@@alex.does.leetcode it was the greatest explanation by you but can we connect please 🙏

@@VaibhavSingh_code Thank you! Though unfortunately right now I don't give out my LinkedIn.

@@alex.does.leetcode okk

@@alex.does.leetcode then tell me I am in 3rd year engineering I want opportunities please help me

Will do! Some of my beginner problems are a bit older though.

Hi, I can add C++ solutions to Github, though I will likely still do my explanations using Python. Will that help? Really appreciate your feedback either way. I've found it a bit easier to teach in Python since there is less boilerplating, but I do realize many students learn C++ or Java.

@@alex.does.leetcode It will surely help if you only provide the codes. In india, most of the people use C++ or Java for learning DSA. So, it will help you to reach to large audience.

@@study-yd6es Thanks! I didn't know that about India before!

Thanks for your encouragement, Srivatsan!

Nice. How did you animate this?

@@userhandle-l I used VSDC. It's free and good for video processing

Thanks for your kind words and see you next week!

Thank you! I'm really encouraged to hear you say that

You are welcome!

Thanks and no worries! Loved having you in the chat, you're doing really well for your age -- I hope you can find opportunities for internships and strong universities to apply to.

Thanks for your kind comment. I'm glad this video was helpful to you!

I hope you do! I've been a programmer for 15 years and I still love it. I know you will find your passion for the craft some day!

Thanks for the feedback! RUclips weirds out the stats if I alter the livestream vod in any way. I've shortened the stream vod, hopefully this makes it easier to watch.

I've been out sick, but new videos are coming! I have the solution for last week's Biweekly Contest out tomorrow, and I'll be in Contest #382 on Sunday. Hope to see you in the live stream.