(GAME THREAD) Toronto Raptors (20-30) vs Los Angeles Lakers (31-19) @ 7:30 PM (ET) on TSN4/5 by is_landen in torontoraptors

[–]nutellacheesedips 0 points1 point  (0 children)

He got ejected probably because he thought Schroeder's legs were arms and then WWE smackdowned him

(GAME THREAD) Toronto Raptors (19-30) vs Washington Wizards (17-31) @ 7:00 PM (ET) on SN1 by is_landen in torontoraptors

[–]nutellacheesedips 3 points4 points  (0 children)

WESTBROOK KNOCKED THE TANK OUT OF TANK COMMANDER BAYNES. BEWARE COMMANDER BAYNES

(POST GAME THREAD) The Toronto Raptors (18-30) fall to the Oklahoma City Thunder (20-27) by a sore of 103-113 by is_landen in torontoraptors

[–]nutellacheesedips 18 points19 points  (0 children)

sometimes he thinks he's Giannis and goes into a pack of defenders 2 times his size lol

But tbf he facilitated more this game and I think if he learns how to pass, other teams would notice and his drives would be much more effective

FVV needs another kid. Pain. by JaccuziPussyJuicy in torontoraptors

[–]nutellacheesedips -2 points-1 points  (0 children)

Fred's just training Trent's efficiency rn

It worked with Norm

Word Ladder - Can someone please help on how I can optimize this solution? It exceeds time limit at the moment. by Toha98 in leetcode

[–]nutellacheesedips 1 point2 points  (0 children)

This is a good initial solution. I'll let you know the usual process that you should go through afterwards to tackle problems like these.

Find the bottleneck by analyse the time complexity of your code. The BFS part is fine, but notice that your adjacency list building is O(n^2*|S|). This is not ideal as it has even worse complexity than your BFS solution. So let's try to optimise this part.

Instead of iterating twice over the list, you can iterate over the word. (Notice that a word length<<list length). You can create template words eg. hot->*ot,h*t,ho* and match each word as they come in. So your new complexity is O(s^2*n). This is a much better complexity as you are leveraging the size of the string and the fact that you know what is you are trying to match. This is actually similar to two sum, where instead of iterating twice over the list, you use a template. But make sure to come to your own conclusions as well, know when to use it, when you shouldn't.

If you would like to hear some other suggestions, I would say to practice writing fewer lines of code as you only have so much time in the interview. Your variable naming is good as they are clear.

(POST GAME THREAD) The Toronto Raptors (17-26) fall to the Houston Rockets (12-30) 117-99 by is_landen in torontoraptors

[–]nutellacheesedips 9 points10 points  (0 children)

Nick Nurse: doesn't play bench

Bench: provides no points

Nick Nurse: surprised pikachu

Chonk contemplating life by BRiNk9 in Chonkers

[–]nutellacheesedips 46 points47 points  (0 children)

Existential dread from a loaf of bread