en
Gayle Laakmann McDowell

Cracking the Tech Career

Сообщить о появлении
Загрузите файл EPUB или FB2 на Букмейт — и начинайте читать книгу бесплатно. Как загрузить книгу?
Become the applicant Google can't turn down 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.
Эта книга сейчас недоступна
321 бумажная страница
Уже прочитали? Что скажете?
👍👎

Цитаты

  • Maryja Radziukцитирует8 лет назад
    Inserting an element in a tree falls into category 2. Trees are not actually used that often in industry, but they're so fundamental, how could you not know them?
    Tree balancing, however, does not fall into this category. You should know that tree balancing exists, and you should know basically how it works (rotations when the sides get too uneven), but the little details are not that essential to know. Skip it.
    The complex dynamic programming questions—the ones you read about in big algorithm books—are usually too complex for an interview. They can come up, but they tend not to make good questions.
    However, simple dynamic programming questions—memorizing (or caching results between recursive calls)—can come up. It's worth it to spend a bit of time practicing those questions, but they aren't as complex as you might assume
  • Maryja Radziukцитирует8 лет назад
    Depth-first search
    Recursion
    Tries
    Binary search
    Memorization/dynamic programming
    Stacks
    Merge sort
    Memory (stack vs. heap)
    Queues
    Quick sort
    Big-O time
    Dynamically resizing arrays
    Tree insert/find/etc.
    Hash tables
    Heaps
    Graphs

На полках

fb2epub
Перетащите файлы сюда, не более 5 за один раз