algorithm/coding-interview-university
1
0
Fork 0
mirror of https://github.com/jwasham/coding-interview-university.git synced 2025-07-07 22:41:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update README-it.md

Browse Source
This commit is contained in:
Marco Marrelli
2022-05-20 13:27:09 +02:00
committed by GitHub
parent 5ef358ea73
commit b70ec933e6
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
translations/README-it.md
View File

@ -1050,10 +1050,10 @@ I grafi possono essere usati per rappresentare molti problemi in informatica, pe
- [ ] [Make School: Probability (Video in Inglese)](https://www.youtube.com/watch?v=sZkAAk9Wwa4) - [ ] [Make School: Probability (Video in Inglese)](https://www.youtube.com/watch?v=sZkAAk9Wwa4)
- [ ] [Make School: More Probability and Markov Chains (Video in Inglese)](https://www.youtube.com/watch?v=dNaJg-mLobQ) - [ ] [Make School: More Probability and Markov Chains (Video in Inglese)](https://www.youtube.com/watch?v=dNaJg-mLobQ)
- [ ] Khan Academy: - [ ] Khan Academy:
- Course layout: - Corso:
- [ ] [Basic Theoretical Probability](https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic) - [ ] [Teoria della Probabilità Basica](https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic)
- Just the video - 41 (each are simple and each are short): - Just the video - 41 (each are simple and each are short):
- [ ] [Probability Explained (Video in Inglese)](https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19) - [ ] [Spiegazione della Probabilità (Video in Inglese)](https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19)
- ### NP, NP-Completo e Algoritmi di Approssimazione - ### NP, NP-Completo e Algoritmi di Approssimazione
- Know about the most famous classes of NP-complete problems, such as traveling salesman and the knapsack problem, - Know about the most famous classes of NP-complete problems, such as traveling salesman and the knapsack problem,