Cracking the Tech Career is the job seeker's guide to landing a coveted position at one of the top tech firms. A follow-up to The Google Resume, this book provides new information on what these companies want, and how to show them you have what it takes to succeed in the role. Early planners will learn what to study, and established professionals will discover how to make their skillset and experience set them apart from the crowd. Author Gayle Laakmann McDowell worked in engineering at Google, and interviewed over 120 candidates as a member of the hiring committee – in this book, she shares her perspectives on what works and what doesn't, what makes you desirable, and what gets your resume saved or deleted.
Apple, Microsoft, and Google are the coveted companies in the current job market. They field hundreds of resumes every day, and have their pick of the cream of the crop when it comes to selecting new hires. If you think the right alma mater is all it takes, you need to update your thinking. Top companies, especially in the tech sector, are looking for more. This book is the complete guide to becoming the candidate they just cannot turn away.Discover the career paths that run through the top tech firms Learn how to craft the prefect resume and prepare for the interview Find ways to make yourself stand out from the hordes of other applicants Understand what the top companies are looking for, and how to demonstrate that you're it
These companies need certain skillsets, but they also want a great culture fit. Grades aren't everything, experience matters, and a certain type of applicant tends to succeed. Cracking the Tech Career reveals what the hiring committee wants, and shows you how to get it.
Interview questions from the most popular companies in the IT industry are taken as examples to illustrate the five factors above. Besides solutions, it contains detailed analysis, how interviewers evaluate solutions, as well as why they like or dislike them. The author makes clever use of the fact that interviewees will have limited time to program meaningful solutions which in turn, limits the options an interviewer has. So the author covers those bases.
Readers will improve their interview performance after reading this book. It will be beneficial for them even after they get offers, because its topics, such as approaches to analyzing difficult problems, writing robust code and optimizing, are all essential for high-performing coders.
This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language.
HighlightsExpanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs) than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms
Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.