Taking On Google's HARDEST Interview Questions

Показать описание

A top competitive programmer from the Codeforces/CodeChef realm (with almost zero prior interview experience) takes on some of the hardest interview questions known to Google to find out... how good is competitive programming, really? Is it enough to dominate even the hardest questions that Google has to offer? Or will these questions be enough to stump me? Find out in this video experiment.

(yes, lowest solve rate doesn't necessarily mean hardest, but it's the best I could do, and they were pretty hard anyway)

Questions

Music

Music: Local Forecast - Slower by Kevin MacLeod
License: [yt dislikes this link, removed]

Sthlm Sunset by Ehrling
(not exactly sure how to credit, the given link is dead)

This Is For You (Prod. by Lukrembo)

Timestamps [note that 1st hardest is skipped because I already did it]:
0:00:00 Intro
0:00:37 Format
0:02:02 Q1 (2nd hardest, 18.5%)
0:13:14 Q1 - Recap
0:14:11 Q2 (3rd hardest, 21.3%)
0:50:08 Q2 - Recap
0:51:30 Q3 (4th hardest, 21.8%)
1:02:44 Q3 - Recap
1:03:24 Q4 (5th hardest, 27.6%)
1:15:59 Q4 - Recap
1:16:33 Q5 (hardest medium, 16.6%)
1:23:23 Q5 - Recap
1:24:08 Conclusion

Рекомендации по теме

Комментарии

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

ShajidHasan

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.

ledira

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!

wesleyso

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<b, b<c but a!<c.

madarsmit

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

tagberli

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

Andrew_J

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.

offchan

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

ronstudios

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.

ka.patelhimeyatulkumarba

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

cortexauth

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!

Eidan

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

onurislak

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

yusufakn