mirror of
https://github.com/jwasham/coding-interview-university.git
synced 2025-07-13 10:30:37 +08:00
Updated README-it..md
This commit is contained in:
Marco Marrelli
@ -136,106 +136,106 @@ software development/ruoli dell'engineering.
|
|||||||
- [Stack](#stack)
|
- [Stack](#stack)
|
||||||
- [Queue](#queue)
|
- [Queue](#queue)
|
||||||
- [Hash table](#hash-table)
|
- [Hash table](#hash-table)
|
||||||
- [Più Conoscenza](#more-knowledge)
|
- [Più Teoria](#more-knowledge)
|
||||||
- [Ricerca Binaria](#binary-search)
|
- [Ricerca Binaria](#binary-search)
|
||||||
- [Operazione Bit a Bit](#bitwise-operations)
|
- [Operazione Bit a Bit](#bitwise-operations)
|
||||||
- [Alberi](#trees)
|
- [Alberi (Trees)](#trees)
|
||||||
- [Alberi - Appunti & Background](#trees---notes--background)
|
- [Alberi - Appunti & Background](#trees---notes--background)
|
||||||
- [Alberi Binari di Ricerca: BSTs](#binary-search-trees-bsts)
|
- [Alberi Binari di Ricerca: BSTs](#binary-search-trees-bsts)
|
||||||
- [Heap (Mucchio) / Priority Queue (Coda di Priorità) / Heap Binario (Mucchio Binario)](#heap--priority-queue--binary-heap)
|
- [Heap (Mucchio) / Priority Queue (Coda di Priorità) / Heap Binario (Mucchio Binario)](#heap--priority-queue--binary-heap)
|
||||||
- Alberi di RIcerca Bilanciati (Concetti Generali)
|
- Alberi di RIcerca Bilanciati (Concetti Generali)
|
||||||
- traversals: preorder, inorder, postorder, BFS, DFS
|
- traversali: preorder, inorder, postorder, BFS (ricerca in ampiezza), DFS (ricerca in profondita)
|
||||||
- [Sorting](#sorting)
|
- [Sorting (Ordinamento)](#sorting)
|
||||||
- selection
|
- selection (per selezione)
|
||||||
- insertion
|
- insertion (per inserzione)
|
||||||
- heapsort
|
- heapsort
|
||||||
- quicksort
|
- quicksort
|
||||||
- merge sort
|
- merge sort
|
||||||
- [Graphs](#graphs)
|
- [Grafi (Graphs)](#graphs)
|
||||||
- directed
|
- directed (Orientati)
|
||||||
- undirected
|
- undirected (Non Orientati)
|
||||||
- adjacency matrix
|
- adjacency matrix (Matrice delle Adiacenze)
|
||||||
- adjacency list
|
- adjacency list (Lista delle Adiacenze)
|
||||||
- traversals: BFS, DFS
|
- trasversali: BFS (ricerca in ampiezza), DFS (ricerca in profondita)
|
||||||
- [Even More Knowledge](#even-more-knowledge)
|
- [Ancora Più Teoria](#even-more-knowledge)
|
||||||
- [Recursion](#recursion)
|
- [Ricorsione (Recursion)](#recursion)
|
||||||
- [Dynamic Programming](#dynamic-programming)
|
- [Programmazione Dinamica](#dynamic-programming)
|
||||||
- [Design Patterns](#design-patterns)
|
- [Schemi Progettuali (Design Patterns)](#design-patterns)
|
||||||
- [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
|
- [Calcolo Combinatorio (n sopra k) & Probabilità](#combinatorics-n-choose-k--probability)
|
||||||
- [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
|
- [NP, NP-Completo e Algoritmi di Approssimazione](#np-np-complete-and-approximation-algorithms)
|
||||||
- [How computers process a program](#how-computers-process-a-program)
|
- [Come i Computer Processano un Programma](#how-computers-process-a-program)
|
||||||
- [Caches](#caches)
|
- [Caches](#caches)
|
||||||
- [Processes and Threads](#processes-and-threads)
|
- [Processi e Threads](#processes-and-threads)
|
||||||
- [Testing](#testing)
|
- [Testing](#testing)
|
||||||
- [String searching & manipulations](#string-searching--manipulations)
|
- [Ricerca Tramite Pattern-Matching e Manipolazione delle Stringhe](#string-searching--manipulations)
|
||||||
- [Tries](#tries)
|
- [Tries](#tries)
|
||||||
- [Floating Point Numbers](#floating-point-numbers)
|
- [Numeri con Decimali](#floating-point-numbers)
|
||||||
- [Unicode](#unicode)
|
- [Unicode](#unicode)
|
||||||
- [Endianness](#endianness)
|
- [Ordine dei Byte (Endianness)](#endianness)
|
||||||
- [Networking](#networking)
|
- [Networking](#networking)
|
||||||
- [Final Review](#final-review)
|
- [Revisione Finale](#final-review)
|
||||||
|
|
||||||
### Getting the Job
|
### Ottenere il Lavoro
|
||||||
|
|
||||||
- [Update Your Resume](#update-your-resume)
|
- [Aggiorna il tuo Curriculum Vitae](#update-your-resume)
|
||||||
- [Find a Job](#find-a-job)
|
- [Trova un Lavoro](#find-a-job)
|
||||||
- [Interview Process & General Interview Prep](#interview-process--general-interview-prep)
|
- [Colloquio & Preparazione Generale](#interview-process--general-interview-prep)
|
||||||
- [Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes)
|
- [Ragiona Riguardo la Data del Colloquio](#be-thinking-of-for-when-the-interview-comes)
|
||||||
- [Have questions for the interviewer](#have-questions-for-the-interviewer)
|
- [Preparati Domande per l'Esaminatore](#have-questions-for-the-interviewer)
|
||||||
- [Once You've Got The Job](#once-youve-got-the-job)
|
- [Una Volta Ottenuto il Lavoro](#once-youve-got-the-job)
|
||||||
|
|
||||||
**---------------- Everything below this point is optional ----------------**
|
**---------------- Qua Sotto Sono Riportato Argomenti Facoltativi ----------------**
|
||||||
|
|
||||||
### Optional Extra Topics & Resources
|
### Argomenti Extra Opzionali & Risorse
|
||||||
|
|
||||||
- [Additional Books](#additional-books)
|
- [Libri Aggiuntivi](#additional-books)
|
||||||
- [System Design, Scalability, Data Handling](#system-design-scalability-data-handling) (if you have 4+ years experience)
|
- [System Design, Scalabilità, Gestione dei Dati](#system-design-scalability-data-handling) (Solo se hai più di 4+ anni di esperienza)
|
||||||
- [Additional Learning](#additional-learning)
|
- [Argomenti Aggiuntiva](#additional-learning)
|
||||||
- [Compilers](#compilers)
|
- [Compilatori](#compilers)
|
||||||
- [Emacs and vi(m)](#emacs-and-vim)
|
- [Emacs e vi(m)](#emacs-and-vim)
|
||||||
- [Unix command line tools](#unix-command-line-tools)
|
- [Tools per Linea di Comando Unix](#unix-command-line-tools)
|
||||||
- [Information theory](#information-theory-videos)
|
- [Teoria delle Informazioni](#information-theory-videos)
|
||||||
- [Parity & Hamming Code](#parity--hamming-code-videos)
|
- [Parità & Codice di Hamming](#parity--hamming-code-videos)
|
||||||
- [Entropy](#entropy)
|
- [Entropia](#entropy)
|
||||||
- [Cryptography](#cryptography)
|
- [Crittografia](#cryptography)
|
||||||
- [Compression](#compression)
|
- [Compressione](#compression)
|
||||||
- [Computer Security](#computer-security)
|
- [Sicurezza](#computer-security)
|
||||||
- [Garbage collection](#garbage-collection)
|
- [Garbage Collection](#garbage-collection)
|
||||||
- [Parallel Programming](#parallel-programming)
|
- [Programmazione Parallela](#parallel-programming)
|
||||||
- [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
|
- [Messaggistica, Serializzazione e Sistemi di Gestione della Coda (Queueing Systems)](#messaging-serialization-and-queueing-systems)
|
||||||
- [A*](#a)
|
- [A*](#a)
|
||||||
- [Fast Fourier Transform](#fast-fourier-transform)
|
- [Trasformata di Fourier Veloce](#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)
|
- [Alberi di Van Emde Boas](#van-emde-boas-trees)
|
||||||
- [Augmented Data Structures](#augmented-data-structures)
|
- [Strutture Dati Aumentate](#augmented-data-structures)
|
||||||
- [Balanced search trees](#balanced-search-trees)
|
- [Alberi di Ricerca Bilanciati](#balanced-search-trees)
|
||||||
- AVL trees
|
- Alberi AVL
|
||||||
- Splay trees
|
- Alberi Splay
|
||||||
- Red/black trees
|
- Alberi Rosso/Nero (Red/Black)
|
||||||
- 2-3 search trees
|
- Alberi di Ricerca 2-3
|
||||||
- 2-3-4 Trees (aka 2-4 trees)
|
- Alberi 2-3-4 (o Alberi 2-4)
|
||||||
- N-ary (K-ary, M-ary) trees
|
- Alberi N-ary (anche detti Alberi K-ary o Alberi M-ary)
|
||||||
- B-Trees
|
- Alberi B
|
||||||
- [k-D Trees](#k-d-trees)
|
- [Alberi k-D](#k-d-trees)
|
||||||
- [Skip lists](#skip-lists)
|
- [Skip lists](#skip-lists)
|
||||||
- [Network Flows](#network-flows)
|
- [Rete di Flussi](#network-flows)
|
||||||
- [Disjoint Sets & Union Find](#disjoint-sets--union-find)
|
- [Disgiunzione & Union Find (MFSET)](#disjoint-sets--union-find)
|
||||||
- [Math for Fast Processing](#math-for-fast-processing)
|
- [Matematica per la Processazione Veloce (Fast Processing)](#math-for-fast-processing)
|
||||||
- [Treap](#treap)
|
- [Treap](#treap)
|
||||||
- [Linear Programming](#linear-programming-videos)
|
- [Programmazione Lineare](#linear-programming-videos)
|
||||||
- [Geometry, Convex hull](#geometry-convex-hull-videos)
|
- [Geometria, Inviluppo Convesso](#geometry-convex-hull-videos)
|
||||||
- [Discrete math](#discrete-math)
|
- [Matematica Discreta](#discrete-math)
|
||||||
- [Machine Learning](#machine-learning)
|
- [Machine Learning](#machine-learning)
|
||||||
- [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
|
- [Dettagli Aggiuntivi per Alcuni Temi Trattati](#additional-detail-on-some-subjects)
|
||||||
- [Video Series](#video-series)
|
- [Video](#video-series)
|
||||||
- [Computer Science Courses](#computer-science-courses)
|
- [Corsi di Informatica](#computer-science-courses)
|
||||||
- [Papers](#papers)
|
- [Papers](#papers)
|
||||||
|
|
||||||
---
|
---
|
||||||
|
|
||||||
## Why use it?
|
## Perché usarlo?
|
||||||
|
|
||||||
If you want to work as a software engineer for a large company, these are the things you have to know.
|
If you want to work as a software engineer for a large company, these are the things you have to know.
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user