mirror of
https://github.com/jwasham/coding-interview-university.git
synced 2025-07-08 06:51:18 +08:00
update the Table of Contents section
This commit is contained in:
Ali M. Khadir
@ -115,7 +115,7 @@
|
|||||||
- [ما هذا؟](#ما-هذا)
|
- [ما هذا؟](#ما-هذا)
|
||||||
- [لماذا استخدم هذه الخطة الدراسية؟](#لماذا-استخدم-هذه-الخطة-الدراسية)
|
- [لماذا استخدم هذه الخطة الدراسية؟](#لماذا-استخدم-هذه-الخطة-الدراسية)
|
||||||
- [كيفية استخدامها](#كيفية-استخدامها)
|
- [كيفية استخدامها](#كيفية-استخدامها)
|
||||||
- [عن مصادر مقاطع الفديو](#عن-مصادر-مقاطع-الفديو)
|
- [عن مصادر مقاطع الفيديو](#عن-مصادر-مقاطع-الفديو)
|
||||||
- [مراحل المقابلة الشخصية & الإستعداد العام للمقابلة](#مراحل-المقابلة-الشخصية-و-الإستعداد-العام-للمقابلة)
|
- [مراحل المقابلة الشخصية & الإستعداد العام للمقابلة](#مراحل-المقابلة-الشخصية-و-الإستعداد-العام-للمقابلة)
|
||||||
- [اختر لغة برمجية واحدة للمقابلة البرمجية](#اختر-لغة-برمجية-واحدة-للمقابلة-البرمجية)
|
- [اختر لغة برمجية واحدة للمقابلة البرمجية](#اختر-لغة-برمجية-واحدة-للمقابلة-البرمجية)
|
||||||
- [لائحة الكتب](#لائحة-الكتب)
|
- [لائحة الكتب](#لائحة-الكتب)
|
||||||
@ -135,98 +135,96 @@
|
|||||||
- [الـ Bitwise operations](#bitwise-operations)
|
- [الـ Bitwise operations](#bitwise-operations)
|
||||||
- [الشجرة (Trees)](#trees)
|
- [الشجرة (Trees)](#trees)
|
||||||
- [الشجرة - ملاحظات - ومعلومات اساسية (Trees - Notes & Background)](#trees---notes--background)
|
- [الشجرة - ملاحظات - ومعلومات اساسية (Trees - Notes & Background)](#trees---notes--background)
|
||||||
- [Binary search trees: BSTs](#binary-search-trees-bsts)
|
- [الـ Binary search trees: BSTs](#binary-search-trees-bsts)
|
||||||
- [Heap / Priority Queue / Binary Heap](#heap--priority-queue--binary-heap)
|
- [الـ Heap / Priority Queue / Binary Heap](#heap--priority-queue--binary-heap)
|
||||||
- balanced search trees (general concept, not details)
|
- الـ balanced search trees (general concept, not details)
|
||||||
- traversals: preorder, inorder, postorder, BFS, DFS
|
- الـ traversals: preorder, inorder, postorder, BFS, DFS
|
||||||
- [Sorting](#sorting)
|
- [الـ Sorting](#sorting)
|
||||||
- selection
|
- الـ selection
|
||||||
- insertion
|
- الـ insertion
|
||||||
- heapsort
|
- الـ heapsort
|
||||||
- quicksort
|
- الـ quicksort
|
||||||
- merge sort
|
- الـ merge sort
|
||||||
- [Graphs](#graphs)
|
- [الـ Graphs](#graphs)
|
||||||
- directed
|
- الـ directed
|
||||||
- undirected
|
- الـ undirected
|
||||||
- adjacency matrix
|
- الـ adjacency matrix
|
||||||
- adjacency list
|
- الـ adjacency list
|
||||||
- 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)
|
- [الـ 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)
|
||||||
- [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
|
- [الـ NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
|
||||||
- [Caches](#caches)
|
- [الـ Caches](#caches)
|
||||||
- [Processes and Threads](#processes-and-threads)
|
- [الـ Processes and Threads](#processes-and-threads)
|
||||||
- [Testing](#testing)
|
- [الـ Testing](#testing)
|
||||||
- [Scheduling](#scheduling)
|
- [الـ Scheduling](#scheduling)
|
||||||
- [String searching & manipulations](#string-searching--manipulations)
|
- [الـ String searching & manipulations](#string-searching--manipulations)
|
||||||
- [Tries](#tries)
|
- [الـ Tries](#tries)
|
||||||
- [Floating Point Numbers](#floating-point-numbers)
|
- [الـ Floating Point Numbers](#floating-point-numbers)
|
||||||
- [Unicode](#unicode)
|
- [الـ Unicode](#unicode)
|
||||||
- [Endianness](#endianness)
|
- [الـ Endianness](#endianness)
|
||||||
- [Networking](#networking)
|
- [الـ 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)
|
||||||
- [Coding exercises/challenges](#coding-exerciseschallenges)
|
- [الـ Coding exercises/challenges](#coding-exerciseschallenges)
|
||||||
- [Once you're closer to the interview](#once-youre-closer-to-the-interview)
|
- [الـ Once you're closer to the interview](#once-youre-closer-to-the-interview)
|
||||||
- [Your Resume](#your-resume)
|
- [الـ Your Resume](#your-resume)
|
||||||
- [Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes)
|
- [الـ Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes)
|
||||||
- [Have questions for the interviewer](#have-questions-for-the-interviewer)
|
- [الـ Have questions for the interviewer](#have-questions-for-the-interviewer)
|
||||||
- [Once You've Got The Job](#once-youve-got-the-job)
|
- [الـ Once You've Got The Job](#once-youve-got-the-job)
|
||||||
|
|
||||||
---------------- Everything below this point is optional ----------------
|
|
||||||
|
|
||||||
## Additional Resources
|
## Additional Resources
|
||||||
|
|
||||||
- [Additional Books](#additional-books)
|
- [الـ Additional Books](#additional-books)
|
||||||
- [Additional Learning](#additional-learning)
|
- [الـ Additional Learning](#additional-learning)
|
||||||
- [Compilers](#compilers)
|
- [الـ Compilers](#compilers)
|
||||||
- [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-videos)
|
- [الـ Information theory](#information-theory-videos)
|
||||||
- [Parity & Hamming Code](#parity--hamming-code-videos)
|
- [الـ Parity & Hamming Code](#parity--hamming-code-videos)
|
||||||
- [Entropy](#entropy)
|
- [الـ Entropy](#entropy)
|
||||||
- [Cryptography](#cryptography)
|
- [الـ Cryptography](#cryptography)
|
||||||
- [Compression](#compression)
|
- [الـ Compression](#compression)
|
||||||
- [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)
|
- [الـ 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)
|
||||||
- [Balanced search trees](#balanced-search-trees)
|
- [الـ Balanced search trees](#balanced-search-trees)
|
||||||
- AVL trees
|
- الـ AVL trees
|
||||||
- Splay trees
|
- الـ Splay trees
|
||||||
- Red/black trees
|
- الـ Red/black trees
|
||||||
- 2-3 search trees
|
- الـ 2-3 search trees
|
||||||
- 2-3-4 Trees (aka 2-4 trees)
|
- الـ 2-3-4 Trees (aka 2-4 trees)
|
||||||
- N-ary (K-ary, M-ary) trees
|
- الـ N-ary (K-ary, M-ary) trees
|
||||||
- B-Trees
|
- الـ B-Trees
|
||||||
- [k-D Trees](#k-d-trees)
|
- [الـ k-D Trees](#k-d-trees)
|
||||||
- [Skip lists](#skip-lists)
|
- [الـ Skip lists](#skip-lists)
|
||||||
- [Network Flows](#network-flows)
|
- [الـ Network Flows](#network-flows)
|
||||||
- [Disjoint Sets & Union Find](#disjoint-sets--union-find)
|
- [الـ Disjoint Sets & Union Find](#disjoint-sets--union-find)
|
||||||
- [Math for Fast Processing](#math-for-fast-processing)
|
- [الـ Math for Fast Processing](#math-for-fast-processing)
|
||||||
- [Treap](#treap)
|
- [الـ Treap](#treap)
|
||||||
- [Linear Programming](#linear-programming-videos)
|
- [الـ Linear Programming](#linear-programming-videos)
|
||||||
- [Geometry, Convex hull](#geometry-convex-hull-videos)
|
- [الـ Geometry, Convex hull](#geometry-convex-hull-videos)
|
||||||
- [Discrete math](#discrete-math)
|
- [الـ Discrete math](#discrete-math)
|
||||||
- [Machine Learning](#machine-learning)
|
- [الـ Machine Learning](#machine-learning)
|
||||||
- [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)
|
||||||
- [Papers](#papers)
|
- [الـ Papers](#papers)
|
||||||
|
|
||||||
---
|
|
||||||
|
|
||||||
|
|
||||||
</div>
|
</div>
|
||||||
|
|||||||
Reference in New Issue
Block a user