Fix incorrect references to master branch
This commit is contained in:
Isaac Moore
parent
6d5c03c20b
commit
caef61d6e3
10
README.md
10
README.md
|
|
@ -222,7 +222,7 @@ Fork the GitHub repo https://github.com/jwasham/coding-interview-university by c
|
|||
|
||||
`git commit -m "Marked x"`
|
||||
|
||||
`git rebase jwasham/master`
|
||||
`git rebase jwasham/main`
|
||||
|
||||
`git push --set-upstream origin progress`
|
||||
|
||||
|
|
@ -393,8 +393,8 @@ I made a mobile-first website, so I could review on my phone and tablet, whereve
|
|||
Make your own for free:
|
||||
|
||||
- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
Keep in mind I went overboard and have cards covering everything from assembly language and Python trivia to machine learning and statistics. It's way too much for what's required.
|
||||
|
||||
|
|
@ -631,7 +631,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Good intro:
|
||||
|
|
@ -1196,7 +1196,7 @@ Graphs can be used to represent many problems in computer science, so this secti
|
|||
- [ ] Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:
|
||||
- review: [The System Design Primer](https://github.com/donnemartin/system-design-primer)
|
||||
- [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- flow:
|
||||
1. Understand the problem and scope:
|
||||
- Define the use cases, with interviewer's help
|
||||
|
|
|
|||
|
|
@ -1,7 +1,7 @@
|
|||
## Programming Language Resources
|
||||
|
||||
- C
|
||||
- [ANSI C Cheat Sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/C%20Reference%20Card%20(ANSI)%202.2.pdf)
|
||||
- [ANSI C Cheat Sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/C%20Reference%20Card%20(ANSI)%202.2.pdf)
|
||||
- K&R C book (ANSI C)
|
||||
- [Make, Clang (video)](https://www.youtube.com/watch?v=U3zCxnj2w8M)
|
||||
- GDB:
|
||||
|
|
@ -10,8 +10,8 @@
|
|||
- [Valgrind (video)](https://www.youtube.com/watch?v=fvTsFjDuag8)
|
||||
- [Let us C](https://books.google.co.in/books/about/Let_Us_C.html?id=7HrjAAAACAAJ)
|
||||
- C++
|
||||
- [C++ Cheat Sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/Cpp_reference.pdf)
|
||||
- [STL Cheat Sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/STL%20Quick%20Reference%201.29.pdf)
|
||||
- [C++ Cheat Sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/Cpp_reference.pdf)
|
||||
- [STL Cheat Sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/STL%20Quick%20Reference%201.29.pdf)
|
||||
- [basics](https://www.tutorialspoint.com/cplusplus/cpp_basic_syntax.htm)
|
||||
- [pointers](https://www.cprogramming.com/tutorial/lesson6.html)
|
||||
- [class and object](https://www.cprogramming.com/tutorial/lesson12.html)
|
||||
|
|
@ -32,7 +32,7 @@
|
|||
- [Let us C++](https://books.google.co.in/books/about/Let_Us_C++.html?id=6HrjAAAACAAJ)
|
||||
- [C++ Primer](https://books.google.co.in/books/about/C++_Primer.html?id=J1HMLyxqJfgC&redir_esc=y)
|
||||
- Python
|
||||
- [Python Cheat Sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/python-cheat-sheet-v1.pdf)
|
||||
- [Python Cheat Sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/python-cheat-sheet-v1.pdf)
|
||||
- [Python in One Video](https://www.youtube.com/watch?v=N4mEzFDjqtA)
|
||||
- [Series on 3.4 (video)](https://www.youtube.com/playlist?list=PL6gx4Cwl9DGAcbMi1sH6oAMk4JHw91mC_)
|
||||
- [Statistics for Hackers (video)](https://www.youtube.com/watch?v=Iq9DzN6mvYA)
|
||||
|
|
|
|||
|
|
@ -212,7 +212,7 @@
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -220,9 +220,9 @@
|
|||
|
||||
## الدخول في مزاج جوجلي
|
||||
|
||||
Print out a "[future Googler](https://github.com/jwasham/coding-interview-university/blob/master/extras/future-googler.pdf)" sign (or two) and keep your eyes on the prize.
|
||||
Print out a "[future Googler](https://github.com/jwasham/coding-interview-university/blob/main/extras/future-googler.pdf)" sign (or two) and keep your eyes on the prize.
|
||||
|
||||
[](https://github.com/jwasham/coding-interview-university/blob/master/extras/future-googler.pdf)
|
||||
[](https://github.com/jwasham/coding-interview-university/blob/main/extras/future-googler.pdf)
|
||||
|
||||
|
||||
## هل حصلت على الوظيفة بجوجل؟
|
||||
|
|
@ -503,8 +503,8 @@ OR:
|
|||
اصنع واحدا منها لك مجانا:
|
||||
|
||||
- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
Keep in mind I went overboard and have cards covering everything from assembly language and Python trivia to machine learning and statistics. It's way too much for what's required by Google.
|
||||
|
||||
|
|
@ -740,7 +740,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Good intro:
|
||||
|
|
@ -1314,7 +1314,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- For even more, see "Mining Massive Datasets" video series in the Video Series section.
|
||||
- [ ] Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:
|
||||
- review: [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- flow:
|
||||
1. Understand the problem and scope:
|
||||
- define the use cases, with interviewer's help
|
||||
|
|
|
|||
Binary file not shown.
|
|
@ -171,7 +171,7 @@
|
|||
|
||||
`git commit -m "Marked x"`
|
||||
|
||||
`git rebase jwasham/master`
|
||||
`git rebase jwasham/main`
|
||||
|
||||
`git push --set-upstream origin progress`
|
||||
|
||||
|
|
@ -274,7 +274,7 @@
|
|||
|
||||
如果你通读其中之一，你应该具备了开始解决编程问题所需的所有数据结构和算法知识。除非你需要复习，否则**你可以跳过此项目中的所有视频讲座**。
|
||||
|
||||
[额外编程语言的精选资源](https://github.com/jwasham/coding-interview-university/blob/master/programming-language-resources.md)
|
||||
[额外编程语言的精选资源](https://github.com/jwasham/coding-interview-university/blob/main/programming-language-resources.md)
|
||||
|
||||
### C++
|
||||
|
||||
|
|
@ -336,8 +336,8 @@
|
|||
你也可以免费制作属于你自己的抽认卡网站：
|
||||
|
||||
- [抽认卡页面的代码仓库](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [我的抽认卡数据库 ── 旧 1200 张](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db)
|
||||
- [我的抽认卡数据库 ── 新 1800 张](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db)
|
||||
- [我的抽认卡数据库 ── 旧 1200 张](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db)
|
||||
- [我的抽认卡数据库 ── 新 1800 张](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db)
|
||||
|
||||
有一点需要记住的是，我做事有点过头，以至于卡片都覆盖到所有的东西上，从汇编语言和 Python 的细枝末节，到机器学习和统计都被覆盖到卡片上。而这种做法，对于要求来说是多余的。
|
||||
|
||||
|
|
@ -569,7 +569,7 @@
|
|||
- 迭代式二分查找
|
||||
|
||||
- ### 按位运算（Bitwise operations）
|
||||
- [ ] [Bits 速查表](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) ── 你需要知道大量2的幂数值（从2^1 到 2^16 及 2^32）
|
||||
- [ ] [Bits 速查表](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) ── 你需要知道大量2的幂数值（从2^1 到 2^16 及 2^32）
|
||||
- [ ] 好好理解位操作符的含义：&、|、^、~、>>、<<
|
||||
- [ ] [字码（words）](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] 好的介绍：
|
||||
|
|
@ -1128,7 +1128,7 @@
|
|||
- [ ] 系统设计问题练习：下面有一些指导原则，每一个都有相关文档以及在现实中该如何处理。
|
||||
- 复习: [系统设计入门](https://github.com/donnemartin/system-design-primer)
|
||||
- [HiredInTech 的系统设计](http://www.hiredintech.com/system-design/)
|
||||
- [备忘单](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [备忘单](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- 流程:
|
||||
1. 理解问题和范围:
|
||||
- 在面试官的帮助下定义用例
|
||||
|
|
@ -1876,4 +1876,4 @@
|
|||
|
||||
## LICENSE
|
||||
|
||||
[CC-BY-SA-4.0](https://github.com/jwasham/coding-interview-university/blob/master/LICENSE.txt)
|
||||
[CC-BY-SA-4.0](https://github.com/jwasham/coding-interview-university/blob/main/LICENSE.txt)
|
||||
|
|
|
|||
|
|
@ -225,7 +225,7 @@ Ich benutze GitHub's spezielle Version von Markdown, das beinhält Aufgabenliste
|
|||
|
||||
`git commit -m "Marked x"`
|
||||
|
||||
`git rebase jwasham/master`
|
||||
`git rebase jwasham/main`
|
||||
|
||||
`git push --force`
|
||||
|
||||
|
|
@ -433,8 +433,8 @@ Ich habe eine mobile-first Webseite gemacht, damit ich auf meinen Smartphone ode
|
|||
Erstell kostenlos deine eigenen Lernkarten:
|
||||
|
||||
- [Lernkarten-Webseiten Repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [Meine Lernkarten Databank (alt - 1200 Karten)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [Meine Lernkarten Databank (neu - 1800 Karten)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [Meine Lernkarten Databank (alt - 1200 Karten)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [Meine Lernkarten Databank (neu - 1800 Karten)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
Achtung, ich habe es übertrieben und Lernkarten über alles erstellt, von Assembly und Python Trivia bis hin zu Machine Learning und Statistik. Das ist viel mehr als eigentlich notwendig.
|
||||
|
||||
|
|
@ -693,7 +693,7 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
- Binärsuche mittels Rekursion
|
||||
|
||||
- ### Bitweise Operationen
|
||||
- [ ] [Bits Spickzettel](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - man sollte viele der Zweierpotenzen kennen (von 2^1 über 2^16 und 2^32)
|
||||
- [ ] [Bits Spickzettel](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - man sollte viele der Zweierpotenzen kennen (von 2^1 über 2^16 und 2^32)
|
||||
- [ ] Erhalte sehr gutes Verständnis Bits zu manipulieren mit: &, |, ^, ~, >>, <<
|
||||
- [ ] [Wörter](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Gute Einführung:
|
||||
|
|
@ -1308,7 +1308,7 @@ Graphen können genutzt werden, um damit viele verschiedene Probleme in der Info
|
|||
- [ ] Übe den Prozess des Systementwurfs: Hier sind ein paar Ideen, die man auf Papier durchspielen kann, jede mit einer Dokumentation wie es in der echten Welt umgesetzt wurde:
|
||||
- Review: [The System Design Primer](https://github.com/donnemartin/system-design-primer)
|
||||
- [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [Spickzettel](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [Spickzettel](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- Ablauf:
|
||||
1. Verstehe das Problem und den Umfang:
|
||||
- definiere den Anwendungsfall, was dem Interviewer helfen wird
|
||||
|
|
|
|||
|
|
@ -199,7 +199,7 @@ Estoy usando el tema especial de markdown de Github, incluyendo listas de tareas
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -406,8 +406,8 @@ Hice un sitio adaptado a moviles para revisarlo en mi celular y en mi Tablet, do
|
|||
Haga el suyo gratis:
|
||||
|
||||
- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
Tenga en cuenta que empecé desde abajo y hay tarjetas que cubren todo, desde el lenguaje ensamblador y la trivia Python al Machine Learning y estadísticas. Es demasiado para lo que se requiere.
|
||||
|
||||
|
|
@ -636,7 +636,7 @@ Escriba código en un pizarrón o en papel no en la computadora. Pruebe con algu
|
|||
- Búsqueda binaria usando recursión
|
||||
|
||||
- ### Operaciones bit a bit
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - Debería conocer varias de las potencias de 2 a partir de (2^1 to 2^16 and 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - Debería conocer varias de las potencias de 2 a partir de (2^1 to 2^16 and 2^32)
|
||||
- [ ] Obtenga un buen entendimiento de la manipulación de bits con: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Buena introducción:
|
||||
|
|
@ -1254,7 +1254,7 @@ Obtendrá más práctica de grafos en el libro de Skiena (vea Sección de libros
|
|||
- [ ] Practicando el proceso de diseño del sistema: Aquí hay algunas ideas para tratar de trabajar en papel, cada una con cierta documentación sobre cómo se manejó en el mundo real:
|
||||
- Revisión: [The System Design Primer](https://github.com/donnemartin/system-design-primer)
|
||||
- [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- Flujo:
|
||||
1. Comprender el problema y el alcance:
|
||||
- Definir los casos de uso, con ayuda del entrevistador
|
||||
|
|
|
|||
|
|
@ -188,7 +188,7 @@ I'm using Github's special markdown flavor, including tasks lists to check progr
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -196,9 +196,9 @@ I'm using Github's special markdown flavor, including tasks lists to check progr
|
|||
|
||||
## Get in a Googley Mood
|
||||
|
||||
Print out a "[future Googler](https://github.com/jwasham/coding-interview-university/blob/master/extras/future-googler.pdf)" sign (or two) and keep your eyes on the prize.
|
||||
Print out a "[future Googler](https://github.com/jwasham/coding-interview-university/blob/main/extras/future-googler.pdf)" sign (or two) and keep your eyes on the prize.
|
||||
|
||||
[](https://github.com/jwasham/coding-interview-university/blob/master/extras/future-googler.pdf)
|
||||
[](https://github.com/jwasham/coding-interview-university/blob/main/extras/future-googler.pdf)
|
||||
|
||||
## Did I Get the Job?
|
||||
|
||||
|
|
@ -469,7 +469,7 @@ I made a mobile-first website so I could review on my phone and tablet, wherever
|
|||
Make your own for free:
|
||||
|
||||
- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [My flash cards database](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db): Keep in mind I went overboard and have cards covering everything from assembly language and Python trivia to machine learning and statistics. It's way too much for what's required by Google.
|
||||
- [My flash cards database](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db): Keep in mind I went overboard and have cards covering everything from assembly language and Python trivia to machine learning and statistics. It's way too much for what's required by Google.
|
||||
|
||||
**Note on flashcards:** The first time you recognize you know the answer, don't mark it as known. You have to see the
|
||||
same card and answer it several times correctly before you really know it. Repetition will put that knowledge deeper in
|
||||
|
|
@ -703,7 +703,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Good intro:
|
||||
|
|
@ -1247,7 +1247,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- For even more, see "Mining Massive Datasets" video series in the Video Series section.
|
||||
- [ ] Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:
|
||||
- review: [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- flow:
|
||||
1. Understand the problem and scope:
|
||||
- define the use cases, with interviewer's help
|
||||
|
|
|
|||
|
|
@ -182,7 +182,7 @@ I'm using Github's special markdown flavor, including tasks lists to check progr
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -190,9 +190,9 @@ I'm using Github's special markdown flavor, including tasks lists to check progr
|
|||
|
||||
## Get in a Googley Mood
|
||||
|
||||
Print out a "[future Googler](https://github.com/jwasham/coding-interview-university/blob/master/extras/future-googler.pdf)" sign (or two) and keep your eyes on the prize.
|
||||
Print out a "[future Googler](https://github.com/jwasham/coding-interview-university/blob/main/extras/future-googler.pdf)" sign (or two) and keep your eyes on the prize.
|
||||
|
||||
[](https://github.com/jwasham/coding-interview-university/blob/master/extras/future-googler.pdf)
|
||||
[](https://github.com/jwasham/coding-interview-university/blob/main/extras/future-googler.pdf)
|
||||
|
||||
## האם קיבלתי את העבודה?
|
||||
|
||||
|
|
@ -463,7 +463,7 @@ I made a mobile-first website so I could review on my phone and tablet, wherever
|
|||
Make your own for free:
|
||||
|
||||
- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [My flash cards database](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db): Keep in mind I went overboard and have cards covering everything from assembly language and Python trivia to machine learning and statistics. It's way too much for what's required by Google.
|
||||
- [My flash cards database](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db): Keep in mind I went overboard and have cards covering everything from assembly language and Python trivia to machine learning and statistics. It's way too much for what's required by Google.
|
||||
|
||||
**Note on flashcards:** The first time you recognize you know the answer, don't mark it as known. You have to see the
|
||||
same card and answer it several times correctly before you really know it. Repetition will put that knowledge deeper in
|
||||
|
|
@ -697,7 +697,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Good intro:
|
||||
|
|
@ -1241,7 +1241,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- For even more, see "Mining Massive Datasets" video series in the Video Series section.
|
||||
- [ ] Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:
|
||||
- review: [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- flow:
|
||||
1. Understand the problem and scope:
|
||||
- define the use cases, with interviewer's help
|
||||
|
|
|
|||
|
|
@ -312,8 +312,8 @@ memory" का एरर न दे, और तब मुझे कोई वै
|
|||
|
||||
अपना खुद का मुफ्त बनाएं:
|
||||
- [फ़्लैशकार्ड साइट रेपो] (https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [मेरे फ़्लैश कार्ड डेटाबेस (पुराने - 1200 कार्ड) :](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db)
|
||||
- [मेरा फ़्लैश कार्ड डेटाबेस (नया - 1800 कार्ड) :](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db)
|
||||
- [मेरे फ़्लैश कार्ड डेटाबेस (पुराने - 1200 कार्ड) :](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db)
|
||||
- [मेरा फ़्लैश कार्ड डेटाबेस (नया - 1800 कार्ड) :](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db)
|
||||
|
||||
ध्यान रखें मैं जहाज़ के ऊपर गया और विधानसभा भाषा और पायथन तुल्यता से लेकर मशीन सीखने और आंकड़ों तक सब कुछ कवर करने वाले कार्ड हैं। इसकी आवश्यकता के लिए यह बहुत अधिक है
|
||||
|
||||
|
|
@ -548,7 +548,7 @@ memory" का एरर न दे, और तब मुझे कोई वै
|
|||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Good intro:
|
||||
|
|
@ -1120,7 +1120,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- For even more, see "Mining Massive Datasets" video series in the Video Series section.
|
||||
- [ ] Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:
|
||||
- review: [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- flow:
|
||||
1. Understand the problem and scope:
|
||||
- define the use cases, with interviewer's help
|
||||
|
|
|
|||
|
|
@ -165,7 +165,7 @@ Saya menggunakan markdown spesial dari Github, termasuk daftar tugas untuk menge
|
|||
|
||||
`git commit -m "Tandai x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -327,8 +327,8 @@ Saya membuat sebuah mobile-first website jadi saya bisa mereview di telepon dan
|
|||
Membuat punya anda sendiri secara gratis:
|
||||
|
||||
- [Repo website flashcards](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [Database flashcards saya (lama - 1200 kartu)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [Database flashcards saya (baru - 1800 kartu)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [Database flashcards saya (lama - 1200 kartu)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [Database flashcards saya (baru - 1800 kartu)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
Perlu diingat aku pergi keluar kapal dan memiliki kartu meliputi segala sesuatu dari bahasa assembly dan Python trivia untuk pembelajaran machine learning dan statistik. Ini terlalu banyak untuk apa yang diminta oleh Google.
|
||||
|
||||
|
|
@ -564,7 +564,7 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s
|
|||
- pencarian biner menggunakan rekursi
|
||||
|
||||
- ### Operasi Bitwise
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - Anda harus mengetahui banyak pangkat 2 dari (2^1 hingga 2^16 dan 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - Anda harus mengetahui banyak pangkat 2 dari (2^1 hingga 2^16 dan 2^32)
|
||||
- [ ] Dapatkan pemahaman yang sangat baik tentang memanipulasi bit dengan: &, |, ^, ~, >>, <<
|
||||
- [ ] [kata-kata](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Good intro:
|
||||
|
|
@ -1134,7 +1134,7 @@ Graf (Graphs) dapat digunakan untuk merepresentasikan banyak masalah dalam ilmu
|
|||
- [ ] Mempraktikkan proses desain sistem: Berikut adalah beberapa ide untuk dicoba di atas kertas, masing-masing dengan beberapa dokumentasi tentang bagaimana hal itu ditangani di dunia nyata:
|
||||
- review: [Primer Desain Sistem](https://github.com/donnemartin/system-design-primer)
|
||||
- [Desain Sistem dari HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [contekan (cheat sheet)](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [contekan (cheat sheet)](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- aliran:
|
||||
1. Pahami masalah dan cakupannya:
|
||||
- Tentukan kasus penggunaan, dengan bantuan pewawancara
|
||||
|
|
|
|||
|
|
@ -201,7 +201,7 @@ SREまたはシステムエンジニアになりたい場合は、オプショ
|
|||
|
||||
`git commit -m "マークされたx"`
|
||||
|
||||
`git rebase jwasham/master`
|
||||
`git rebase jwasham/main`
|
||||
|
||||
`git push --force`
|
||||
|
||||
|
|
@ -419,8 +419,8 @@ OR：
|
|||
あなた自身を無料で作る：
|
||||
|
||||
- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [マイフラッシュカードデータベース(旧1200カード)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db)：
|
||||
- [マイフラッシュカードデータベース(新1800カード)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db)：
|
||||
- [マイフラッシュカードデータベース(旧1200カード)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db)：
|
||||
- [マイフラッシュカードデータベース(新1800カード)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db)：
|
||||
|
||||
覚えておいてほしいのですが，私はやりすぎてしまい、アセンブリ言語，機械学習のためのPythonのトリビア，統計に至るまですべてのカードをカバーしています。
|
||||
何が必要なのかはあまりにも大変です。
|
||||
|
|
@ -661,7 +661,7 @@ Anki形式の私のフラッシュカードデータベース：https://ankiweb.
|
|||
- 再帰を利用した二分探索
|
||||
|
||||
- ###ビット演算
|
||||
- [ ] [ビットチートシート- 2 ^ 1から2 ^ 16および2 ^ 32までの2の累乗の多くを知るべきです](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf)
|
||||
- [ ] [ビットチートシート- 2 ^ 1から2 ^ 16および2 ^ 32までの2の累乗の多くを知るべきです](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-cheet.pdf)
|
||||
- [ ] ＆、|、^、〜、>>、<<を使ってビットを操作することについての本当の理解を得る
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] [良いイントロ：ビット操作(動画)](https://www.youtube.com/watch?v=7jkIUgLC29I)
|
||||
|
|
@ -1287,7 +1287,7 @@ Skienaの本(下記の書籍の節を参照)と面接の書籍
|
|||
- [ ] システム設計プロセスの練習：紙で作業しようとするいくつかのアイデアがあります。実際にどのように処理されたかについてのいくつかの文書があります。
|
||||
- レビュー：[システム設計入門](https://github.com/donnemartin/system-design-primer)
|
||||
- [HiredInTechのシステム設計](http://www.hiredintech.com/system-design/)
|
||||
- [チートシート](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [チートシート](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- 流れ：
|
||||
1. 問題と範囲を理解する：
|
||||
- 面接官の助けを借りてユースケースを定義する
|
||||
|
|
|
|||
|
|
@ -174,7 +174,7 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
|
||||
`git commit -m "Marked x"`
|
||||
|
||||
`git rebase jwasham/master`
|
||||
`git rebase jwasham/main`
|
||||
|
||||
`git push --force`
|
||||
|
||||
|
|
@ -369,8 +369,8 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
អ្នកអាចបង្កេីតដោយឥតគិតថ្លៃ៖
|
||||
|
||||
- [បណ្តាញឃ្លាំងផ្ទុកកាតឡើងវិញ](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [មូលដ្ឋានទិន្នន័យកាតរបស់ខ្ញុំ (កាតចាស់ - ១២០០ កាត)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db)៖
|
||||
- [ប្រព័ន្ធទិន្នន័យកាតរបស់ខ្ញុំ (កាតថ្មី - ១៨០០)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db)៖
|
||||
- [មូលដ្ឋានទិន្នន័យកាតរបស់ខ្ញុំ (កាតចាស់ - ១២០០ កាត)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db)៖
|
||||
- [ប្រព័ន្ធទិន្នន័យកាតរបស់ខ្ញុំ (កាតថ្មី - ១៨០០)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db)៖
|
||||
|
||||
សូមចងចាំថាខ្ញុំបានឡើងលើក្តារហើយមានកាតគ្របដណ្តប់លើអ្វីៗទាំងអស់ចាប់ពីភាសាការជួបប្រជុំគ្នា និង សំនួរទាក់ទងនឹង Python រហូតដល់ការរៀនម៉ាស៊ីននិងស្ថិតិ។ វាជាវិធីច្រើនពេកសម្រាប់អ្វីដែលត្រូវការ។
|
||||
|
||||
|
|
@ -639,7 +639,7 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
- Binary search ដោយប្រើការហៅខ្លួនឯង
|
||||
|
||||
- ### ប្រតិបតិ្តការ Bitwise
|
||||
- [ ] [សន្លឹកជំនួយ Bits](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf)
|
||||
- [ ] [សន្លឹកជំនួយ Bits](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf)
|
||||
- អ្នកគួរតែស្គាល់ អំណាច ២ ពី (២ ^ ១ ដល់ ២ ^ ១៦ និង ២ ^ ៣២)
|
||||
- [ ] ទទួលបានការយល់ដឹងដ៏ល្អអំពីការរៀបចំBitsជាមួយ៖ &, |, ^, ~, >>, <<
|
||||
- [ ] [ពាក្យ](https://en.wikipedia.org/wiki/Word_ (computer_architecture))
|
||||
|
|
@ -1213,7 +1213,7 @@ Graphs អាចត្រូវបានប្រើដើម្បីបង្
|
|||
- [ ] ការអនុវត្តដំណើរការរចនាប្រព័ន្ធ៖ នេះគឺជាគំនិតមួយចំនួនដើម្បីព្យាយាមធ្វើការលើក្រដាសនីមួយៗដោយមានឯកសារមួយចំនួនស្តីពីវិធីដែលត្រូវបានដោះស្រាយនៅក្នុងពិភពពិត៖
|
||||
- ពិនិត្យឡើងវិញ: [The System Design Primer](https://github.com/donnemartin/system-design-primer)
|
||||
- [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- flow:
|
||||
1. ស្វែងយល់ពីបញ្ហានិងវិសាលភាព
|
||||
- កំណត់ករណីប្រើប្រាស់ដោយមានជំនួយពីអ្នកសម្ភាសន៍
|
||||
|
|
|
|||
|
|
@ -219,7 +219,7 @@
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --set-upstream origin progress`
|
||||
|
||||
|
|
@ -382,8 +382,8 @@ C++에 대한 더 나은 추천 책이 있다면 알려주십시오. 포괄적
|
|||
당신만의 카드를 무료로 만들어보자:
|
||||
|
||||
- [Flashcard 사이트 repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [내 flashcard 데이터베이스 (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [내 flashcard 데이터베이스 (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [내 flashcard 데이터베이스 (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [내 flashcard 데이터베이스 (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
앞에서도 언급했듯이 나는 불필요하게 많은 것을 공부하려고 했고, 내 카드의 내용들은 어셈블리 언어와 Python의 자잘한 지식들부터 기계 학습과 통계학까지 넘나들게 되었다. 결국 기업이 요구하는 것보다 훨씬 멀리 가버리고 말았다.
|
||||
|
||||
|
|
@ -628,7 +628,7 @@ Anki format의 내 flashcard 데이터베이스: https://ankiweb.net/shared/info
|
|||
- 재귀를 사용한 이진 탐색
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] 비트 연산자(&, |, ^, ~, >>, <<) 제대로 이해하기
|
||||
- [ ] [워드](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] 시작하기 좋은 곳:
|
||||
|
|
@ -1199,7 +1199,7 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- [ ] Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:
|
||||
- review: [The System Design Primer](https://github.com/donnemartin/system-design-primer)
|
||||
- [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- flow:
|
||||
1. Understand the problem and scope:
|
||||
- define the use cases, with interviewer's help
|
||||
|
|
|
|||
|
|
@ -208,7 +208,7 @@ Używam specjalnej odmiany Markdown GitHub, w tym list zadań do sprawdzania pos
|
|||
|
||||
`git commit -m "Marked x"`
|
||||
|
||||
`git rebase jwasham/master`
|
||||
`git rebase jwasham/main`
|
||||
|
||||
`git push --force`
|
||||
|
||||
|
|
@ -372,8 +372,8 @@ Stworzyłem witrynę mobilną, aby móc przeglądać na moim telefonie i tableci
|
|||
Stwórz własną za darmo:
|
||||
|
||||
- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
Pamiętaj, że poszedłem ostro i mam karty obejmujące wszystko, od języka asemblera i ciekawostek Python po uczenie maszynowe i statystyki. To o wiele za dużo na to, w stosunku do tego co jest wymagane.
|
||||
|
||||
|
|
@ -617,7 +617,7 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr
|
|||
- binary search using recursion
|
||||
|
||||
- ### Operacje bitowe
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] Dobrze zrozum manipulowanie bitami korzystając z: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Good intro:
|
||||
|
|
@ -1186,7 +1186,7 @@ Trie to drzewo węzłów, które obsługuje operacje Znajdź i Wstaw [etc (...)]
|
|||
- [ ] Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:
|
||||
- review: [The System Design Primer](https://github.com/donnemartin/system-design-primer)
|
||||
- [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- flow:
|
||||
1. Zrozumienie problemu i zakresu:
|
||||
- zdefiniowanie przypadków użycia, z pomocą rekrutera
|
||||
|
|
|
|||
|
|
@ -10,7 +10,7 @@
|
|||
>
|
||||
> *Boa sorte para todos vocês!*
|
||||
|
||||
**Original**: [Inglês](https://github.com/jwasham/coding-interview-university/blob/master/README.md)
|
||||
**Original**: [Inglês](https://github.com/jwasham/coding-interview-university/blob/main/README.md)
|
||||
|
||||
- [Acompanhe o progresso da tradução aqui!](https://github.com/jwasham/coding-interview-university/pull/115)
|
||||
|
||||
|
|
@ -205,7 +205,7 @@ Eu estou usando a sintaxe de markdown especial do Github, incluindo listas de ta
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -415,8 +415,8 @@ Eu fiz um website focado em mobile para que eu pudesse rever no meu celular, tab
|
|||
Faça o seu próprio, grátis:
|
||||
|
||||
- [Repositório de flashcards](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [Minha base de dados de flashcards (antigo - 1200 cartões)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [Minha base de dados de flashcards (novo - 1800 cartões)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [Minha base de dados de flashcards (antigo - 1200 cartões)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [Minha base de dados de flashcards (novo - 1800 cartões)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
Tenha em mente que eu exagerei e tenho cartões abrangendo desde linguagem assembly e trivialidades de Python até aprendizado de máquina e estatísticas. É demais para o que é requerido.
|
||||
|
||||
|
|
@ -650,7 +650,7 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
- busca binária usando recursividade
|
||||
|
||||
- ### Lógica binária
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) (Folha de consultas sobre Bits) - você deve conhecer várias das potências de 2 de (2^1 até 2^16 e 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) (Folha de consultas sobre Bits) - você deve conhecer várias das potências de 2 de (2^1 até 2^16 e 2^32)
|
||||
- [ ] Consiga um bom entendimento sobre manipulação de bits com: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture)) (palavras)
|
||||
- [ ] Boa introdução:
|
||||
|
|
@ -1274,7 +1274,7 @@ Você ganhará mais prática com grafos no livro do Skiena (veja a seção de li
|
|||
- [ ] Praticando o processo de design de sistema: Aqui estão algumas ideias para tentar trabalhar no papel, cada uma com documentação sobre como ela foi tratada no mundo real:
|
||||
- revisão: [The System Design Primer](https://github.com/donnemartin/system-design-primer) (A Base de Design de Sistema)
|
||||
- [System Design from HiredInTech](http://www.hiredintech.com/system-design/) (Design de Sistema, por HiredInTech)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf) (folha de consultas)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf) (folha de consultas)
|
||||
- fluxo:
|
||||
1. Compreenda o problema e seu escopo:
|
||||
- defina os casos de uso, com a ajuda do entrevistador
|
||||
|
|
|
|||
|
|
@ -193,7 +193,7 @@ Google не возьмёт тебя на работу.
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -477,7 +477,7 @@ Google не возьмёт тебя на работу.
|
|||
Сделай свой собственный бесплатно:
|
||||
|
||||
- [Репозиторий сайта Flashcards](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [Моя база данных с карточками](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db): Имейте в виду, я сделал больше чем требуется в Google, описав все начиная с assembler и заканчивая Python с машиным обучением и статистикой.
|
||||
- [Моя база данных с карточками](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db): Имейте в виду, я сделал больше чем требуется в Google, описав все начиная с assembler и заканчивая Python с машиным обучением и статистикой.
|
||||
|
||||
**Заметка о карточках:** в первый раз вы сразу вспомните ответ, но не помечайте эту карточку как изученную. Нужно просмотреть
|
||||
много раз карточку и ответить правильно прежде чем вы действительно ее запомните. Повторение позволяет мозгу надолго
|
||||
|
|
@ -712,7 +712,7 @@ Google не возьмёт тебя на работу.
|
|||
- бинарный поиск с использованием рекурсии
|
||||
|
||||
- ### Побитовые операции
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/google-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - ты должен знать сколько степеней двойки от (2^1 до 2^16 и 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - ты должен знать сколько степеней двойки от (2^1 до 2^16 и 2^32)
|
||||
- [ ] Даст отличное понимание манипуляций битами с помощью: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Хорошее введение:
|
||||
|
|
|
|||
|
|
@ -186,7 +186,7 @@
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -392,8 +392,8 @@ Here are some mistakes I made so you'll have a better experience.
|
|||
คุณสามารถทำได้แบบฟรีๆ:
|
||||
|
||||
- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [คลัง flash card ของผม (เก่า - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [คลัง flash cards ของผม (ใหม่- 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [คลัง flash card ของผม (เก่า - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [คลัง flash cards ของผม (ใหม่- 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
คลังการ์ดของผมนั้น เนื้อหาจะครอบคลุมเกินเนื้อหาหลัก ตั้งแต่ภาษา assembly และ Python จนไปถึง machine learning และ สถิติ ซึ่งมันก็เกินกว่าที่เราต้องการ
|
||||
|
||||
|
|
@ -628,7 +628,7 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Good intro:
|
||||
|
|
@ -1247,7 +1247,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- For even more, see "Mining Massive Datasets" video series in the Video Series section.
|
||||
- [ ] Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:
|
||||
- review: [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- flow:
|
||||
1. Understand the problem and scope:
|
||||
- define the use cases, with interviewer's help
|
||||
|
|
|
|||
|
|
@ -207,7 +207,7 @@
|
|||
|
||||
`git commit -m "Marked x"`
|
||||
|
||||
`git rebase jwasham/master`
|
||||
`git rebase jwasham/main`
|
||||
|
||||
`git push --force`
|
||||
|
||||
|
|
@ -365,8 +365,8 @@
|
|||
製作屬於自己的免費小字卡:
|
||||
|
||||
- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
我的小字卡資料庫中包含了組合語言、Python的小知識、機器學習以及統計。這些內容已經超出了原本他的預設。
|
||||
|
||||
|
|
@ -597,7 +597,7 @@
|
|||
- 用遞迴(recursion)的方法實作二分搜尋法
|
||||
|
||||
- ### 位元運算(Bitwise operations)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) - 你應該能背出一些2的指數(從2^1到2^16以及2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-cheet.pdf) - 你應該能背出一些2的指數(從2^1到2^16以及2^32)
|
||||
- [ ] 實際了解如何用下列的位元運算子來操作每個位元: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Good intro:
|
||||
|
|
@ -1159,7 +1159,7 @@
|
|||
- [ ] 練習系統設計的過程:以下是在紙上練習的一些方法，每個都有他們如何運用在現實中的說明文件:
|
||||
- 複習: [系統設計入門](https://github.com/donnemartin/system-design-primer)
|
||||
- [HiredInTech系統設計](http://www.hiredintech.com/system-design/)
|
||||
- [提示](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [提示](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- 流程:
|
||||
1. 了解問題與其範圍:
|
||||
- 在面試官的幫助下定義使用情況
|
||||
|
|
|
|||
|
|
@ -181,7 +181,7 @@ Original: [англійською](README.md)
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -390,8 +390,8 @@ I made a mobile-first website so I could review on my phone and tablet, wherever
|
|||
Make your own for free:
|
||||
|
||||
- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db):
|
||||
- [My flash cards database (old - 1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
|
||||
- [My flash cards database (new - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
|
||||
|
||||
Keep in mind I went overboard and have cards covering everything from assembly language and Python trivia to machine learning and statistics. It's way too much for what's required.
|
||||
|
||||
|
|
@ -626,7 +626,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, <<
|
||||
- [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
- [ ] Good intro:
|
||||
|
|
@ -1248,7 +1248,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- For even more, see "Mining Massive Datasets" video series in the Video Series section.
|
||||
- [ ] Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:
|
||||
- review: [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf)
|
||||
- [cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf)
|
||||
- flow:
|
||||
1. Understand the problem and scope:
|
||||
- define the use cases, with interviewer's help
|
||||
|
|
|
|||
|
|
@ -207,7 +207,7 @@ Ok, bây giờ bạn có thể bắt đầu:
|
|||
- Check các phần đã hoàn thành bằng cách thêm `x` vào giữa cặp ngoặc vuông (`[ ]`), như thế này: `[x]`.
|
||||
- Chạy `git add .` để bắt đầu lưu lại các thay đổi.
|
||||
- Chạy `git commit -m "commit message" `. Thay `commit message` với ghi chú của bạn cho sự thay đổi đó.
|
||||
- Đồng bộ thay đổi với bản fork trên Github của bạn bằng `git push origin master`.
|
||||
- Đồng bộ thay đổi với bản fork trên Github của bạn bằng `git push origin main`.
|
||||
|
||||
|
||||
## Đừng nghĩ rằng bạn không đủ thông minh
|
||||
|
|
@ -429,7 +429,7 @@ Tôi đã làm một trang mobile-first (lấy mobile là trọng tâm phát tri
|
|||
Tự tạo cho mình hoàn toàn miễn phí:
|
||||
|
||||
- [Repo của trang thẻ ghi nhớ](https://github.com/jwasham/computer-science-flash-cards)
|
||||
- [Cơ sở dữ liệu thẻ ghi nhớ của tôi](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db): Lưu ý là tôi có đi hơi xa và các thẻ ghi nhớ có thể bao gồm cả hợp ngữ (ngôn ngữ máy) và Python cho đến cả máy học (machine learning) và thống kê. Như thế là quá nhiều cho các yêu cầu từ Google.
|
||||
- [Cơ sở dữ liệu thẻ ghi nhớ của tôi](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db): Lưu ý là tôi có đi hơi xa và các thẻ ghi nhớ có thể bao gồm cả hợp ngữ (ngôn ngữ máy) và Python cho đến cả máy học (machine learning) và thống kê. Như thế là quá nhiều cho các yêu cầu từ Google.
|
||||
|
||||
**Ghi chú dành cho các thẻ ghi nhớ:** Lần đầu tiên bạn nhận ra bạn biết câu trả lời, đừng đánh dấu là đã biết.Bạn phải xem thẻ tương tự và đưa ra câu trả lời chính xác vài lần trước khi bạn thực sự khẳng định đã nắm được vấn đề. Lặp đi lặp lại việc này sẽ giúp kiến thức được khắc sâu vào não bạn.
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue