dossorio / google-interview-university Goto Github PK

• System Design, Scalability, Data Handling (if you have 4+ years experience)
• Final Review
• Coding Question Practice
• Coding exercises/challenges

Book list

• Computer Architecture https://github.com/jwasham/google-interview-university#computer-architecture
• Language Specific https://github.com/jwasham/google-interview-university#language-specific
• Optional Books https://github.com/jwasham/google-interview-university#optional-books

• Don't feel you aren't smart enough
• About Google
• About Video Resources
• Interview Process & General Interview Prep

• Information theory
• Parity & Hamming Code
• Entropy
• Cryptography
• Compression

• Pick One Language for the Interview Issue #29 Implemented #28
• Book List
• Before you Get Started #31
• What you Won't See Covered #31

• Locality-Sensitive Hashing
• van Emde Boas Trees
• Augmented Data Structures
• Tries

• Trees

• Cómo-usarlo
• Get in a Googley Mood
• Did I Get the Job?
• Follow Along with Me

• More Knowledge

Issue implemented #28

• k-D Trees
• Skip lists
• Network Flows
• Disjoint Sets & Union Find
• Math for Fast Processing

To be congruent with the translation we need to replace the current resources with their analogues in Spanish, otherwise changing their title will not be useful.

• Unicode
• Endianness
• Emacs and vi(m)
• Unix command line tools

• Before you Get Started
• What you Won't See Covered

• Even More Knowledge

• Additional Books
• Additional Learning
  • Dynamic Programming
  • Compilers
  • Floating Point Numbers

Graphs

• Networking
• Computer Security
• Garbage collection
• Parallel Programming

• Sorting

• Machine Learning
• Go
• Additional Detail on Some Subjects
• Video Series
• Computer Science Courses

• Treap
• Linear Programming
• Geometry, Convex hull
• Discrete math

• Messaging, Serialization, and Queueing Systems
• Fast Fourier Transform
• Bloom Filter
• HyperLogLog

• N-ary (K-ary, M-ary) trees
• Balanced search trees
  • AVL trees
  • Splay trees
  • Red/black trees
  • 2-3 search trees
  • 2-3-4 Trees (aka 2-4 trees)
  • N-ary (K-ary, M-ary) trees
  • B-Trees

• Once you're closer to the interview
• Your Resume
• Be thinking of for when the interview comes
• Have questions for the interviewer
• Once You've Got The Job

• Prerequisite Knowledge
• The Daily Plan
• Algorithmic complexity / Big-O / Asymptotic analysis
• Data Structures