Mock Coding Interview with Ex-Google & Ex-Microsoft Software Engineers

In this video, Ex-Microsoft Software Engineer Rachit Jain and Ex-Google Software Engineer Clement Mihailescu do a mock coding interview: exactly the type of coding interviews that big tech companies like Google give.

[RachitJain]

How many of you think I should interview Clement next time?

PS: I don't see any card trick intros, is this not Clement's channel?

[kaichenghu]

Hey Clement, thank you for the video. It is really helpful for people who are preparing for technical interviews. I feel like you could actually start a series called "Mock Interview with and I think the series would be super helpful!

[BiancaAguglia]

This was very useful, Clement. I especially liked the clarifying questions you both asked. They teach a lot about the thought process behind solving these kind of programming questions. 😊 Keep up the great work.

[rishabhsharma]

Kudos to both of you for emulating interview environment so good and so naturally. Thanks a lot. Along with Rachit you got me zoned in too. Thanks to both of you once again.

[JoeWong]

I love these live technical interview sessions because it simulates what to expect in real life. I also love how you referred to Rachit's pseudo code as python hahaha!! (no wonder python is the most popular languages right now)

[nelsonthekinger]

very cool interview i liked how you guys struggled, clearly not fake mock interview

[ruchisaluja]

This video was really nice to watch! Thanks for uploading such content.
Also, I think to better understand the question, it could've been said that there should be no ''forking'' in the path.

[mudumbiarun]

explanation and problem solving of both of u are exceptional and great

[pugboi]

“Let’s go with pseudocode” proceeds to write in python

[Garentei]

Rachit legit sends Clement to the shadow realm with a dab at 31:10 and Clement disappears at 31:24

[gangland]

This is how it’s done I like clement video then I watch then cuz I know I’ll do it eventually

[almamun]

Need some video on problem solving like this one.

[sneha_d_mystery_princess]

Thankuuuu #Clément it was super helpful... I like the positivity of these big Tech company interviews.. they don't unnecessarily grill you and make you nervous instead they kinda try to bring you back on right path if you deviate.. Super helpful it was Thank you #Clément

[duhancaraciolo]

There's a very subtle bug in the first solution. When answer is INT_MAX, it's not updated to -1 (it only returns -1, but dp[pos] doesn't get updated to -1).

This means that dp[pos] will be INT_MAX and everything will break afterwards because it will be different than -1, so the code will add 1 to it, which will cause it to overflow. Then the answer will be very wrong.

Also, the if is checking == UNDEFINED, instead of !=.

And the complexity of checking if cur is in exists is O(len(cur)), not O(1). So the total complexity is O(N^3), not O(N^2). As other comments said, we need to use a Trie to get O(N^2).

[samarthtandon]

I found 2nd question quite easier than 1st
Just call
root->val + pathmax(root->left) + pathmax(root->right); from the main function

[NirmalSilwal]

probably the best video on the channel

[mudumbiarun]

thanks for providing with this information

[skdx]

at around the 23:00 minute mark where you added the addendum statement about including negative numbers, youare looking at the amount to gain from the right and the left side in total and the recursive call from rootMax and pathMax checks this inductively, you just need to add an additional line to check if a given node is adding positive value to the total

[priyankasarkar]

Great! Kindly upload videos for database developer.

[jonathanconte]

I have my interview with Microsoft on September 9th, this video comes at the perfect time <3

Edit : I made it to the final round ! It will be happening on February 18, 2020 !