Ex-Google tech lead Patrick Shyu walks you through a technical interview for a Software Engineer job, and explains how to ace that whiteboard coding. The TechLead guides you through an interview session, so you can be as prepared as you can. Good luck!

👇 SUBSCRIBE TO MY YOUTUBE CHANNEL 👇
http://youtube.com/techlead?sub_confirmation=1

http://instagram.com/patrickshyu/
http://twitter.com/patrickshyu/

For more tech interview tips & tricks, check out TechLead: Season 1 Complete HD available for purchase. https://www.youtube.com/watch?v=_wbKUHBPkh4

Here’s my tech setup (★★★★★):
My Desk Lamp: https://amzn.to/2xDguWy
My Mouse: https://amzn.to/2DrGuJD
My Keyboard: https://amzn.to/2xEOaTy
My Camera: https://amzn.to/2W5dm0k
My Macbook: https://amzn.to/2OuKJFj
My Headphones: https://amzn.to/2phsWqj
My Multitool: https://amzn.to/2xwf9zJ
My Monitor: https://amzn.to/2RdlDzD

Listen to audiobooks to save time on your drive, here’s a free book coupon:
http://audibletrial.com/techlead

Video explanations of popular interview questions:
http://algoexpert.io/techlead (use code “techlead” for a discount)

32 Comments

  1. Shivam Bhalla

    March 23, 2019 at 9:14 pm

    @techlead when you hear about someones background story and are very impressed (lets say they built out an app that built in lots of users) and didnt do so great in the whiteboard challenge, would you still consider hiring them?

    Reply

  2. conjugate prior

    March 23, 2019 at 9:14 pm

    bro are they really this easy??? like would you ask this if you were interviiewing someone with 4+ yrs exp?

    Reply

  3. Skylark

    March 23, 2019 at 9:14 pm

    One time I had an interview scheduled with Canonical and the interviewer was on holiday. One time I had an interview with a organization and the interviewer forgot about it. Don't bother working for these coorps, all the info you need is on the web.

    Reply

  4. Skylark

    March 23, 2019 at 9:14 pm

    Meh.. bs

    Reply

  5. Carlos Alarcon

    March 23, 2019 at 9:14 pm

    Tea Lead 🙂

    Reply

  6. Zack Zefferini

    March 23, 2019 at 9:14 pm

    Thanks Techlead

    Reply

  7. PressX2Jason

    March 23, 2019 at 9:14 pm

    Could you go more into the hashtable vs array for keeping track of visited nodes?

    Reply

  8. Pavel Janečka

    March 23, 2019 at 9:14 pm

    nice lamp.

    Reply

  9. NightLurk

    March 23, 2019 at 9:14 pm

    Erm… am I not on the same page with the cell color problem, cause my solution involves a single loop over the whole grid top left to bottom right, and no recursion or back tracking… aaand it can use a unidimensional array, no array searching or looping and no hash tables… 😀

    Reply

  10. koldasquare

    March 23, 2019 at 9:14 pm

    0:43 ,,I…will…tell…something…about me…so that can you calibrate your conversation for me."
    Such a geek, I love it 😀

    Reply

  11. Andy Li

    March 23, 2019 at 9:14 pm

    17:17 is gold – if you want a broad understanding of how to approach learning and explaining data structures and algorithms, this is really good advice. Thanks to the Tea Lead 😉

    Reply

  12. SuperChazza101

    March 23, 2019 at 9:14 pm

    You can have all the money in the world, but it doesn't give you good humour (see first 10 seconds)

    Reply

  13. Jabberwocky

    March 23, 2019 at 9:14 pm

    Am I missing something?
    It seems like you don't need depth first or breadth first, a double loop should suffice on its own. Iterate over n*m array, while remembering the last m 'elements' that you visited, where each 'element' knows its type and has a reference to an integer that counts the number of squares in that cluster. Presumably, the overhead of O(m) space shouldn't be a problem if you already have a O(nm)-size structure at hand.

    Reply

  14. Nima Aghdaii

    March 23, 2019 at 9:14 pm

    Such recursive wisdom! 😂
    "Recursion uses stack space, which is limited. And that limit is how much stack space you have."

    Reply

  15. Michele Emiliani

    March 23, 2019 at 9:14 pm

    Thanks that was very informative and well structured. I really got into the solution and at first I thought I was doing good then hash tables and all the other considerations and I realized I havent been looking at the problem with that level of details. Thanks again keep it up!

    Reply

  16. SikoSoft

    March 23, 2019 at 9:14 pm

    really good stuff here

    Reply

  17. Matthew Guarino

    March 23, 2019 at 9:14 pm

    @techlead 8:25 Would the for loop method be iterative and a recursive method just call itself and then output when the terminating criteria is reached?

    Reply

  18. Andrew Gallasch

    March 23, 2019 at 9:14 pm

    Here's a solution in ~10 LoC without DFS with the same time complexity O(n) and space complexity O(1/n). https://gist.github.com/bemusementpark/d24538b9f0c74c385adfda348e546d97

    Reply

  19. Rafael Santana

    March 23, 2019 at 9:14 pm

    Connected componets algorithm. 8 connectedness. If you have taken courses in image processing you already know the solution to this project.

    Reply

  20. Todd Boothbee

    March 23, 2019 at 9:14 pm

    Should old farts (40 yrs+) bother applying to junior software engineer positions, I mean for more than interviewer laughs?

    Reply

  21. MrWhiteHawk

    March 23, 2019 at 9:14 pm

    If only companies really did give feedback, 90% of the companies I've interviewed with thus far never give feedback on why they reject you, after a long process of 2-3 phone screening, and an onsite interview… 🙁

    Reply

  22. Glenn McEnroe

    March 23, 2019 at 9:14 pm

    A good discussion of Google interview with you. Some may be interested into why you felt that your own first interviews with the Company did not go as you had hoped, a lesson learned from your own experience without bashing yourself too much. Sometimes it is difficult to gauge what the interviewer is looking for, or I have been at interviews (not Google, different profession) where I felt that the interviewer was not very experienced or trained in interviewing but was put in the awkward position, or you feel like the interviewer has already made up their mind about who they want to hire so why are we wasting our time here. I think it is a learning experience for both the candidate and the interviewer. Best deal is when you can go in confident that you are already slated to be hired but you are just going through the hoops, without being a jerk.

    Reply

  23. Thomas Wyrick

    March 23, 2019 at 9:14 pm

    I have an interview with Google in two weeks. I'm not going to lie, very intimidated.

    Reply

  24. KEN WINS

    March 23, 2019 at 9:14 pm

    I'm just here for the intros.

    Reply

  25. noy levi

    March 23, 2019 at 9:14 pm

    thanks for the video! it really opens the mind a bit more to understand what interviewers want from us

    Reply

  26. Austin Shin

    March 23, 2019 at 9:14 pm

    Is this considered a representative problem in terms of difficulty for an onsite interview for L3/L4?

    Reply

  27. Safwan Mohammed

    March 23, 2019 at 9:14 pm

    Very nicely explained. Thank you

    Reply

  28. NotYetDecided

    March 23, 2019 at 9:14 pm

    Can I have access to stackoverflow when I am being interviewed?

    Reply

  29. blah blahblah

    March 23, 2019 at 9:14 pm

    Pretty sure you can solve that problem in O(sqrt(n)) ish memory.

    Reply

  30. Thomas Hamilton

    March 23, 2019 at 9:14 pm

    I'd recommend using a Union-Find based solution to this problem.

    Reply

  31. J W

    March 23, 2019 at 9:14 pm

    I'm a project manager for hospital facilities I have no idea why I am here.

    Reply

  32. 12B

    March 23, 2019 at 9:14 pm

    this is unlike a Kim Kardashian thread. the difference is fascinating

    Reply

Leave a Reply

Your email address will not be published. Required fields are marked *

Check Also

How To Download Movies on Android Mobile Phones 2017 app

This video will show the easiest way to download movies on your mobile phone, just downloa…