Видео

Thx!

Your method looks completely valid, thanks for pointing it out!

Of course, if I can I will.

Yeah, I hear this a lot. Gonna do something about it at some point.

Sure, I guess it takes some time :)

ILikeToUseCamelCaseDudeLoL

@ExtremeProgrammerr couse_you_are_extreme_programmer_lol

Because nobody would write 1+-1i

@@cosmnik472 yeah I would just use a tuple with real part and imaginary part, but tbf you could just convert 1-i to 1+-i

@@egaLwie. I would just use complex()

Yeah, 1+-1i is not the real representation, but if you check the problem description on leetcode, it is for this question. Complex() seem very nice. I'm not a full-time Python guy, thanks for pointing it out.

This is not my whole monitor. You should check the full-sized video to see if I hit "run". Thanks for giving the attention, though

😎

The problem is from leetcode.com

You have a number and a name on title, google yourself is that really hard?

That's problem #486 from leetcode.com, with the title "Predict the winner". Here is the problem description: You are given an integer array nums. Two players are playing a game with this array: player 1 and player 2. Player 1 and player 2 take turns, with player 1 starting first. Both players start the game with a score of 0. At each turn, the player takes one of the numbers from either end of the array (i.e., nums[0] or nums[nums.length - 1]) which reduces the size of the array by 1. The player adds the chosen number to their score. The game ends when there are no more elements in the array. Return true if Player 1 can win the game. If the scores of both players are equal, then player 1 is still the winner, and you should also return true. You may assume that both players are playing optimally.

I'm doing python for now. But the C# answer should be very similar, being so short in code.

Have fun not seeing another one :)

Hope you stay around and find the will to improve then :)

It's the solution to leetcode problem #375. You can check the problem description there :)

I don't see why not. I'm not arguing that this is the most valuable solution, yours could be better than mine :)

It's leetcode.com

Absolutely

Probably nothing :) That's what I do in general, include/import stuff and forget about it :D

@@ExtremeProgrammerralso how were you running this program?

As in, what was going on on line 237

Glad you liked it :)

Definitely right. Pinning this so everyone can see if there will be lots of comments in the future(don't think so)

@@ExtremeProgrammerr there will be. Keep going mate. You rock

@@iliqnew nicest thing I've heard for days. Thanks :)

I prefer low for faster typing most of the time

I hear this a lot. I was planning to be a small how-to kind of a channel, but I'm now really considering recording my voice too. Thanks for the input!

sets time complexity is o(1)

I agree that operations on sets are O(1), but creating a set with n elements should result in O(n), right (Since adding elements to a set is O(1) and we are adding n elements)? This is the complexity that I have. I can agree that your solution is easy to read and performs really well, but I don't think my solution is less optimized, in general. Am I not considering something? Please comment back, I would be really happy to learn more on that.

@@ExtremeProgrammerr Yup! ur right

Oh man, nothing to be amazed :D

@@ExtremeProgrammerr just keep pushing sir. And never give up. Also try new things and see how you can spice it up a bit

Lol let's say I'm pretty experienced in this sh*t bro. I'm around if you need help or sth

I'm a bit late on this answer, but just started to record some videos with commentary. Not the leetcode videos, since I'm basically making them the process of studying programming, but the project videos from now on will be commented. Hope you'll enjoy them!

Yeah man, some of them really are

Haha, I prefer light in the morning and dark in the night.

Sure, I can. Let's keep in touch! My first tip would be hard work and persistence :) coding is not hard but it takes time to perfect things :)

It solves problem 47 listed in leetcode.com. You can check the problem there :)

Stay tuned, I'll add an AI opponent to the game soon :)

You can easily construct integers from strings, and strings from integers. That's how it works on Python :)

@@ExtremeProgrammerr na I mean that can be done in java but see the constraints. If it's 200 letters each it won't fit the integer limit. That's why it's a medium level

Oh yeah, you're right. I'll definitely check the limits on that one

Because the language allows me to :) It's not funny but practical

I believe it can be trained :)

Happy to help!

Definitely will do. I was not sure if people would even open up the video, and your comment shows that they are. So it's on the list. Thanks for the feedback.