Translation: Russian #87
Description
- What is it
- Table of Contents
- What is it?
- Why use it?
- How to use it
- Don't feel you aren't smart enough
- About Video Resources
- Interview Process & General Interview Prep
- Pick One Language for the Interview
- Book List
- Before you Get Started
- What you Won't See Covered
- Prerequisite Knowledge
- The Daily Plan
- Algorithmic complexity / Big-O / Asymptotic analysis
- Data Structures
- Arrays
- Linked Lists
- Stack
- Queue
- Hash table
- More Knowledge
- Binary search
- Bitwise operations
- Trees(@Ilyushin)
- Trees - Notes & Background (@Ilyushin)
- Binary search trees: BSTs
- Heap / Priority Queue / Binary Heap (@Ilyushin)
- balanced search trees (general concept, not details) (@Ilyushin)
- traversals: preorder, inorder, postorder, BFS, DFS (@Ilyushin)
- Sorting (@Ilyushin)
- selection (@Ilyushin)
- insertion (@Ilyushin)
- heapsort (@Ilyushin)
- quicksort (@Ilyushin)
- merge sort
- Graphs
- directed
- undirected
- adjacency matrix
- adjacency list
- traversals: BFS, DFS
- Even More Knowledge
- Recursion
- Dynamic Programming
- Object-Oriented Programming
- Design Patterns
- Combinatorics (n choose k) & Probability (@Ilyushin)
- NP, NP-Complete and Approximation Algorithms (@Ilyushin)
- Caches (@Ilyushin)
- Processes and Threads (@Ilyushin)
- Papers
- Testing (@g7tro4w)
- Scheduling (@g7tro4w)
- Implement system routines (@g7tro4w)
- String searching & manipulations (@g7tro4w)
- Tries (@g7tro4w)
- Floating Point Numbers (@g7tro4w)
- Unicode (@g7tro4w)
- Endianness (@g7tro4w)
- Networking (@g7tro4w)
- System Design, Scalability, Data Handling (if you have 4+ years experience) (@g7tro4w)
- Final Review (@mikhailusov)
- Coding Question Practice (@mikhailusov)
- Coding exercises/challenges (@mikhailusov)
- Once you're closer to the interview (@mikhailusov)
- Your Resume (@mikhailusov)
- Be thinking of for when the interview comes (@mikhailusov)
- Have questions for the interviewer (@mikhailusov)
- Once You've Got The Job (@mikhailusov)
- Additional Books (@Ilyushin)
- Additional Learning (@Ilyushin)
- Compilers (@Ilyushin)
- Emacs and vi(m)
- Unix command line tools
- Information theory
- Parity & Hamming Code
- Entropy
- Cryptography
- Compression
- Computer Security
- Garbage collection (@Ilyushin)
- Parallel Programming (@Ilyushin)
- Messaging, Serialization, and Queueing Systems
- A*
- Fast Fourier Transform
- Bloom Filter
- HyperLogLog
- Locality-Sensitive Hashing
- van Emde Boas Trees
- Augmented Data Structures
- 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
- k-D Trees
- Skip lists
- Network Flows
- Disjoint Sets & Union Find
- Math for Fast Processing
- Treap
- Linear Programming (@Ilyushin)
- Geometry, Convex hull
- Discrete math
- Machine Learning (@Ilyushin)
- Additional Detail on Some Subjects
- Video Series
- Computer Science Courses
egoroof, dublicator, xolvo, velimir, rozzy and 78 morekirillshevch, antonamana, azhukau-dev, commonlisper, jongleb and 5 moreimorte, commonlisper, Riko1, tengufromsky, BullSprite and 6 morehoopengo, Sempaku, krdprog and BIITBkrdprog