|
@@ -33,11 +33,7 @@ Original: [англійською](README.md)
|
|
- [Що це?](#what-is-it)
|
|
- [Що це?](#what-is-it)
|
|
- [Чому це використовувати?](#why-use-it)
|
|
- [Чому це використовувати?](#why-use-it)
|
|
- [Як це використовувати](#how-to-use-it)
|
|
- [Як це використовувати](#how-to-use-it)
|
|
-- [Get in a Googley Mood](#get-in-a-googley-mood)
|
|
|
|
-- [Чи отримав я роботу?](#did-i-get-the-job)
|
|
|
|
-- [Йдіть зі мною](#follow-along-with-me)
|
|
|
|
- [Не почувайте себе недостатньо розумними](#dont-feel-you-arent-smart-enough)
|
|
- [Не почувайте себе недостатньо розумними](#dont-feel-you-arent-smart-enough)
|
|
-- [Про Google](#about-google)
|
|
|
|
- [Про відео-ресурси](#about-video-resources)
|
|
- [Про відео-ресурси](#about-video-resources)
|
|
- [Interview Process & General Interview Prep](#interview-process--general-interview-prep)
|
|
- [Interview Process & General Interview Prep](#interview-process--general-interview-prep)
|
|
- [Pick One Language for the Interview](#pick-one-language-for-the-interview)
|
|
- [Pick One Language for the Interview](#pick-one-language-for-the-interview)
|
|
@@ -76,6 +72,7 @@ Original: [англійською](README.md)
|
|
- traversals: BFS, DFS
|
|
- traversals: BFS, DFS
|
|
- [Even More Knowledge](#even-more-knowledge)
|
|
- [Even More Knowledge](#even-more-knowledge)
|
|
- [Recursion](#recursion)
|
|
- [Recursion](#recursion)
|
|
|
|
+ - [Dynamic Programming](#dynamic-programming)
|
|
- [Object-Oriented Programming](#object-oriented-programming)
|
|
- [Object-Oriented Programming](#object-oriented-programming)
|
|
- [Design Patterns](#design-patterns)
|
|
- [Design Patterns](#design-patterns)
|
|
- [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
|
|
- [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
|
|
@@ -87,6 +84,11 @@ Original: [англійською](README.md)
|
|
- [Scheduling](#scheduling)
|
|
- [Scheduling](#scheduling)
|
|
- [Implement system routines](#implement-system-routines)
|
|
- [Implement system routines](#implement-system-routines)
|
|
- [String searching & manipulations](#string-searching--manipulations)
|
|
- [String searching & manipulations](#string-searching--manipulations)
|
|
|
|
+ - [Tries](#tries)
|
|
|
|
+ - [Floating Point Numbers](#floating-point-numbers)
|
|
|
|
+ - [Unicode](#unicode)
|
|
|
|
+ - [Endianness](#endianness)
|
|
|
|
+- [Networking](#networking)
|
|
- [System Design, Scalability, Data Handling](#system-design-scalability-data-handling) (if you have 4+ years experience)
|
|
- [System Design, Scalability, Data Handling](#system-design-scalability-data-handling) (if you have 4+ years experience)
|
|
- [Final Review](#final-review)
|
|
- [Final Review](#final-review)
|
|
- [Coding Question Practice](#coding-question-practice)
|
|
- [Coding Question Practice](#coding-question-practice)
|
|
@@ -101,11 +103,7 @@ Original: [англійською](README.md)
|
|
|
|
|
|
- [Additional Books](#additional-books)
|
|
- [Additional Books](#additional-books)
|
|
- [Additional Learning](#additional-learning)
|
|
- [Additional Learning](#additional-learning)
|
|
- - [Dynamic Programming](#dynamic-programming)
|
|
|
|
- [Compilers](#compilers)
|
|
- [Compilers](#compilers)
|
|
- - [Floating Point Numbers](#floating-point-numbers)
|
|
|
|
- - [Unicode](#unicode)
|
|
|
|
- - [Endianness](#endianness)
|
|
|
|
- [Emacs and vi(m)](#emacs-and-vim)
|
|
- [Emacs and vi(m)](#emacs-and-vim)
|
|
- [Unix command line tools](#unix-command-line-tools)
|
|
- [Unix command line tools](#unix-command-line-tools)
|
|
- [Information theory](#information-theory)
|
|
- [Information theory](#information-theory)
|
|
@@ -113,18 +111,17 @@ Original: [англійською](README.md)
|
|
- [Entropy](#entropy)
|
|
- [Entropy](#entropy)
|
|
- [Cryptography](#cryptography)
|
|
- [Cryptography](#cryptography)
|
|
- [Compression](#compression)
|
|
- [Compression](#compression)
|
|
- - [Networking](#networking) (if you have networking experience or want to be a systems engineer, expect questions)
|
|
|
|
- [Computer Security](#computer-security)
|
|
- [Computer Security](#computer-security)
|
|
- [Garbage collection](#garbage-collection)
|
|
- [Garbage collection](#garbage-collection)
|
|
- [Parallel Programming](#parallel-programming)
|
|
- [Parallel Programming](#parallel-programming)
|
|
- [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
|
|
- [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
|
|
|
|
+ - [A*](#a)
|
|
- [Fast Fourier Transform](#fast-fourier-transform)
|
|
- [Fast Fourier Transform](#fast-fourier-transform)
|
|
- [Bloom Filter](#bloom-filter)
|
|
- [Bloom Filter](#bloom-filter)
|
|
- [HyperLogLog](#hyperloglog)
|
|
- [HyperLogLog](#hyperloglog)
|
|
- [Locality-Sensitive Hashing](#locality-sensitive-hashing)
|
|
- [Locality-Sensitive Hashing](#locality-sensitive-hashing)
|
|
- [van Emde Boas Trees](#van-emde-boas-trees)
|
|
- [van Emde Boas Trees](#van-emde-boas-trees)
|
|
- [Augmented Data Structures](#augmented-data-structures)
|
|
- [Augmented Data Structures](#augmented-data-structures)
|
|
- - [Tries](#tries)
|
|
|
|
- [N-ary (K-ary, M-ary) trees](#n-ary-k-ary-m-ary-trees)
|
|
- [N-ary (K-ary, M-ary) trees](#n-ary-k-ary-m-ary-trees)
|
|
- [Balanced search trees](#balanced-search-trees)
|
|
- [Balanced search trees](#balanced-search-trees)
|
|
- AVL trees
|
|
- AVL trees
|
|
@@ -144,7 +141,6 @@ Original: [англійською](README.md)
|
|
- [Geometry, Convex hull](#geometry-convex-hull)
|
|
- [Geometry, Convex hull](#geometry-convex-hull)
|
|
- [Discrete math](#discrete-math)
|
|
- [Discrete math](#discrete-math)
|
|
- [Machine Learning](#machine-learning)
|
|
- [Machine Learning](#machine-learning)
|
|
- - [Go](#go)
|
|
|
|
- [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
|
|
- [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
|
|
- [Video Series](#video-series)
|
|
- [Video Series](#video-series)
|
|
- [Computer Science Courses](#computer-science-courses)
|
|
- [Computer Science Courses](#computer-science-courses)
|
|
@@ -162,16 +158,16 @@ Original: [англійською](README.md)
|
|
|
|
|
|
Але, пройшовши цей план навчання, я впевнений, що мене візьмуть на цю роботу. Це дійсно великий план. Він займе місяці, але якщо ви вже знайомі з багатьма речами з цього списку, то, очевидно, ви витратите значно менше часу.
|
|
Але, пройшовши цей план навчання, я впевнений, що мене візьмуть на цю роботу. Це дійсно великий план. Він займе місяці, але якщо ви вже знайомі з багатьма речами з цього списку, то, очевидно, ви витратите значно менше часу.
|
|
|
|
|
|
-## How to use it
|
|
|
|
|
|
+## Як це використовувати
|
|
|
|
|
|
-Everything below is an outline, and you should tackle the items in order from top to bottom.
|
|
|
|
|
|
+Весь текст нижче - це список, а вам потрібно пройти всі його елементи зверху вниз.
|
|
|
|
|
|
-I'm using Github's special markdown flavor, including tasks lists to check progress.
|
|
|
|
|
|
+Я використовую спеціальну Github розмітку, щоб відслідковувати свій прогрес.
|
|
|
|
|
|
-**Create a new branch so you can check items like this, just put an x in the brackets: [x]**
|
|
|
|
|
|
|
|
|
|
+**Створіть нову гілку, аби ви могли теж відмічати зроблені задачі, поміщаючи x в квадратні дужки: [x]**
|
|
|
|
|
|
- Fork a branch and follow the commands below
|
|
|
|
|
|
+ Форкніть собі гілку та введіть команди нижче
|
|
|
|
|
|
`git checkout -b progress`
|
|
`git checkout -b progress`
|
|
|
|
|
|
@@ -179,7 +175,7 @@ I'm using Github's special markdown flavor, including tasks lists to check progr
|
|
|
|
|
|
`git fetch --all`
|
|
`git fetch --all`
|
|
|
|
|
|
- Mark all boxes with X after you completed your changes
|
|
|
|
|
|
+ Відмітьте всі елементи X після того, як завершите свої зміни
|
|
|
|
|
|
`git add . `
|
|
`git add . `
|
|
|
|
|
|
@@ -189,55 +185,13 @@ I'm using Github's special markdown flavor, including tasks lists to check progr
|
|
|
|
|
|
`git push --force `
|
|
`git push --force `
|
|
|
|
|
|
-[More about Github-flavored markdown](https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown)
|
|
|
|
-
|
|
|
|
-## Get in a Googley Mood
|
|
|
|
-
|
|
|
|
-Print out a "[future Googler](https://github.com/jwasham/google-interview-university/blob/master/extras/future-googler.pdf)" sign (or two) and keep your eyes on the prize.
|
|
|
|
-
|
|
|
|
-[](https://github.com/jwasham/google-interview-university/blob/master/extras/future-googler.pdf)
|
|
|
|
-
|
|
|
|
-## Did I Get the Job?
|
|
|
|
-
|
|
|
|
-I'm in the queue right now. Hope to interview soon.
|
|
|
|
-
|
|
|
|
- Thanks for the referral, JP.
|
|
|
|
-
|
|
|
|
-## Follow Along with Me
|
|
|
|
-
|
|
|
|
-My story: [Why I Studied Full-Time for 8 Months for a Google Interview](https://medium.com/@googleyasheck/why-i-studied-full-time-for-8-months-for-a-google-interview-cc662ce9bb13)
|
|
|
|
-
|
|
|
|
-I'm on the journey, too. Follow along:
|
|
|
|
-
|
|
|
|
-- **Blog**: [GoogleyAsHeck.com](https://googleyasheck.com/)
|
|
|
|
-- Twitter: [@googleyasheck](https://twitter.com/googleyasheck)
|
|
|
|
-- Twitter: [@StartupNextDoor](https://twitter.com/StartupNextDoor)
|
|
|
|
-- Google+: [+Googleyasheck](https://plus.google.com/+Googleyasheck)
|
|
|
|
-- LinkedIn: [johnawasham](https://www.linkedin.com/in/johnawasham)
|
|
|
|
-
|
|
|
|
-
|
|
|
|
|
|
+[Більше про Github розмітку](https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown)
|
|
|
|
|
|
## Don't feel you aren't smart enough
|
|
## Don't feel you aren't smart enough
|
|
- Google engineers are smart, but many have an insecurity that they aren't smart enough, even though they work at Google.
|
|
- Google engineers are smart, but many have an insecurity that they aren't smart enough, even though they work at Google.
|
|
- [The myth of the Genius Programmer](https://www.youtube.com/watch?v=0SARbwvhupQ)
|
|
- [The myth of the Genius Programmer](https://www.youtube.com/watch?v=0SARbwvhupQ)
|
|
- [It's Dangerous to Go Alone: Battling the Invisible Monsters in Tech](https://www.youtube.com/watch?v=1i8ylq4j_EY)
|
|
- [It's Dangerous to Go Alone: Battling the Invisible Monsters in Tech](https://www.youtube.com/watch?v=1i8ylq4j_EY)
|
|
|
|
|
|
-## About Google
|
|
|
|
-
|
|
|
|
-- [ ] For students - [Google Careers: Technical Development Guide](https://www.google.com/about/careers/students/guide-to-technical-development.html)
|
|
|
|
-- [ ] How Search Works:
|
|
|
|
- - [ ] [The Evolution of Search (video)](https://www.youtube.com/watch?v=mTBShTwCnD4)
|
|
|
|
- - [ ] [How Search Works - the story](https://www.google.com/insidesearch/howsearchworks/thestory/)
|
|
|
|
- - [ ] [How Search Works](https://www.google.com/insidesearch/howsearchworks/)
|
|
|
|
- - [ ] [How Search Works - Matt Cutts (video)](https://www.youtube.com/watch?v=BNHR6IQJGZs)
|
|
|
|
- - [ ] [How Google makes improvements to its search algorithm (video)](https://www.youtube.com/watch?v=J5RZOU6vK4Q)
|
|
|
|
-- [ ] Series:
|
|
|
|
- - [ ] [How Google Search Dealt With Mobile](https://backchannel.com/how-google-search-dealt-with-mobile-33bc09852dc9)
|
|
|
|
- - [ ] [Google's Secret Study To Find Out Our Needs](https://backchannel.com/googles-secret-study-to-find-out-our-needs-eba8700263bf)
|
|
|
|
- - [ ] [Google Search Will Be Your Next Brain](https://backchannel.com/google-search-will-be-your-next-brain-5207c26e4523)
|
|
|
|
- - [ ] [The Deep Mind Of Demis Hassabis](https://backchannel.com/the-deep-mind-of-demis-hassabis-156112890d8a)
|
|
|
|
-- [ ] [Book: How Google Works](https://www.amazon.com/How-Google-Works-Eric-Schmidt/dp/1455582344)
|
|
|
|
-- [ ] [Made by Google announcement - Oct 2016 (video)](https://www.youtube.com/watch?v=q4y0KOeXViI)
|
|
|
|
|
|
|
|
## About Video Resources
|
|
## About Video Resources
|
|
|
|
|