Added README-el.md under translations/
This commit is contained in:
amoraitis
parent
8cea501144
commit
24653db1ac
135
translations/README-el.md
Normal file
135
translations/README-el.md
Normal file
@ -0,0 +1,135 @@
|
|||||||
|
#Coding Interview University
|
||||||
|
|
||||||
|
>Επίσημη έκδοση: [Αγγλικά](https://github.com/jwasham/coding-interview-university/blob/master/README.md)
|
||||||
|
|
||||||
|
## Τι είναι;
|
||||||
|
|
||||||
|
Είναi ο πλάνο διαβάσματός μου για να γίνω από web developer (αυτοδίδακτος, χωρίς πτυχίο στην Επιστήμη των Υπολογιστών), μηχανικός λογισμικού για μία μεγάλη εταιρία.
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
Αυτό το έργο προορίζεται για νέους μηχανικούς λογισμικού ή για αυτούς που μεταβαίνουν από την ανάπτυξη λογισμικού/ιστοσελίδων στην τεχνολογία λογισμικού(εκεί που η γνώση για την επιστήμη των υπολογιστών ειναι προαπαιτούμενο). Αν έχεις αρκετά χρόνια εμπειρίας και αξιώνεις πολλά χρόνια εμπερίας στην τεχνολογία λογισμικού, πρέπει να περιμένεις μία δυσκολότερη συνέντευξη.
|
||||||
|
|
||||||
|
Εάν έχεις αρκετά χρόνια εμπειρίας στην ανάπτυξη λογισμικού/ιστοσελίδων, σημείωσε ότι οι μεγάλες εταιρίες λογισμικού όπως οι Google, Amazon, Facebook και Microsoft βλέπουν την τεχνολογία λογισμικού ως ενα διαφορετικό κομμάτι από την ανάπτυξη λογισμικού/ιστοσελίδων, και απαιτούν γνώσεις πάνω στην επιστήμη υπολογιστών.
|
||||||
|
|
||||||
|
Εάν θέλεις να είσαι ένας αξιόπιστος μηχανικός ή μηχανικός συστημάτων, διάβασε περισσότερο απο την προεραιτική λίστα(δίκτυα, ασφάλεια).
|
||||||
|
|
||||||
|
---
|
||||||
|
# Πίνακας περιεχομένων
|
||||||
|
|
||||||
|
- [Τι είναι;](#τι-είναι)
|
||||||
|
- [Why use it?](#why-use-it)
|
||||||
|
- [How to use it](#how-to-use-it)
|
||||||
|
- [Don't feel you aren't smart enough](#dont-feel-you-arent-smart-enough)
|
||||||
|
- [About Video Resources](#about-video-resources)
|
||||||
|
- [Interview Process & General Interview Prep](#interview-process--general-interview-prep)
|
||||||
|
- [Pick One Language for the Interview](#pick-one-language-for-the-interview)
|
||||||
|
- [Book List](#book-list)
|
||||||
|
- [Before you Get Started](#before-you-get-started)
|
||||||
|
- [What you Won't See Covered](#what-you-wont-see-covered)
|
||||||
|
- [Prerequisite Knowledge](#prerequisite-knowledge)
|
||||||
|
- [The Daily Plan](#the-daily-plan)
|
||||||
|
- [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
|
||||||
|
- [Data Structures](#data-structures)
|
||||||
|
- [Arrays](#arrays)
|
||||||
|
- [Linked Lists](#linked-lists)
|
||||||
|
- [Stack](#stack)
|
||||||
|
- [Queue](#queue)
|
||||||
|
- [Hash table](#hash-table)
|
||||||
|
- [More Knowledge](#more-knowledge)
|
||||||
|
- [Binary search](#binary-search)
|
||||||
|
- [Bitwise operations](#bitwise-operations)
|
||||||
|
- [Trees](#trees)
|
||||||
|
- [Trees - Notes & Background](#trees---notes--background)
|
||||||
|
- [Binary search trees: BSTs](#binary-search-trees-bsts)
|
||||||
|
- [Heap / Priority Queue / Binary Heap](#heap--priority-queue--binary-heap)
|
||||||
|
- balanced search trees (general concept, not details)
|
||||||
|
- traversals: preorder, inorder, postorder, BFS, DFS
|
||||||
|
- [Sorting](#sorting)
|
||||||
|
- selection
|
||||||
|
- insertion
|
||||||
|
- heapsort
|
||||||
|
- quicksort
|
||||||
|
- merge sort
|
||||||
|
- [Graphs](#graphs)
|
||||||
|
- directed
|
||||||
|
- undirected
|
||||||
|
- adjacency matrix
|
||||||
|
- adjacency list
|
||||||
|
- traversals: BFS, DFS
|
||||||
|
- [Even More Knowledge](#even-more-knowledge)
|
||||||
|
- [Recursion](#recursion)
|
||||||
|
- [Dynamic Programming](#dynamic-programming)
|
||||||
|
- [Object-Oriented Programming](#object-oriented-programming)
|
||||||
|
- [Design Patterns](#design-patterns)
|
||||||
|
- [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
|
||||||
|
- [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
|
||||||
|
- [Caches](#caches)
|
||||||
|
- [Processes and Threads](#processes-and-threads)
|
||||||
|
- [Papers](#papers)
|
||||||
|
- [Testing](#testing)
|
||||||
|
- [Scheduling](#scheduling)
|
||||||
|
- [Implement system routines](#implement-system-routines)
|
||||||
|
- [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)
|
||||||
|
- [Final Review](#final-review)
|
||||||
|
- [Coding Question Practice](#coding-question-practice)
|
||||||
|
- [Coding exercises/challenges](#coding-exerciseschallenges)
|
||||||
|
- [Once you're closer to the interview](#once-youre-closer-to-the-interview)
|
||||||
|
- [Your Resume](#your-resume)
|
||||||
|
- [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)
|
||||||
|
- [Once You've Got The Job](#once-youve-got-the-job)
|
||||||
|
|
||||||
|
---------------- Everything below this point is optional ----------------
|
||||||
|
|
||||||
|
- [Additional Books](#additional-books)
|
||||||
|
- [Additional Learning](#additional-learning)
|
||||||
|
- [Compilers](#compilers)
|
||||||
|
- [Emacs and vi(m)](#emacs-and-vim)
|
||||||
|
- [Unix command line tools](#unix-command-line-tools)
|
||||||
|
- [Information theory](#information-theory)
|
||||||
|
- [Parity & Hamming Code](#parity--hamming-code)
|
||||||
|
- [Entropy](#entropy)
|
||||||
|
- [Cryptography](#cryptography)
|
||||||
|
- [Compression](#compression)
|
||||||
|
- [Computer Security](#computer-security)
|
||||||
|
- [Garbage collection](#garbage-collection)
|
||||||
|
- [Parallel Programming](#parallel-programming)
|
||||||
|
- [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
|
||||||
|
- [A*](#a)
|
||||||
|
- [Fast Fourier Transform](#fast-fourier-transform)
|
||||||
|
- [Bloom Filter](#bloom-filter)
|
||||||
|
- [HyperLogLog](#hyperloglog)
|
||||||
|
- [Locality-Sensitive Hashing](#locality-sensitive-hashing)
|
||||||
|
- [van Emde Boas Trees](#van-emde-boas-trees)
|
||||||
|
- [Augmented Data Structures](#augmented-data-structures)
|
||||||
|
- [N-ary (K-ary, M-ary) trees](#n-ary-k-ary-m-ary-trees)
|
||||||
|
- [Balanced search 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
|
||||||
|
- [k-D Trees](#k-d-trees)
|
||||||
|
- [Skip lists](#skip-lists)
|
||||||
|
- [Network Flows](#network-flows)
|
||||||
|
- [Disjoint Sets & Union Find](#disjoint-sets--union-find)
|
||||||
|
- [Math for Fast Processing](#math-for-fast-processing)
|
||||||
|
- [Treap](#treap)
|
||||||
|
- [Linear Programming](#linear-programming)
|
||||||
|
- [Geometry, Convex hull](#geometry-convex-hull)
|
||||||
|
- [Discrete math](#discrete-math)
|
||||||
|
- [Machine Learning](#machine-learning)
|
||||||
|
- [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
|
||||||
|
- [Video Series](#video-series)
|
||||||
|
- [Computer Science Courses](#computer-science-courses)
|
||||||
|
|
||||||
|
---
|
||||||
Loading…
x
Reference in New Issue
Block a user