Taking On Google's HARDEST Interview Questions

That jumping steam icon was hurting my eyes so much. I actually had to cover it up with something.

Not surprised I keep learning something new every time you post a video, Colin. Thank you for spending your time to making these fun and educating videos!

This is incredible to watch, I honestly thought I learnt c++ but clearly I know nothing. I really appreciate this kind of content exists, it's a huge helper for understanding the workflow when solving problems with code.

Woah youve bounced back from the motivation crash more efficient than ever! Weekly uploads! This is awesome

You can solve the first question just by using regular expressions or even simpler: just convert the string to float and see whether it succeeds.

This video is amazing ❤️

thank you bro the most essential thing we are learning here is how to approach a problem. it takes a hell lot of time to develop it. can you do one thing teach us algorithms like dfs and bfs and how to use them in different scenarios? the dfs and similar question the hard problems.

For Q2, if you're ok with working with doubles can't you just hash a tuple of the unit vectors of each point and count how many times that unit vector appears. You would need to do some edge cases I believe but I think it might go smoothly

Google just take this guy or he will destroy every hardest problem possible

Regarding the map question: it doesn't meet the "Compare" requirement (see cppreference). With a=(-1,-1), b=(-1, 1), c=(1,1) we have a

You are just amazing. If someone wants to become like you where would you suggest to start and what roadmap do you suggest? Please anything that come to your mind. Website...books... anything! Keep going!

What you do on steam ? (Just curious)

The reason might just be how leetcode manages the time limit for different languages, but following O(n^3) python code is judged AC for Q2 : class Solution(object): def maxPoints(self, points): """ :type points: List[List[int]] :rtype: int """ L = len(points) ans = 1 for i in range(L): for j in range(i+1, L): a,b = points[i], points[j] tmp = sum(map(lambda x: (a[1] - b[1])* (b[0]- x[0])== (b[1] - x[1]) *(a[0] -b[0]), points)) ans = max(ans,tmp) return ans

that freakin' steam icon popping 🤬🤬🤬

That steam icon bounce 😭😭

2:53 while reading my compiler books I have already been familiar with this lels, If I got it, I'd just slap the state machine. I think it's important to know such tools when you need to create some critical application and you just dont' have all the "testcase judge" with you

when will you start competitive stuff again ?

carry on bro

are you working faang companies?how did you learn coding like this?

What is your favorite class in terraria btw?