Technical Interviewing
Download as PPTX, PDF2 likes367 views
Anthony Mays is a software engineer at Google who works in data visualization. He provides advice on preparing for technical interviews. The document outlines steps to take before applying for jobs, including being proactive, building relationships, continuously learning, and keeping an updated LinkedIn profile. It recommends preparing stories to demonstrate work experiences and challenges. Technical preparation involves practicing data structures and algorithms like sorting, searching, hashtables, graphs, and trees. Sample interview questions test coding skills and problem-solving abilities. Recommended resources include algorithm textbooks and websites for practicing interview problems.
Technical Interviewing
- 1. Anthony Mays Software Engineer January 3, 2015 Technical Interviewing
- 2. ● Raised in Compton, CA as a foster kid ● Ran into INROADS recruiter at school while walking around aimlessly at lunch ● First interned at City National Bank after high school in 2001 ● INROADS Intern of the Year 2005 ● Software Engineer at Google working in Data Visualization ● Interviewer and coach About the Facilitator
- 3. Contents ● Before You Apply ● Behavioral Preparation ● Technical Preprepation ● Tryouts ● Resources
- 6. 1. Be a “yes” (wo)man. Take every opportunity to do new things. 2. Invest in genuine relationships. People don’t care what you know until they know that you care. 3. Find the patterns. Don’t stop at just learning how to do things. Understand the “why” and the patterns will reveal themselves. 4. Never stop learning. Remember Moore’s Law. Before You Apply
- 8. Before You Apply 5. Show me the numbers. Make sure that your résumé includes lots of numbers. 6. Know thyself! Keep track of your accomplishments and be prepared to speak to your experience. 7. Keep LinkedIn up-to-date. Don’t look for jobs, let jobs look for you!!
- 10. Behavioral Preparation Project 1 Project 2 Project 3 Most Challenging What You Learned Most Interesting Hardest Bug Enjoyed Most Conflicts With Teammates * Source: Gayle Laakman Mcdowell, Cracking The Coding Interview (Fourth Edition)
- 12. Technical Preparation ● Know Big-O!!! ● Be an expert in a programming language - JavaScript, C++, Java, Python, C#, Ruby are possible choices. ● Sorting in O(n log n) time - Quicksort, Mergesort ● Search in O(log n) time - Binary search ● Hashtables!!! ● Graphs and Trees - Basically the same thing. o Depth-first and Breadth-first traveral o A least one or two graph algorithms. Dijkstra?
- 13. Tryouts
- 14. ● Write a function that computes the nth prime number. ● Given a string, output the reverse ● What does this function do? o int doSomething(int n) { return n << 1; } ● Given a string, remove duplicate words Tryouts (Software Engineer)
- 15. ● If you were the size of a penny, how would you escape a blender? ● Why are manhole covers round? ● How many golf balls fit on a bus? * Note: Google doesn’t ask these kinds of questions anymore, though other companies might. We generally don’t care about the answer, we care about how well you ask questions, define the problem space, and explain your solutions. Tryouts (General)
- 16. The Must Reads
- 17. ● Introduction to Algorithms (The CLR book) ● Cracking the Coding Interview - Gayle Laakman McDowell ● Programming Pearls - Jon Bentley ● Wikipedia ● Glassdoor.com ● CareerCup.com The Must Reads (Software Engineer)
- 18. The Must Reads (General) ● Glassdoor.com ● Geekinterview.com ● Wikipedia ● CareerCup.com
- 19. Thank you!