How to: Work at Google — Example Coding/Engineering Interview

[youngmills]

When she said she was gonna throw a wrench into the mix I felt the pain lol.

[jg]

I realize I've got a long way to go. This gives me motivation, though.

[gnawlix]

Really helpful video. This reminds me of the classic Two Sum problem on LeetCode. Since we are told a pair of numbers equals a target sum, we can say that x + y = target. And solving for y (complement of x), we see that y = target - x. Therefore, we can just walk through the input sequence and for every element, insert it into a hash set while performing a lookup in the hash set to see if for a given `x` value (arr[i]) we can find a `y` that satisfies x + y = target.

[randyii]

Thank you guys for these amazing resources. It does make me feel less competent and ready but we can only learn hey.

[mtomazza]

Such a nice video. Very well conducted by both.

[brianlc]

2016: 2 sum 
2022: solve the travelling salesman problem in polynomial time 😭

[kwametseymathiasaledi]

I have a lot do now. I need to Study hard. Thanks googler, its very motivating

[juniorfariasxD]

This video was very helpful, thank you. Please do more videos like this.

[rrobetti]

Awesome. Thanks for this, is really helpful. You could use a Bloom Filter instead of the hash set to save on space complexity(O(1)) as per you only need to know if the complement is NOT in the list.

[victorcalabuigrodriguez]

I love the acting from the guy pretending to be looking for the answer. Thankfully for him he is an engineer and not an actor XD

[politesitsha]

Great video. Thanks for the tips, they're certainly helpful.

[drmilance]

Thank you, lady, for inserting that 'coma' at 14:20. My world collapsed a moment before.

[thealihassan]

Great job googlers! Keep em coming please :)

[andrewroc]

For the last part of the problem, wouldn't it have made sense to do some pruning along the way for repeat complements? It would have bumped up the running time, but for a case where space seems to be the main issue, that would be a necessary sacrifice for the problem if you were to not use multiple systems, wouldn't it?

[Weckacore]

Very intense, super interesting. Also, fun problem!

[vasudevsharma]

In the loop we can subtract the value like :-( sum - value ) and then find the output in before Position. if it found it return true and if not then false. In this case we not need to store any data.

[marvXn.]

I have a long way to go... But this is a motivation

[ahmedadamahmedahmed]

I have a lot do .now .I need hard thanks Googler, its very motivating

[MichelleB]

interesting, i was thinking since it is sorted to start checking at the end, skipping numbers which are too large and when you get to number that is <= 8, you would start doing binary search looking for the complement with the rest of the array (the beginning part) but that would still be n log n I think

[abdullaqeblawi]

Who writes the music for these videos. Hahahaha jk. It's very relaxing.