Merge branch 'main' into prog
This commit is contained in:
hanyuwenn
GitHub
commit
d5eca55843
|
|
@ -0,0 +1 @@
|
|||
github: jwasham
|
||||
|
|
@ -0,0 +1,84 @@
|
|||
name: Links Checker
|
||||
|
||||
on:
|
||||
## Allow triggering this workflow manually via GitHub CLI/web
|
||||
workflow_dispatch:
|
||||
|
||||
## Run this workflow automatically every month
|
||||
schedule:
|
||||
- cron: '0 0 1 * *'
|
||||
|
||||
jobs:
|
||||
link_checker:
|
||||
name: Check links and create automated issue if needed
|
||||
runs-on: ubuntu-latest
|
||||
env:
|
||||
REPORT_FILE: links-report
|
||||
steps:
|
||||
## Check out code using Git
|
||||
- uses: actions/checkout@v3
|
||||
|
||||
- name: Check all links at README.md but skips translations files
|
||||
id: lychee
|
||||
uses: lycheeverse/lychee-action@v1.4.1
|
||||
with:
|
||||
output: ${{ env.REPORT_FILE }}
|
||||
format: markdown
|
||||
## Do not fail this step on broken links
|
||||
fail: false
|
||||
## Allow pages replying with 200 (Ok), 204 (No Content),
|
||||
## 206 (Partial Content) in at most 20 seconds with HTML content.
|
||||
args: >-
|
||||
--verbose
|
||||
--accept 200,204,206
|
||||
--headers "accept=text/html"
|
||||
--timeout 20
|
||||
--max-concurrency 10
|
||||
--no-progress
|
||||
README.md
|
||||
env:
|
||||
## Avoid rate limiting when checking github.com links
|
||||
GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
|
||||
|
||||
- name: Lychee's exit code
|
||||
## https://github.com/lycheeverse/lychee#exit-codes
|
||||
run: echo Lychee exit with ${{ steps.lychee.outputs.exit_code }}
|
||||
|
||||
- name: Find the last report issue open
|
||||
uses: micalevisk/last-issue-action@v1.2
|
||||
id: last_issue
|
||||
with:
|
||||
state: open
|
||||
labels: |
|
||||
report
|
||||
automated issue
|
||||
env:
|
||||
GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
|
||||
|
||||
- name: Create issue from report file
|
||||
if: ${{ steps.last_issue.outputs.has_found == 'false' }}
|
||||
uses: peter-evans/create-issue-from-file@v4
|
||||
with:
|
||||
title: Link checker report
|
||||
content-filepath: ${{ env.REPORT_FILE }}
|
||||
issue-number: ${{ steps.last_issue.outputs.issue_number }}
|
||||
labels: |
|
||||
report
|
||||
automated issue
|
||||
|
||||
- name: Update last report open issue created
|
||||
if: ${{ steps.last_issue.outputs.has_found == 'true' }}
|
||||
uses: peter-evans/create-issue-from-file@v4
|
||||
with:
|
||||
title: Link checker report
|
||||
content-filepath: ${{ env.REPORT_FILE }}
|
||||
issue-number: ${{ steps.last_issue.outputs.issue_number }}
|
||||
labels: |
|
||||
report
|
||||
automated issue
|
||||
|
||||
- name: Close last report open issue
|
||||
if: ${{ steps.lychee.outputs.exit_code == 0 }}
|
||||
uses: peter-evans/close-issue@v2
|
||||
with:
|
||||
issue-number: ${{ steps.last_issue.outputs.issue_number }}
|
||||
|
|
@ -16,3 +16,5 @@ personal-9894.md
|
|||
ehthumbs.db
|
||||
Thumbs.db
|
||||
|
||||
# Sublime Files
|
||||
.sublime
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
|
@ -1,69 +1,112 @@
|
|||
## 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)
|
||||
- K&R C book (ANSI C)
|
||||
- [Make, Clang (video)](https://www.youtube.com/watch?v=U3zCxnj2w8M)
|
||||
- GDB:
|
||||
- [Harvard CS50 - GDB (video)](https://www.youtube.com/watch?v=USPvePv1uzE)
|
||||
- [Harvard CS50 - GDB (video)](https://www.youtube.com/watch?v=y5JmQItfFck)
|
||||
- [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)
|
||||
- [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)](https://www.amazon.com/Programming-Language-2nd-Brian-Kernighan/dp/0131103628)
|
||||
- [Make, Clang (video)](https://www.youtube.com/watch?v=U3zCxnj2w8M)
|
||||
- [Top C Programming Interview Questions](https://www.interviewbit.com/c-interview-questions)
|
||||
- GDB:
|
||||
- [Harvard CS50 - GDB (video)](https://www.youtube.com/watch?v=USPvePv1uzE)
|
||||
- [Harvard CS50 - GDB (video)](https://www.youtube.com/watch?v=y5JmQItfFck)
|
||||
- [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)
|
||||
- [Complete C programming for beginners](https://youtu.be/KJgsSFOSQv0)
|
||||
- [Learn C in Detail](https://www.scaler.com/topics/c/)
|
||||
|
||||
- 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)
|
||||
- basics
|
||||
- pointers
|
||||
- functions
|
||||
- references
|
||||
- templates
|
||||
- compilation
|
||||
- scope & linkage
|
||||
- namespaces
|
||||
- OOP
|
||||
- STL
|
||||
- [functors](http://www.cprogramming.com/tutorial/functors-function-objects-in-c++.html)
|
||||
- [C++ at Google (video)](https://www.youtube.com/watch?v=NOCElcMcFik)
|
||||
- [Google C++ Style Guide](https://google.github.io/styleguide/cppguide.html)
|
||||
- Google uses clang-format (there is a command line "style" argument: -style=google)
|
||||
- [Efficiency with Algorithms, Performance with Data Structures (video)](https://youtu.be/fHNmRkzxHWs)
|
||||
- [Review of C++ concepts (video)](https://www.youtube.com/watch?v=Rub-JsjMhWY)
|
||||
- [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)
|
||||
- [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)
|
||||
- [functions](https://www.cprogramming.com/tutorial/lesson4.html)
|
||||
- [references](https://www.geeksforgeeks.org/references-in-c/)
|
||||
- [templates](https://www.cprogramming.com/tutorial/templates.html)
|
||||
- [compilation](https://www.youtube.com/watch?v=ZTu0kf-7h08)
|
||||
- [scope & linkage](https://www.learncpp.com/cpp-tutorial/scope-duration-and-linkage-summary/)
|
||||
- [namespaces](https://www.tutorialspoint.com/cplusplus/cpp_namespaces.htm)
|
||||
- [OOP](https://www.geeksforgeeks.org/object-oriented-programming-in-cpp/)
|
||||
- [STL](https://www.hackerearth.com/practice/notes/standard-template-library/)
|
||||
- [functors](http://www.cprogramming.com/tutorial/functors-function-objects-in-c++.html)
|
||||
- [C++ at Google (video)](https://www.youtube.com/watch?v=NOCElcMcFik)
|
||||
- [Google C++ Style Guide](https://google.github.io/styleguide/cppguide.html)
|
||||
- Google uses clang-format (there is a command line "style" argument: -style=google)
|
||||
- [Efficiency with Algorithms, Performance with Data Structures (video)](https://youtu.be/fHNmRkzxHWs)
|
||||
- [Review of C++ concepts (video)](https://www.youtube.com/watch?v=Rub-JsjMhWY)
|
||||
- [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)
|
||||
- [C++ Tutorial for Beginners](https://www.youtube.com/watch?v=vLnPwxZdW4Y)
|
||||
- [C++ Interview Questions](https://www.interviewbit.com/cpp-interview-questions)
|
||||
- Python
|
||||
- [Python Cheat Sheet](https://github.com/jwasham/coding-interview-university/blob/master/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)
|
||||
- [Faster Python (video)](https://www.youtube.com/watch?v=JDSGVvMwNM8)
|
||||
- [CPython Walk (video)](https://www.youtube.com/watch?v=LhadeL7_EIU&list=PLzV58Zm8FuBL6OAv1Yu6AwXZrnsFbbR0S&index=6)
|
||||
- [10 Tips for Pythonic Code (video)](https://www.youtube.com/watch?v=_O23jIXsshs)
|
||||
- [Beyond PEP 8 -- Best practices for beautiful intelligible code (video)](https://www.youtube.com/watch?v=wf-BqAjZb8M)
|
||||
- [Automate the Boring Stuff with Python](https://automatetheboringstuff.com/)
|
||||
- [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)
|
||||
- [Faster Python (video)](https://www.youtube.com/watch?v=JDSGVvMwNM8)
|
||||
- [CPython Walk (video)](https://www.youtube.com/watch?v=LhadeL7_EIU&list=PLzV58Zm8FuBL6OAv1Yu6AwXZrnsFbbR0S&index=6)
|
||||
- [10 Tips for Pythonic Code (video)](https://www.youtube.com/watch?v=_O23jIXsshs)
|
||||
- [Beyond PEP 8 -- Best practices for beautiful intelligible code (video)](https://www.youtube.com/watch?v=wf-BqAjZb8M)
|
||||
- [Automate the Boring Stuff with Python](https://automatetheboringstuff.com/)
|
||||
- [Coding Interview Essentials](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/Coding%20Interview%20Python%20Language%20Essentials.pdf)
|
||||
- [Data Structures And Algorithms in Python](https://www.youtube.com/watch?v=kQDxmjfkIKY)
|
||||
- [Python Programming Tutorial](https://www.scaler.com/topics/python/)
|
||||
- [Python Interview Questions](https://www.interviewbit.com/python-interview-questions)
|
||||
- [Python Guide for Beginners](https://wiingy.com/learn/python/python-tutorial/)
|
||||
- Java
|
||||
- [Stanford CS106A - Programming Methodology (video)](https://see.stanford.edu/Course/CS106A)
|
||||
- [Software Construction In Java (video)](https://www.edx.org/course/software-construction-java-mitx-6-005-1x)
|
||||
- [Introduction To Programming In Java](http://introcs.cs.princeton.edu/java/home/)
|
||||
- [Algorithms 4th Ed - Algorithm Book In Java](http://algs4.cs.princeton.edu/home/)
|
||||
- [Effective Java 3rd Edition](https://www.amazon.com/Effective-Java-Joshua-Bloch-ebook/dp/B078H61SCH)
|
||||
- [Stanford CS106A - Programming Methodology (video)](https://see.stanford.edu/Course/CS106A)
|
||||
- [Java Cheat Sheet](https://www.interviewbit.com/java-cheat-sheet)
|
||||
- [Introduction To Programming In Java](http://introcs.cs.princeton.edu/java/home/)
|
||||
- [Algorithms 4th Ed - Algorithm Book In Java](http://algs4.cs.princeton.edu/home/)
|
||||
- [Effective Java 3rd Edition](https://www.amazon.com/Effective-Java-Joshua-Bloch-ebook/dp/B078H61SCH)
|
||||
- [Data Structures Easy to Advanced Course - Full Tutorial from a Google Engineer](https://www.youtube.com/watch?v=RBSGKlAvoiM&t=1744s)
|
||||
- [Top Java Interview Questions and Answers](https://www.interviewbit.com/java-interview-questions)
|
||||
- [Data Structures in Java](https://www.youtube.com/playlist?list=PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ)
|
||||
- Go
|
||||
- [The Go programming Language](https://golang.org/)
|
||||
- [The Go programming Language (book)](http://www.gopl.io/)
|
||||
- [A Tour of Go](https://tour.golang.org/)
|
||||
- [Effective Go](https://golang.org/doc/effective_go.html)
|
||||
- [Go Wiki](https://golang.org/wiki)
|
||||
- [Go at Google: Language Design in the Service of Software Engineering](https://talks.golang.org/2012/splash.article)
|
||||
- [Go Proverbs](http://go-proverbs.github.io/)
|
||||
- [Go Proverbs - Rob Pike (video)](https://www.youtube.com/watch?v=PAAkCSZUG1c)
|
||||
- [The Go programming Language](https://golang.org/)
|
||||
- [The Go programming Language (book)](http://www.gopl.io/)
|
||||
- [A Tour of Go](https://tour.golang.org/)
|
||||
- [Effective Go](https://golang.org/doc/effective_go.html)
|
||||
- [Go Wiki](https://golang.org/wiki)
|
||||
- [Go at Google: Language Design in the Service of Software Engineering](https://talks.golang.org/2012/splash.article)
|
||||
- [Go Proverbs](http://go-proverbs.github.io/)
|
||||
- [Go Proverbs - Rob Pike (video)](https://www.youtube.com/watch?v=PAAkCSZUG1c)
|
||||
- [Gophercises - Free course on Coding Exercises in Go](https://gophercises.com)
|
||||
- HTML
|
||||
- [Quick HTML Tutorial for Beginners](https://www.youtube.com/playlist?list=PLr6-GrHUlVf_ZNmuQSXdS197Oyr1L9sPB)
|
||||
- [HTML Crash Course for Beginners (1 hr)](https://www.youtube.com/watch?v=UB1O30fR-EE)
|
||||
- [HTML Cheat Sheet](https://www.interviewbit.com/html-cheat-sheet)
|
||||
- [Quick HTML Tutorial for Beginners](https://www.youtube.com/playlist?list=PLr6-GrHUlVf_ZNmuQSXdS197Oyr1L9sPB)
|
||||
- [HTML Crash Course for Beginners (1 hr)](https://www.youtube.com/watch?v=UB1O30fR-EE)
|
||||
- [Learn HTML in Detail](https://www.scaler.com/topics/html/)
|
||||
- [Basic HTML and HTML5](https://www.freecodecamp.org/learn/responsive-web-design/basic-html-and-html5/)
|
||||
- [W3 Schools](https://www.w3schools.com/html/)
|
||||
- [Html Interview Questions](https://www.interviewbit.com/html-interview-questions)
|
||||
- CSS
|
||||
- [Quick CSS Tutorial for Beginners](https://www.youtube.com/playlist?list=PLr6-GrHUlVf8JIgLcu3sHigvQjTw_aC9C)
|
||||
- [CSS Crash Course for absolute Beginners](https://www.youtube.com/watch?v=yfoY53QXEnI)
|
||||
- [Quick CSS Tutorial for Beginners](https://www.youtube.com/playlist?list=PLr6-GrHUlVf8JIgLcu3sHigvQjTw_aC9C)
|
||||
- [CSS Crash Course for absolute Beginners](https://www.youtube.com/watch?v=yfoY53QXEnI)
|
||||
- [Basic CSS](https://www.freecodecamp.org/learn/responsive-web-design/basic-css/)
|
||||
- [W3 Schools](https://www.w3schools.com/css/)
|
||||
- [Top 30+ CSS Interview Questions](https://www.interviewbit.com/css-interview-questions)
|
||||
- Javascript
|
||||
- [Learn Javascript in 12 minutes](https://www.youtube.com/watch?v=Ukg_U3CnJWI)
|
||||
- [Javascript Beginner Tutorials](https://www.youtube.com/playlist?list=PL41lfR-6DnOrwYi5d824q9-Y6z3JdSgQa)
|
||||
- Other Language 1
|
||||
- [JavaScript Cheat Sheet](https://www.interviewbit.com/javascript-cheat-sheet)
|
||||
- [Learn Javascript in 12 minutes](https://www.youtube.com/watch?v=Ukg_U3CnJWI)
|
||||
- [Javascript Beginner Tutorials](https://www.youtube.com/playlist?list=PL41lfR-6DnOrwYi5d824q9-Y6z3JdSgQa)
|
||||
- [Javascript Algorithms and Data Structures](https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-javascript/)
|
||||
- [Javascript Algorithms With Explanations](https://github.com/trekhleb/javascript-algorithms)
|
||||
- [Javascript Tutorial - Learn From Scratch](https://www.scaler.com/topics/javascript/)
|
||||
- [Javascript Interview Questions and Answers](https://www.interviewbit.com/javascript-interview-questions)
|
||||
- Rust
|
||||
- [The Rust Programming Language](https://doc.rust-lang.org/book/title-page.html)
|
||||
- [Rust by Example](https://doc.rust-lang.org/stable/rust-by-example/)
|
||||
- [Rust Tutorial by Doug Milford from Lambda Valley](https://www.youtube.com/playlist?list=PLLqEtX6ql2EyPAZ1M2_C0GgVd4A-_L4_5)
|
||||
- [Introduction - Easy Rust](https://www.youtube.com/playlist?list=PLLqEtX6ql2EyPAZ1M2_C0GgVd4A-_L4_5)
|
||||
- [Rust overview](https://learning-rust.github.io/docs/index.html)
|
||||
- [A Gentle Introduction to Rust](https://stevedonovan.github.io/rust-gentle-intro/readme.html)
|
||||
|
||||
- Ruby
|
||||
|
||||
- [The Ruby Programming Language](https://book4you.org/book/1219034/7c9a4b)
|
||||
- [Polished Ruby Programming](https://book4you.org/book/16678106/f61159)
|
||||
- [Ruby Fu](https://rubyfu.net/)
|
||||
- [Ruby Koans](http://rubykoans.com/)
|
||||
|
||||
- Other Language 2
|
||||
- etc
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
Binary file not shown.
File diff suppressed because it is too large
Load Diff
|
|
@ -15,36 +15,50 @@
|
|||
<details>
|
||||
<summary>Übersetzungen:</summary>
|
||||
|
||||
- [中文版本](translations/README-cn.md)
|
||||
- [Tiếng Việt - Vietnamese](translations/README-vi.md)
|
||||
- [Bahasa Indonesia](translations/README-id.md)
|
||||
- [Bulgarian](translations/README-bg.md)
|
||||
- [Español](translations/README-es.md)
|
||||
- [German](translations/README-de.md)
|
||||
- [Japanese (日本語)](translations/README-ja.md)
|
||||
- [Polish](translations/README-pl.md)
|
||||
- [Português Brasileiro](translations/README-ptbr.md)
|
||||
|
||||
- [Russian](translations/README-ru.md)
|
||||
- [Tiếng Việt - Vietnamese](translations/README-vi.md)
|
||||
- [Urdu - اردو](tanslations/README-ur.md)
|
||||
- [Uzbek](translations/README-uz.md)
|
||||
- [বাংলা - Bangla](translations/README-bn.md)
|
||||
- [ខ្មែរ - Khmer](translations/README-kh.md)
|
||||
- [中文版本](translations/README-cn.md)
|
||||
- [繁體中文](translations/README-tw.md)
|
||||
</details>
|
||||
|
||||
<details>
|
||||
<summary>Übersetzungen in Bearbeitung:</summary>
|
||||
|
||||
- [हिन्दी](https://github.com/jwasham/coding-interview-university/issues/81)
|
||||
- [עברית](https://github.com/jwasham/coding-interview-university/issues/82)
|
||||
- [Bahasa Indonesia](https://github.com/jwasham/coding-interview-university/issues/101)
|
||||
- [Afrikaans](https://github.com/jwasham/coding-interview-university/issues/1164)
|
||||
- [Arabic](https://github.com/jwasham/coding-interview-university/issues/98)
|
||||
- [Turkish](https://github.com/jwasham/coding-interview-university/issues/90)
|
||||
- [French](https://github.com/jwasham/coding-interview-university/issues/89)
|
||||
- [Russian](https://github.com/jwasham/coding-interview-university/issues/87)
|
||||
- [Ukrainian](https://github.com/jwasham/coding-interview-university/issues/106)
|
||||
- [Korean(한국어)](https://github.com/jwasham/coding-interview-university/issues/118)
|
||||
- [Telugu](https://github.com/jwasham/coding-interview-university/issues/117)
|
||||
- [Polish](https://github.com/jwasham/coding-interview-university/issues/122)
|
||||
- [Urdu](https://github.com/jwasham/coding-interview-university/issues/140)
|
||||
- [Thai](https://github.com/jwasham/coding-interview-university/issues/156)
|
||||
- [Greek](https://github.com/jwasham/coding-interview-university/issues/166)
|
||||
- [Italian](https://github.com/jwasham/coding-interview-university/issues/170)
|
||||
- [Italian](https://github.com/jwasham/coding-interview-university/issues/1030)
|
||||
- [Korean(한국어)](https://github.com/jwasham/coding-interview-university/issues/118)
|
||||
- [Malayalam](https://github.com/jwasham/coding-interview-university/issues/239)
|
||||
- [Japanese (日本語)](https://github.com/jwasham/coding-interview-university/issues/257)
|
||||
|
||||
- [Persian - Farsi](https://github.com/jwasham/coding-interview-university/issues/186)
|
||||
- [Telugu](https://github.com/jwasham/coding-interview-university/issues/117)
|
||||
- [Thai](https://github.com/jwasham/coding-interview-university/issues/156)
|
||||
- [Turkish](https://github.com/jwasham/coding-interview-university/issues/90)
|
||||
- [Українська](https://github.com/jwasham/coding-interview-university/issues/106)
|
||||
- [עברית](https://github.com/jwasham/coding-interview-university/issues/82)
|
||||
- [हिन्दी](https://github.com/jwasham/coding-interview-university/issues/81)
|
||||
</details>
|
||||
|
||||
<div align="center">
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
## Worum es geht
|
||||
|
||||
Das ist mein mehrmonatiger Lehrplan um sich vom Web Developer (Selbststudium, kein Abschluss in Informatik) zum Softwareingenieur bei einer großen Firma zu entwickeln.
|
||||
|
|
@ -225,7 +239,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`
|
||||
|
||||
|
|
@ -257,7 +271,6 @@ keinen Zugriff darauf.
|
|||
|
||||
- [ ] [ABC: Always Be Coding](https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.4heg8zvm4)
|
||||
- [ ] [Whiteboarding](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1)
|
||||
- [ ] [Effective Whiteboarding during Programming Interviews](http://www.coderust.com/blog/2014/04/10/effective-whiteboarding-during-programming-interviews/)
|
||||
- [ ] [Demystifying Tech Recruiting](https://www.youtube.com/watch?v=N233T0epWTs)
|
||||
- [ ] Cracking The Coding Interview Teil 1:
|
||||
- [ ] [Gayle L McDowell - Cracking The Coding Interview (video)](https://www.youtube.com/watch?v=rEJzOhC5ZtQ)
|
||||
|
|
@ -433,8 +446,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.
|
||||
|
||||
|
|
@ -543,6 +556,7 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
- [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/)
|
||||
- [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/)
|
||||
- [ ] [Spickzettel](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
|
||||
</details>
|
||||
|
|
@ -557,12 +571,8 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
- [ ] Beschreibung:
|
||||
- [Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays)
|
||||
- [UC Berkeley CS61B - Linear and Multi-Dim Arrays (video)](https://archive.org/details/ucberkeley_webcast_Wp8oiO_CZZE) (Start watching from 15m 32s)
|
||||
- [Basic Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_04-basicArrays.mp4)
|
||||
- [Multi-dim (video)](https://archive.org/details/0102WhatYouShouldKnow/02_05-multidimensionalArrays.mp4)
|
||||
- [Dynamic Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays)
|
||||
- [Jagged Arrays (video)](https://www.youtube.com/watch?v=1jtrQqYpt7g)
|
||||
- [Jagged Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_06-jaggedArrays.mp4)
|
||||
- [Resizing arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/03_01-resizableArrays.mp4)
|
||||
- [ ] Implementiere ein Vektor (veränderbares Array, das automatisch seine Größe verändert):
|
||||
- [ ] Übe Arrays und Pointer (Zeiger) zu coden, und benutze Pointerberechnung, um ein Element aus einem Array auszuwählen statt den Index zu benutzen.
|
||||
- [ ] neues Rohdaten-Array mit allokierten Speicher
|
||||
|
|
@ -594,6 +604,7 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists)
|
||||
- [ ] [CS 61B - Linked Lists 1 (video)](https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0)
|
||||
- [ ] [CS 61B - Linked Lists 2 (video)](https://archive.org/details/ucberkeley_webcast_-c4I3gFYe3w)
|
||||
- [ ] [[Review] Linked lists in 4 minutes (video)](https://youtu.be/F8AbOfQwl1c)
|
||||
- [ ] [C Code (video)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
|
||||
- nicht das ganze Video nur die Teile über Knotenstruktur und Speicherverwaltung.
|
||||
- [ ] Linked Lists vs Arrays:
|
||||
|
|
@ -625,14 +636,13 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
|
||||
- ### Stack (Stapel)
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [Using Stacks Last-In First-Out (video)](https://archive.org/details/0102WhatYouShouldKnow/05_01-usingStacksForLast-inFirst-out.mp4)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Werde ich nicht implementieren. Implementierung mittels Array ist trivial.
|
||||
|
||||
- ### Queue (Warteschlangen)
|
||||
- [ ] [Using Queues First-In First-Out(video)](https://archive.org/details/0102WhatYouShouldKnow/05_03-usingQueuesForFirst-inFirst-out.mp4)
|
||||
- [ ] [Queue (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [Priority Queues (video)](https://archive.org/details/0102WhatYouShouldKnow/05_04-priorityQueuesAndDeques.mp4)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] Implementierung mittels verketteten Listen, mit Tail-Pointer:
|
||||
- enqueue(value) - fügt Wert am Ende ein
|
||||
- dequeue() - gibt das älteste Element (am Anfang der Liste) zurück und löscht es
|
||||
|
|
@ -657,12 +667,9 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
- [ ] [PyCon 2010: The Mighty Dictionary (video)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
|
||||
- [ ] [(Advanced) Randomization: Universal & Perfect Hashing (video)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(Advanced) Perfect hashing (video)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4)
|
||||
- [ ] [[Review] Hash tables in 4 minutes (video)](https://youtu.be/knV86FlSXJ8)
|
||||
|
||||
- [ ] Online Kurse:
|
||||
- [ ] [Understanding Hash Functions (video)](https://archive.org/details/0102WhatYouShouldKnow/06_02-understandingHashFunctions.mp4)
|
||||
- [ ] [Using Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_03-usingHashTables.mp4)
|
||||
- [ ] [Supporting Hashing (video)](https://archive.org/details/0102WhatYouShouldKnow/06_04-supportingHashing.mp4)
|
||||
- [ ] [Language Support Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_05-languageSupportForHashTables.mp4)
|
||||
- [ ] [Core Hash Tables (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables)
|
||||
- [ ] [Data Structures (video)](https://www.coursera.org/learn/data-structures/home/week/3)
|
||||
- [ ] [Phone Book Problem (video)](https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem)
|
||||
|
|
@ -688,12 +695,13 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
- [ ] [Binary Search (video)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [Binary Search (video)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [Details](https://www.topcoder.com/community/competitive-programming/tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Implementierung:
|
||||
- Binärsuche (auf einem sortierten Array von Ganzzahlen)
|
||||
- Binärsuche mittels Rekursion
|
||||
|
||||
- ### Bitweise Operationen
|
||||
- [ ] [Bits Spickzettel](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.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:
|
||||
|
|
@ -727,7 +735,6 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
<summary>Trees (Bäume)</summary>
|
||||
|
||||
- ### Trees - Notizen und Hintergrund
|
||||
- [ ] [Series: Core Trees (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees)
|
||||
- [ ] [Series: Trees (video)](https://www.coursera.org/learn/data-structures/lecture/95qda/trees)
|
||||
- generell Baumerstellung
|
||||
- Traversieren (Durchlaufen)
|
||||
|
|
@ -745,6 +752,9 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
- inorder (DFS: links, selber, rechts)
|
||||
- postorder (DFS: links, rechts, selber)
|
||||
- preorder (DFS: selber, links, rechts)
|
||||
- [ ] [[Review] Breadth-first search in 4 minutes (video)](https://youtu.be/HZ5YTanv5QE)
|
||||
- [ ] [[Review] Depth-first search in 4 minutes (video)](https://youtu.be/Urx87-NMm6c)
|
||||
- [ ] [[Review] Tree Traversal (playlist) in 11 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b)
|
||||
|
||||
- ### Binary search trees: BSTs (Binäre Suchbäume)
|
||||
- [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -792,6 +802,7 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
- [ ] [MIT: Heaps and Heap Sort (video)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B Lecture 24: Priority Queues (video)](https://archive.org/details/ucberkeley_webcast_yIUFT6AKBGE)
|
||||
- [ ] [Linear Time BuildHeap (max-heap)](https://www.youtube.com/watch?v=MiyLo8adrWw)
|
||||
- [ ] [[Review] Heap (playlist) in 13 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNsyqgPW-DNwUeT8F8uhWc6)
|
||||
- [ ] Implementierung eines Max-Heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - gebraucht fürs Einfügen
|
||||
|
|
@ -862,6 +873,14 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit
|
|||
- [ ] [Implementation (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c)
|
||||
- [ ] [Implementation (Python)](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py)
|
||||
|
||||
- [ ] [[Review] Sorting (playlist) in 18 minutes](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOZSbGAXAPIq1BeUf4j20pl)
|
||||
- [ ] [Quick sort in 4 minutes (video)](https://youtu.be/Hoixgm4-P4M)
|
||||
- [ ] [Heap sort in 4 minutes (video)](https://youtu.be/2DmK_H7IdTo)
|
||||
- [ ] [Merge sort in 3 minutes (video)](https://youtu.be/4VqmGXwpLqc)
|
||||
- [ ] [Bubble sort in 2 minutes (video)](https://youtu.be/xli_FI7CuzA)
|
||||
- [ ] [Selection sort in 3 minutes (video)](https://youtu.be/g-PGLbMth_g)
|
||||
- [ ] [Insertion sort in 2 minutes (video)](https://youtu.be/JU767SDMDvA)
|
||||
|
||||
- [ ] Implementierung:
|
||||
- [ ] Mergesort: O(n log n) Durchschnitt und worst case
|
||||
- [ ] Quicksort O(n log n) Durchschnitt
|
||||
|
|
@ -930,6 +949,8 @@ Graphen können genutzt werden, um damit viele verschiedene Probleme in der Info
|
|||
- [ ] [CS 61B 2014: Weighted graphs (video)](https://archive.org/details/ucberkeley_webcast_zFbq8vOZ_0k)
|
||||
- [ ] [Greedy Algorithms: Minimum Spanning Tree (video)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||
- [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (video)](https://www.youtube.com/watch?v=RpgcYiky7uw)
|
||||
- [ ] [[Review] Shortest Path Algorithms (playlist) in 16 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO-Y-H3xIC9DGSfVYJng9Yw)
|
||||
- [ ] [[Review] Minimum Spanning Trees (playlist) in 4 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZObEi3Hf6lmyW-CBfs7nkOV)
|
||||
|
||||
- Kompletter Coursera Kurs:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -966,7 +987,7 @@ Graphen können genutzt werden, um damit viele verschiedene Probleme in der Info
|
|||
- wann sollte man es benutzen
|
||||
- Wann ist Endrekursion gut?
|
||||
- [ ] [What Is Tail Recursion Why Is It So Bad?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad)
|
||||
- [ ] [Tail Recursion (video)](https://www.youtube.com/watch?v=L1jjXGfxozc)
|
||||
- [ ] [Tail Recursion (video)](https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1)
|
||||
|
||||
- ### Dynamische Programming
|
||||
- Wahrscheinlich wirst du im Vorstellungsgespräch nichts mit dynamischer Programmierung zu tun haben, aber es ist wert zu erkennen, wann ein Problem für dynamische Programmierung geeignet ist.
|
||||
|
|
@ -1309,7 +1330,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
|
||||
|
|
@ -1353,8 +1374,9 @@ Graphen können genutzt werden, um damit viele verschiedene Probleme in der Info
|
|||
|
||||
- [ ] Reihe mit kurzen 2-3 Minuten Videos (23 videos)
|
||||
- [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Reihe mit kurzen 2-5 Minuten Videos - Michael Sambol (18 videos):
|
||||
- [Videos](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] Reihe mit kurzen 2-5 Minuten Videos - Michael Sambol (48 videos):
|
||||
- [Videos](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
- [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1)
|
||||
- [ ] [Sedgewick Videos - Algorithms II](https://www.coursera.org/learn/algorithms-part2)
|
||||
|
||||
|
|
@ -1395,7 +1417,6 @@ Zusatz:
|
|||
- [Mathematics for Topcoders](https://www.topcoder.com/community/competitive-programming/tutorials/mathematics-for-topcoders/)
|
||||
- [Dynamic Programming – From Novice to Advanced](https://www.topcoder.com/community/competitive-programming/tutorials/dynamic-programming-from-novice-to-advanced/)
|
||||
- [MIT Interview Materials](https://web.archive.org/web/20160906124824/http://courses.csail.mit.edu/iap/interview/materials.php)
|
||||
- [Exercises for getting better at a given language](http://exercism.io/languages)
|
||||
|
||||
**Lese und löse Programmieraufgaben (in dieser Reihenfolge):**
|
||||
|
||||
|
|
@ -1433,7 +1454,7 @@ Wettbewerbsseiten:
|
|||
- [Codility](https://codility.com/programmers/)
|
||||
- [InterviewCake](https://www.interviewcake.com/)
|
||||
- [Geeks for Geeks](http://www.geeksforgeeks.org/)
|
||||
- [InterviewBit](https://www.interviewbit.com/invite/icjf)
|
||||
- [InterviewBit](https://www.interviewbit.com)
|
||||
- [Sphere Online Judge (spoj)](http://www.spoj.com/)
|
||||
- [Codechef](https://www.codechef.com/)
|
||||
|
||||
|
|
@ -1441,7 +1462,7 @@ Wettbewerbsrepos:
|
|||
- [Interactive Coding Interview Challenges in Python](https://github.com/donnemartin/interactive-coding-challenges)
|
||||
|
||||
Mock Interviews:
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/) - Das habe ich benutzt und es hat mir dabei geholfen vor den Telefon- und Vor-Ort-Gesprächen besser zu entspannen.
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/) - Das habe ich benutzt und es hat mir dabei geholfen vor den Telefon- und Vor-Ort-Gesprächen besser zu entspannen.
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/) - peer-to-peer Modell um Vorstellungsgespräche zu üben
|
||||
- [Refdash: Mock interviews and expedited interviews](https://refdash.com/) - hilft auch Kandidaten den Prozess zu beschleunigen indem mehrere Vorstellungsgespräche bei Techfirmen übersprungen werden.
|
||||
|
||||
|
|
@ -1600,7 +1621,6 @@ Algorithmen Bescheid wisst, sodass ihr eine größere Auswahl an Werkzeugen habt
|
|||
- [Emacs Tutorial (Beginners) -Part 3- Expressions, Statements, ~/.emacs file and packages](https://www.youtube.com/watch?v=paSgzPso-yc)
|
||||
- [Evil Mode: Or, How I Learned to Stop Worrying and Love Emacs (video)](https://www.youtube.com/watch?v=JWD1Fpdd4Pc)
|
||||
- [Writing C Programs With Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs)
|
||||
- [(maybe) Org Mode In Depth: Managing Structure (video)](https://www.youtube.com/watch?v=nsGYet02bEk)
|
||||
|
||||
- ### Unix Kommandozeilenwerkzeuge
|
||||
- Ich habe in die Liste unten nützliche Werkzeuge gepackt.
|
||||
|
|
@ -1761,6 +1781,7 @@ Algorithmen Bescheid wisst, sodass ihr eine größere Auswahl an Werkzeugen habt
|
|||
- [ ] [AVL Trees (video)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
||||
- [ ] [AVL Tree Implementation (video)](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation)
|
||||
- [ ] [Split And Merge](https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge)
|
||||
- [ ] [[Review] AVL Trees (playlist) in 19 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOUFgdIeOPuH6cfSnNRMau-)
|
||||
|
||||
- [ ] **Splay Trees**
|
||||
- In der Praxis:
|
||||
|
|
@ -1785,7 +1806,8 @@ Algorithmen Bescheid wisst, sodass ihr eine größere Auswahl an Werkzeugen habt
|
|||
- [ ] [Aduni - Algorithms - Lecture 4 (Link springt direkt zum Anfang) (video)](https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871)
|
||||
- [ ] [Aduni - Algorithms - Lecture 5 (video)](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5)
|
||||
- [ ] [Red-Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree)
|
||||
- [ ] [An Introduction To Binary Search And Red Black Tree](https://www.topcoder.com/community/competitive-programming/tutorials/an-introduction-to-binary-search-and-red-black-trees/)
|
||||
- [ ] [An Introduction To Binary Search And Red Black Tree](https://www.topcoder.com/thrive/articles/An%20Introduction%20to%20Binary%20Search%20and%20Red-Black%20Trees)
|
||||
- [[Review] Red-Black Trees (playlist) in 30 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNqDI8qfOZgzbqahCUmUEin)
|
||||
|
||||
- [ ] **2-3 Bäume**
|
||||
- In der Praxis:
|
||||
|
|
@ -1826,6 +1848,7 @@ Algorithmen Bescheid wisst, sodass ihr eine größere Auswahl an Werkzeugen habt
|
|||
- [ ] [MIT 6.851 - Memory Hierarchy Models (video)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
- behandelt cache-oblivious B-Bäume, sehr interessante Datenstrukturen
|
||||
- die ersten 37 Minuten sind sehr technisch, können übersprungen werden (B ist Blockgröße, Cache Zeilen Länge)
|
||||
- [[Review] B-Trees (playlist) in 26 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz)
|
||||
|
||||
|
||||
- ### k-D Bäume
|
||||
|
|
@ -1890,7 +1913,6 @@ Algorithmen Bescheid wisst, sodass ihr eine größere Auswahl an Werkzeugen habt
|
|||
- [Google's Deep Learning Nanodegree](https://www.udacity.com/course/deep-learning--ud730)
|
||||
- [Google/Kaggle Machine Learning Engineer Nanodegree](https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009)
|
||||
- [Self-Driving Car Engineer Nanodegree](https://www.udacity.com/drive)
|
||||
- [Metis Online Course ($99 for 2 months)](http://www.thisismetis.com/explore-data-science)
|
||||
- Quellen:
|
||||
- Bücher:
|
||||
- [Python Machine Learning](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/)
|
||||
|
|
@ -1995,7 +2017,7 @@ Zurücklehnen und genießen. "Netflix and skill" :P
|
|||
|
||||
- [ ] [Computer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory](http://www.infocobuild.com/education/audio-video-courses/computer-science/cs70-spring2015-berkeley.html)
|
||||
|
||||
- [ ] [Discrete Mathematics von Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PL3o9D4Dl2FJ9q0_gtFXPh_H4POI5dK0yG)
|
||||
- [ ] [Discrete Mathematics von Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PLWX710qNZo_sNlSWRMVIh6kfTjolNaZ8t)
|
||||
|
||||
- [ ] [Discrete Mathematics Part 1 von Sarada Herke (5 videos)](https://www.youtube.com/playlist?list=PLGxuz-nmYlQPOc4w1Kp2MZrdqOOm4Jxeo)
|
||||
|
||||
|
|
@ -2036,7 +2058,7 @@ Zurücklehnen und genießen. "Netflix and skill" :P
|
|||
|
||||
- [ ] [MIT 6.858 Computer Systems Security, Fall 2014](https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/view_play_list?p=9D558D49CA734A02)
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/playlist?list=PL9D558D49CA734A02)
|
||||
|
||||
- [ ] [Introduction to Cryptography von Christof Paar](https://www.youtube.com/playlist?list=PL6N5qY2nvvJE8X75VkXglSrVhLv1tVcfy)
|
||||
- [KurswWebseite mit Folien und Problemstellungen](http://www.crypto-textbook.com/)
|
||||
|
|
|
|||
|
|
@ -0,0 +1,660 @@
|
|||
#Coding Interview University
|
||||
|
||||
>Επίσημη έκδοση: [Αγγλικά](https://github.com/jwasham/coding-interview-university/blob/master/README.md)
|
||||
|
||||
## Τι είναι
|
||||
|
||||
Είναi το πλάνο διαβάσματός μου για να γίνω από web developer (αυτοδίδακτος, χωρίς πτυχίο στην Επιστήμη των Υπολογιστών), μηχανικός λογισμικού για μία μεγάλη εταιρία.
|
||||
|
||||
|
||||
|
||||
Αυτό το έργο προορίζεται για νέους μηχανικούς λογισμικού ή για αυτούς που μεταβαίνουν από την ανάπτυξη λογισμικού/ιστοσελίδων στην τεχνολογία λογισμικού(εκεί που η γνώση για την επιστήμη των υπολογιστών ειναι προαπαιτούμενο). Αν έχεις αρκετά χρόνια εμπειρίας και αξιώνεις πολλά χρόνια εμπερίας στην τεχνολογία λογισμικού, πρέπει να περιμένεις μία δυσκολότερη συνέντευξη.
|
||||
|
||||
Εάν έχεις αρκετά χρόνια εμπειρίας στην ανάπτυξη λογισμικού/ιστοσελίδων, σημείωσε ότι οι μεγάλες εταιρίες λογισμικού όπως οι Google, Amazon, Facebook και Microsoft βλέπουν την τεχνολογία λογισμικού ως ενα διαφορετικό κομμάτι από την ανάπτυξη λογισμικού/ιστοσελίδων, και απαιτούν γνώσεις πάνω στην επιστήμη υπολογιστών.
|
||||
|
||||
Εάν θέλεις να είσαι ένας αξιόπιστος μηχανικός ή μηχανικός συστημάτων, διάβασε περισσότερο απο την προεραιτική λίστα(δίκτυα, ασφάλεια).
|
||||
|
||||
---
|
||||
# Πίνακας περιεχομένων
|
||||
|
||||
- [Τι είναι](#Tι-είναι)
|
||||
- [Γιατί να το χρησιμοποιήσεις](#Γιατί-να-το-χρησιμοποιήσεις)
|
||||
- [Πώς να το χρησιμοποιήσεις](#Πώς-να-το-χρησιμοποιήσεις)
|
||||
- [Μη νιώθεις ανίκανος](#Μη-νιώθεις-ανίκανος)
|
||||
- [Σχετικά με τα βίντεο](#Σχετικά-με-τα-βίντεο)
|
||||
- [Διαδικασία Συνέντευξης & Γενική προετοιμασία συνέντευξης](#Διαδικασία-Συνέντευξης--Γενική-προετοιμασία-συνέντευξης)
|
||||
- [Διάλεξε μία γλώσσα για τη συνέντευξη](#Διάλεξε-μία-γλώσσα-για-τη-συνέντευξη)
|
||||
- [Λίστα βιβλίων](#Λίστα-βιβλίων)
|
||||
- [Πριν αρχίσεις](#Πριν-αρχίσεις)
|
||||
- [Τι δε θα δεις να καλύπτετε](#Τι-δε-θα-δεις-να-καλύπτετε)
|
||||
- [Προαπαιτούμενη γνώση](#Προαπαιτούμενη-γνώση)
|
||||
- [Το καθημερινό πλάνο](#Το-καθημερινό-πλάνο)
|
||||
- [Αλγοριθμική πολυπλοκότητα / Big-O / Ασυμπτωτική ανάλυση](#Αλγοριθμική-πολυπλοκότητα--Big-O--Ασυμπτωτική-ανάλυση)
|
||||
- [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)
|
||||
|
||||
---
|
||||
|
||||
## Γιατί να το χρησιμοποιήσεις
|
||||
|
||||
Όταν άρχισα αυτό το πρότζεκτ, δεν ήξερα τη διαφορά μίας στοίβας από μία ουρά, δεν ήξερα τίποτα σχετικά με τον συμβολισμό Big-Ο, τίποτα σχετικά με τα δέντρα ή πως να διασχίσω ένα δέντρο. Εάν έπρεπε να γράψω σε κώδικα έναν αλγόριθμο ταξινόμησης, μπορώ να σου πω ότι δεν θα ήταν πολύ καλός. Κάθε δομή δεδομένων που είχα χρησιμοποιήσει ήταν πακέτο της γλώσσας, και δεν ήξερα καθόλου πως δούλευαν "κάτω από το καπό". Ποτέ δεν είχα να διαχειριστώ τη μνήμη εκτός εάν μία διεργασία που έτρεχα, μου επέστρεφε ένα σφάλμα του τύπου: "out of memory", και μετά έπρεπε να βρώ μία λύση. Έχω χρησιμοποιήσει μερικούς πολυδιάστατους πίνακες στη ζωή μου και χιλιάδες συναφείς πίνακες, αλλά δεν είχα δημιουργήσει δομές δεδομένων από το 0.
|
||||
|
||||
Είναι ένα μακροπρόθεσμο πλάνο. Μπορεί να σου πάρει μήνες. Εάν είσαι οικείος με πολλά από αυτά ήδη, θα σου πάρει πολύ λιγότερο χρόνο.
|
||||
|
||||
## Πώς να το χρησιμοποιήσεις
|
||||
|
||||
Οτιδήποτε παρακάτω είναι μία συνοπτική περιγραφή, και πρέπει να τα καταλάβεις από την αρχή μέχρι το τέλος.
|
||||
|
||||
Χρησιμοποιώ τη χαρακτηρηστική markdown γλώσσα του Github, σεμπεριλαμβανομένων και των tasks lists για να ελέγχω την εξέλιξη του πρότζεκτ.
|
||||
|
||||
**Δημιούργησε ένα καινούργιο branch [x]**
|
||||
|
||||
|
||||
Κάνε fork το branch και ακολούθησε τις παρακάτω εντολές
|
||||
|
||||
`git checkout -b progress`
|
||||
|
||||
`git remote add jwasham https://github.com/jwasham/coding-interview-university`
|
||||
|
||||
`git fetch --all`
|
||||
|
||||
Μάρκαρε όλα τα κουτιά με X αφού ολοκληρώσεις τις αλλαγές
|
||||
|
||||
`git add . `
|
||||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
|
||||
`git push --force `
|
||||
|
||||
[Περισσότερα σχετικά με την Github-flavored markdown](https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown)
|
||||
|
||||
## Μη νιώθεις ανίκανος
|
||||
- Οι επιτυχυμένοι μηχανικοί λογισμικού είναι έξυπνοι, αλλά πολλοί έχουν την ανασφάλεια ότι δεν είναι αρκετά έξυπνοι.
|
||||
- [The myth of the Genius Programmer](https://www.youtube.com/watch?v=0SARbwvhupQ)
|
||||
- [It's Dangerous to Go Alone: Battling the Invisible Monsters in Tech](https://www.youtube.com/watch?v=1i8ylq4j_EY)
|
||||
|
||||
## Σχετικά με τα βίντεο
|
||||
|
||||
Μερικά βίντεο είναι διαθέσιμα μόνο κάνοντας εγγραφή σε μία Coursera, EdX, or Lynda.com τάξη. Αυτές καλούνται MOOCs.
|
||||
Μερικές φορές οι τάξεις δεν είναι διαθέσιμες, έτσι πρέπει να περιμένεις 1-2 μήνες, έτσι ώστε να αποκτήσεις πρόσβαση. Τα μαθήματα του Lynada.com δεν είναι δωρεάν.
|
||||
|
||||
Θα εκτιμούσα τη βοήθεια σου να προσθέσεις δωρεάν και πάντοτε-διαθέσιμες ανοικτές πηγές, όπως βίντεο από το Youtube να συνοδεύσουν τα online μαθήματα βίντεο.
|
||||
Μου αρέσει να χρησιμοποιώ πανεπιστημιακές διαλέξεις.
|
||||
|
||||
## Διαδικασία Συνέντευξης & Γενική προετοιμασία συνέντευξης
|
||||
|
||||
- [ ] [ABC: Always Be Coding](https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.4heg8zvm4)
|
||||
- [ ] [Whiteboarding](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1)
|
||||
- [ ] [Demystifying Tech Recruiting](https://www.youtube.com/watch?v=N233T0epWTs)
|
||||
- [ ] Cracking The Coding Interview Set 1:
|
||||
- [ ] [Gayle L McDowell - Cracking The Coding Interview (video)](https://www.youtube.com/watch?v=rEJzOhC5ZtQ)
|
||||
- [ ] [Cracking the Coding Interview with Author Gayle Laakmann McDowell (video)](https://www.youtube.com/watch?v=aClxtDcdpsQ)
|
||||
- [ ] How to Get a Job at the Big 4:
|
||||
- [ ] [How to Get a Job at the Big 4 - Amazon, Facebook, Google & Microsoft (video)](https://www.youtube.com/watch?v=YJZCUhxNCv8)
|
||||
|
||||
- [ ] Μαθήματα προετοιμασίας:
|
||||
- [ ] [Software Engineer Interview Unleashed (paid course)](https://www.udemy.com/software-engineer-interview-unleashed):
|
||||
- Learn how to make yourself ready for software engineer interviews from a former Google interviewer.
|
||||
- [ ] [Python for Data Structures, Algorithms, and Interviews! (paid course)](https://www.udemy.com/python-for-data-structures-algorithms-and-interviews/):
|
||||
- A Python centric interview prep course which covers data structures, algorithms, mock interviews and much more.
|
||||
|
||||
## Διάλεξε μία γλώσσα για τη συνέντευξη
|
||||
|
||||
Μπορείς να χρησιμοποιήσεις μία γλώσσα με την οποία είσαι άνετος για να κάνεις το προγραμματιστικό κομμάτι της συνέντευξης, αλλά για τις μεγάλες εταιρίες, υπάρχουν ατόφιες επιλογές:
|
||||
|
||||
- C++
|
||||
- Java
|
||||
- Python
|
||||
|
||||
Μπορείς, επίσης, να χρησιμοποιήσεις αυτές, αλλά διάβασε γύρω από αυτό πρώτα. Μπορεί να υπάρχουν προειδοποιήσεις:
|
||||
|
||||
- Javascript
|
||||
- Ruby
|
||||
|
||||
Πρέπει να είσαι πολύ εξοικιωμένος με τη γλώσσα και γνώστης.
|
||||
|
||||
Διάβασε περισσότερα σχετικά με τις παραπάνω επιλογές:
|
||||
- http://www.byte-by-byte.com/choose-the-right-language-for-your-coding-interview/
|
||||
- http://blog.codingforinterviews.com/best-programming-language-jobs/
|
||||
|
||||
[Βρες πόρους για τη γλώσσα εδώ](programming-language-resources.md)
|
||||
|
||||
Θα δείς λίγη γνώση σχετικά με τις C, C++ και Python να περιέχεται παρακάτω, επείδη μαθαίνω. Υπάρχουν μερικά εμπλεκόμενα βιβλία, δες το κάτω μέρος.
|
||||
|
||||
## Λίστα βιβλίων
|
||||
|
||||
- [ ] [Programming Interviews Exposed: Secrets to Landing Your Next Job, 2nd Edition](http://www.wiley.com/WileyCDA/WileyTitle/productCd-047012167X.html)
|
||||
- απαντήσεις στην C++ και στην Java
|
||||
- αυτό είναι ένα καλό ζέσταμα για να είσαι άριστος/η στο Coding Interview
|
||||
- όχι τόσο δύσκολο, τα περισσότερα προβλήματα ίσως είναι ευκολότερα από ότι θα δείς στην συνέντευξη (από αυτά που έχω διαβάσει)
|
||||
- [ ] [Cracking the Coding Interview, 6th Edition](http://www.amazon.com/Cracking-Coding-Interview-6th-Programming/dp/0984782850/)
|
||||
- απαντήσεις στην Java
|
||||
|
||||
Εάν έχεις αρκετό ελεύθερο χρόνο:
|
||||
|
||||
- [ ] [Elements of Programming Interviews (C++ version)](https://www.amazon.com/Elements-Programming-Interviews-Insiders-Guide/dp/1479274836)
|
||||
- [ ] [Elements of Programming Interviews (Java version)](https://www.amazon.com/Elements-Programming-Interviews-Java-Insiders/dp/1517435803/)
|
||||
|
||||
### Αρχιτεκτονική Υπολογιστών
|
||||
|
||||
Αν έχεις λίγο χρόνο:
|
||||
|
||||
- [ ] [Write Great Code: Volume 1: Understanding the Machine](https://www.amazon.com/Write-Great-Code-Understanding-Machine/dp/1593270038)
|
||||
- Το βιβλίο δημοσιεύτηκε το 2004, και είναι λίγο απαρχεωμένο, αλλά είναι ένας υπέροχος πόρος για να κατανοήσεις έναν υπολογιστή εν συντομία.
|
||||
- Ο συγγραφέας εφηύρε το HLA, έτσι μην παίρνεις τις αναφορές του και παραδείγματά του για το HLA, τοις μετρητοίς.
|
||||
- Αυτά τα κεφάλαια αξίζουν το διάβασμα για να σου δώσουν ισχυρά θεμέλια:
|
||||
- Chapter 2 - Numeric Representation
|
||||
- Chapter 3 - Binary Arithmetic and Bit Operations
|
||||
- Chapter 4 - Floating-Point Representation
|
||||
- Chapter 5 - Character Representation
|
||||
- Chapter 6 - Memory Organization and Access
|
||||
- Chapter 7 - Composite Data Types and Memory Objects
|
||||
- Chapter 9 - CPU Architecture
|
||||
- Chapter 10 - Instruction Set Architecture
|
||||
- Chapter 11 - Memory Architecture and Organization
|
||||
|
||||
Αν έχεις αρκετό χρόνο (Το θέλω αυτό το βιβλίο):
|
||||
|
||||
- [ ] [Computer Architecture, Fifth Edition: A Quantitative Approach](https://www.amazon.com/dp/012383872X/)
|
||||
- Για μία πλουσιότερη, περισσότερο ενημερωμένη (2011), αλλά εκτενέστερη αντιμετώπιση
|
||||
|
||||
### Συγκεκριμένη γλώσσα
|
||||
|
||||
**Θα πρέπει να επιλέξεις μία γλώσσα για τη συνέντευξη (δες παραπάνω).** Εδώ είναι οι προτάσεις μου ανά γλώσσα. Δεν έχω τους πόρους για όλες τις γλώσσες. Καλοδεχούμενες οι προσθήκες.
|
||||
|
||||
Εάν διαβάσεις μία από αυτές, θα πρέπει να έχεις όλη την γνώση σχετικά με δομές δεδομένων και αλγόριθμους που θα χρειαστείς για να αρχίσεις να λύνεις προβλήματα προγραμματισμού.
|
||||
**Μπορείς να παραλείψεις όλες τα βίντεο-διαλέξεις που περιέχονται σε αυτό το πρότζεκτ**, εκτός εάν θέλεις να κάνεις μία ανασκόπηση.
|
||||
|
||||
[Επιπρόσθετοι πόροι που αφορούν συγκεκριμένες γλώσσες εδώ.](programming-language-resources.md)
|
||||
|
||||
### C++
|
||||
|
||||
Δεν έχω διαβάσει αυτά τα δύο, αλλά έχουν λάβει υψηλές αξιολογήσεις και έχουν γραφτεί από τον Sedgewick. Είναι φοβερός.
|
||||
|
||||
- [ ] [Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching](https://www.amazon.com/Algorithms-Parts-1-4-Fundamentals-Structure/dp/0201350882/)
|
||||
- [ ] [Algorithms in C++ Part 5: Graph Algorithms](https://www.amazon.com/Algorithms-Part-Graph-3rd-Pt-5/dp/0201361183/)
|
||||
|
||||
Εάν έχεις μία καλύτερη πρόταση για τη C++, παρακαλώ ενημέρωσέ με. Ψάχνοντας για έναν περιεκτικό πόρο.
|
||||
|
||||
### Java
|
||||
|
||||
- [ ] [Αλγόριθμοι σε Java(Sedgewick)](http://www.skroutz.gr/books/142957.%CE%91%CE%BB%CE%B3%CF%8C%CF%81%CE%B9%CE%B8%CE%BC%CE%BF%CE%B9-%CF%83%CE%B5-Java.html)
|
||||
- Διδάσκεται στο Τμήμα Πληροφορικής του Οικονομικού Πανεπιστημίου Αθηνών
|
||||
- βιντεο με το περιεχόμενο του βιβλίου (and Sedgewick!):
|
||||
- [Algorithms I](https://www.youtube.com/user/algorithmscourses/playlists?view=50&sort=dd&shelf_id=2)
|
||||
- [Algorithms II](https://www.youtube.com/user/algorithmscourses/playlists?shelf_id=3&view=50&sort=dd)
|
||||
|
||||
Ή:
|
||||
|
||||
- [ ] [Data Structures and Algorithms in Java](https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/1118771338/)
|
||||
- by Goodrich, Tamassia, Goldwasser
|
||||
- used as optional text for CS intro course at UC Berkeley
|
||||
- see my book report on the Python version below. This book covers the same topics.
|
||||
|
||||
### Python
|
||||
|
||||
- [ ] [Data Structures and Algorithms in Python](https://www.amazon.com/Structures-Algorithms-Python-Michael-Goodrich/dp/1118290275/)
|
||||
- by Goodrich, Tamassia, Goldwasser
|
||||
- I loved this book. It covered everything and more.
|
||||
- Pythonic code
|
||||
- my glowing book report: https://startupnextdoor.com/book-report-data-structures-and-algorithms-in-python/
|
||||
|
||||
|
||||
### Προαιρετικά Βιβλία
|
||||
|
||||
**Ορισμένοι συστήνουν αυτά, αλλά το παρακάνουν, εκτός εάν έχεις πολλά χρόνια εμπειρίας και περιμένεις μία δυσκολότερη συνέντευξη:**
|
||||
|
||||
- [ ] [Algorithm Design Manual](http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1849967202) (Skiena)
|
||||
- As a review and problem recognition
|
||||
- The algorithm catalog portion is well beyond the scope of difficulty you'll get in an interview.
|
||||
- This book has 2 parts:
|
||||
- class textbook on data structures and algorithms
|
||||
- pros:
|
||||
- is a good review as any algorithms textbook would be
|
||||
- nice stories from his experiences solving problems in industry and academia
|
||||
- code examples in C
|
||||
- cons:
|
||||
- can be as dense or impenetrable as CLRS, and in some cases, CLRS may be a better alternative for some subjects
|
||||
- chapters 7, 8, 9 can be painful to try to follow, as some items are not explained well or require more brain than I have
|
||||
- don't get me wrong: I like Skiena, his teaching style, and mannerisms, but I may not be Stony Brook material.
|
||||
- algorithm catalog:
|
||||
- this is the real reason you buy this book.
|
||||
- about to get to this part. Will update here once I've made my way through it.
|
||||
- Can rent it on kindle
|
||||
- Half.com is a great resource for textbooks at good prices.
|
||||
- Answers:
|
||||
- [Solutions](http://www.algorithm.cs.sunysb.edu/algowiki/index.php/The_Algorithms_Design_Manual_(Second_Edition))
|
||||
- [Solutions](http://blog.panictank.net/category/algorithmndesignmanualsolutions/page/2/)
|
||||
- [Errata](http://www3.cs.stonybrook.edu/~skiena/algorist/book/errata)
|
||||
|
||||
- [ ] [Introduction to Algorithms](https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844)
|
||||
- **Important:** Reading this book will only have limited value. This book is a great review of algorithms and data structures, but won't teach you how to write good code. You have to be able to code a decent solution efficiently.
|
||||
- Half.com is a great resource for textbooks at good prices.
|
||||
- aka CLR, sometimes CLRS, because Stein was late to the game
|
||||
|
||||
- [ ] [Programming Pearls](http://www.amazon.com/Programming-Pearls-2nd-Jon-Bentley/dp/0201657880)
|
||||
- The first couple of chapters present clever solutions to programming problems (some very old using data tape) but
|
||||
that is just an intro. This a guidebook on program design and architecture, much like Code Complete, but much shorter.
|
||||
|
||||
- ~~"Algorithms and Programming: Problems and Solutions" by Shen~~
|
||||
- A fine book, but after working through problems on several pages I got frustrated with the Pascal, do while loops, 1-indexed arrays, and unclear post-condition satisfaction results.
|
||||
- Would rather spend time on coding problems from another book or online coding problems.
|
||||
|
||||
## Πριν αρχίσεις
|
||||
|
||||
Αυτή η λίστα αυξήθηκε με την περίοδο πολλών μηνών, και ναι, βρίσκεται εκτός ελέγχου.
|
||||
|
||||
Εδώ βρίσκονται κάποια λάθη που έκανα για να έχεις μία καλύτερη εμπειρία.
|
||||
|
||||
### 1. Δε θα το θυμάσαι καθόλου
|
||||
|
||||
Είδα αρκετές ώρες βίντεο και πήρα άφθονες σημειώσεις, κα μήνες μετά υπήρχαν πολλά τα οποία δεν θυμόμουν. Ξόδεψα 3 μέρες εξετάζοντας λεπτομερώς τις σημειώσεις μου και έκανα καρτέλες για να μπορούσα να τις αξιολογήσω.
|
||||
|
||||
Σε παρακαλώ διάβασε τα για να μην κανεις τα ίδια λάθη με τα δικά μου:
|
||||
|
||||
[Retaining Computer Science Knowledge](https://startupnextdoor.com/retaining-computer-science-knowledge/)
|
||||
|
||||
### 2. Χρησιμοποιήσε κάρτες σημειώσεων
|
||||
|
||||
Να λύνεις το πρόβλημα, Εγώ έκανα μία μικρή ιστοσελίδα με κάρτες σημειώσεων 2 τύπων: γενικές και κώδικα. Κάθε μία κάρτα έχει διαφορετικό φορμάτ.
|
||||
|
||||
Έκανα ένα mobile-first website για να μπορούσα να τις αξιολογήσω στο κινητό μου και στο tablet μου, όπου κι αν είμαι.
|
||||
|
||||
Φτιάξε το δικό σου δωρεάν:
|
||||
|
||||
- [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):
|
||||
|
||||
Θυμήσου ότι ξεπέρασα τα όρια και είχα κάρτες που κάλυπταν τα πάντα, από assembly και Python trivia έως και μηχανική μάθηση και στατιστική. Ήταν κάπως υπερβολικό από αυτό που χρειαζόταν.
|
||||
|
||||
**Σημείωσε στα flashcards:** Τον πρώτο καιρό θα αναγνωρίζεις ότι γνωρίζεις την απάντηση, μην την μαρκάρεις ως γνωστή. Έχεις να δεις την ίδια κάρτα και να την απαντήσεις αρκετές φορές σωστά πριν την κατανοήσεις πλήρως. Η επανάληψις είναι μήτηρ πάσης μαθήσεως!-Πλάτωνας.
|
||||
|
||||
Η εναλλακτική είναι να χρησιμοποιήσεις το δικό μου flashcard site: [Anki](http://ankisrs.net/), το οποίο έχει προταθεί σε εμένα αρκετές φορές. Χρησιμοποιεί ένα επαναληπτικό σύστημα για να σε βοηθήσει να θυμηθείς.
|
||||
Είναι φιλικό προς τον χρήστη, διαθέσιμο σε όλες τις πλατφόρμες και διαθέτει συγχρονισμό με το cloud. Κοστίζει 25$ για iOS αλλά είναι δωρεάν στις άλλες πλατφόρμες.
|
||||
|
||||
Η flashcard βάση δεδομένων μου σε φορμάτ Anki: https://ankiweb.net/shared/info/25173560 (thanks [@xiewenya](https://github.com/xiewenya))
|
||||
|
||||
### 3. Αναθεώρησε, αναθεώρησε, αναθεώρησε
|
||||
|
||||
Διατηρώ το σετ μου απο σκονάκια σε ASCII, στοίβα OSI, σχηματισμούς Big-O, και άλλα. Τα μελετώ όταν έχω λίγο χρόνο.
|
||||
|
||||
Κάνε ένα διάλειμμα από τα προβλήματα προγραμματισμού για μισή ώρα και δούλεψε με τα flashcards.
|
||||
|
||||
### 4. Συγκεντρώσου
|
||||
|
||||
Υπάρχουν πολλοί αντιπερισπασμοί που μπορούν να κοστίσουν πολύτιμο χρόνο. Η συγκέντρωση είναι ένα αρκετά δύσκολο κομμάτι.
|
||||
|
||||
## Τι δε θα δεις να καλύπτετε
|
||||
|
||||
Υπάρχουν επικρατέστερες τεχνολογίες αλλά δεν είναι κομμάτι αυτού του πλάνου διαβάσματος:
|
||||
|
||||
- SQL
|
||||
- Javascript
|
||||
- HTML, CSS, και άλλες front-end τεχνολογίες
|
||||
|
||||
## Το καθημερινό πλάνο
|
||||
|
||||
Μερικά θέματα παίρνουν μία ολόκληρη μέρα, και μερικά θα κοστίσουν μερικές μέρες. Μερικά είναι μόνο γνώση χωρίς να χρειαστεί να υλοποιήσεις οτιδήποτε.
|
||||
|
||||
Κάθε μέρα παίρνω ένα θέμα από την παρακάτω λίστα, βλέπω βίντεο για το συγκεκριμένο θέμα, και γρράφω μία υλοποίηση σε:
|
||||
- C - χρησιμοποιώντας structs και functions που παίρνουν struct * και κάτι άλλο σαν ορίσματα.
|
||||
- C++ - χωρίς να χρησιμοποιώ built-in τύπους
|
||||
- C++ - χρησιμοποιώντας built-in τύπους, όπως τα std::list της STL για μία συνδεδεμένη λίστα
|
||||
- Python - χρησιμοποιώντας built-in τύπους (για να εξασκούμε στην Python)
|
||||
- και γράφω tests για να σιγουρευτώ ότι το κάνω καλά, μερικές φορές χρησιμοποιώντας μόνο assert() δηλώσεις
|
||||
- Μπορεί να κάνεις Java ή κάτι άλλο, αυτό είναι μόνο αυτό που κάνω.
|
||||
|
||||
Δεν χρειάζεσαι όλα αυτά. Χρειάζεσαι μόνο [μία γλώσσα για τη συνέντευξη](#Διάλεξε-μία-γλώσσα-για-τη-συνέντευξη).
|
||||
|
||||
Γιατί γράφω κώδικα σε όλα αυτά;
|
||||
- Εξάσκηση, εξάσκηση, εξάσκηση, μέχρι να γίνω άρρωστος από αυτό, και να μπορώ να το κάνω χωρίς κανένα πρόβλημα (μερικά έχουν πολλές ακραίες περιπτώσεις και και τήρηση των λεπτομερειών του βιβλίου να θυμηθείς)
|
||||
- Δουλέυω με τα εμπόδια (allocating/freeing memory χωρίς την βοήθεια του garbage collection (εκτός της Python))
|
||||
- Κάνω χρήση των built-in τύπων έτσι έχω λίγη εμπειρία στη χρήση built-in εργαλείων για χρήση στον πραγματικό κόσμο (δεν πάω να γράψω τη δικιά μου υλοποίηση για τη συνδεδεμένη λίστα στην παραγωγή)
|
||||
|
||||
Μπορεί να μην έχω χρόνο να τα κάνω αυτά για όλα τα θέματα, αλλά θα προσπαθήσω.
|
||||
|
||||
Μπορείς να δεις τον κώδικα μου εδώ:
|
||||
- [C] (https://github.com/jwasham/practice-c)
|
||||
- [C++] (https://github.com/jwasham/practice-cpp)
|
||||
- [Python] (https://github.com/jwasham/practice-python)
|
||||
|
||||
Δε χρειάζεται να απομνημονεύσεις κάθε κομμάτι ενός αλγόριθμου.
|
||||
|
||||
Γράψε κώδικα σε ένα πίνακα ή σε ένα χαρτί, όχι σε υπολογιστή. Τέσταρε τον με μερικές απλές εισόδους. Μετά τέσταρε τον και σε έναν υπολογιστή.
|
||||
|
||||
## Προαπαιτούμενη γνώση
|
||||
|
||||
- [ ] **Μάθε C** (καλή τύχη με αυτό... :disappointed: )
|
||||
- Η C είναι παντού. Θα δείς παραδείγματα σε βιβλία, διαλέξεις, βίντεο, *ΠΑΝΤΟΥ* όσο θα διαβάζεις.
|
||||
- [ ] [C Programming Language, Vol 2](https://www.amazon.com/Programming-Language-Brian-W-Kernighan/dp/0131103628)
|
||||
- Είναι ένα σύντομο βιβλίο, αλλά θα σου δώσει ένα χεράκι στην γλώσσα C και εάν την εξασκείς λίγο
|
||||
θα την καταλάβεις γρήγορα. Το να καταλάβεις τη C θα σε βοηθήσει να καταλάβεις πως δουλεύουν τα προγράμματα και η μνήμη.
|
||||
- [απαντήσεις και ερωτήσεις από έναν Έλληνα](https://github.com/lekkas/c-algorithms)
|
||||
|
||||
- [ ] **How computers process a program:**
|
||||
- [ ] [How does CPU execute program (video)](https://www.youtube.com/watch?v=42KTvGYQYnA)
|
||||
- [ ] [Machine Code Instructions (video)](https://www.youtube.com/watch?v=Mv2XQgpbTNE)
|
||||
|
||||
## Αλγοριθμική πολυπλοκότητα / Big-O / Ασυμπτωτική ανάλυση
|
||||
- τίποτα προς υλοποίηση
|
||||
- [ ] [Harvard CS50 - Asymptotic Notation (video)](https://www.youtube.com/watch?v=iOq5kSKqeR4)
|
||||
- [ ] [Big O Notations (general quick tutorial) (video)](https://www.youtube.com/watch?v=V6mKVRU1evU)
|
||||
- [ ] [Big O Notation (and Omega and Theta) - best mathematical explanation (video)](https://www.youtube.com/watch?v=ei-A_wy5Yxw&index=2&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN)
|
||||
- [ ] Skiena:
|
||||
- [video](https://www.youtube.com/watch?v=gSyDMtdPNpU&index=2&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b)
|
||||
- [slides](http://www3.cs.stonybrook.edu/~algorith/video-lectures/2007/lecture2.pdf)
|
||||
- [ ] [A Gentle Introduction to Algorithm Complexity Analysis](http://discrete.gr/complexity/)
|
||||
- [ ] [Orders of Growth (video)](https://class.coursera.org/algorithmicthink1-004/lecture/59)
|
||||
- [ ] [Asymptotics (video)](https://class.coursera.org/algorithmicthink1-004/lecture/61)
|
||||
- [ ] [UC Berkeley Big O (video)](https://youtu.be/VIS4YDpuP98)
|
||||
- [ ] [UC Berkeley Big Omega (video)](https://youtu.be/ca3e7UVmeUc)
|
||||
- [ ] [Amortized Analysis (video)](https://www.youtube.com/watch?v=B3SpQZaAZP4&index=10&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN)
|
||||
- [ ] [Illustrating "Big O" (video)](https://class.coursera.org/algorithmicthink1-004/lecture/63)
|
||||
- [ ] TopCoder (includes recurrence relations and master theorem):
|
||||
- [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/)
|
||||
- [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
|
||||
Εάν μερικές διαλέξεις είναι πολύ μαθηματικές, μπορείς να μεταβείς προς τα κάτω και να παρακολουθήσεις μερικά βίντεο σχετικά με τα διακριτά μαθηματικά για να πάρεις όλες τις γνώσεις που απαιτούνται.
|
||||
|
||||
## Δομές Δεδομένων
|
||||
|
||||
- ### Πίνακες
|
||||
- Υλοποίησε μία λίστα, η οποία αλλάζει αυτόματα μέγεθος.
|
||||
- [ ] Περιγραφή:
|
||||
- [Πίνακες(EN) (video)](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays)
|
||||
- [UCBerkley CS61B - Linear and Multi-Dim Arrays (video)](https://youtu.be/Wp8oiO_CZZE?t=15m32s)
|
||||
- [Basic Arrays (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Basic-arrays/149042/177104-4.html)
|
||||
- [Multi-dim (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Multidimensional-arrays/149042/177105-4.html)
|
||||
- [Dynamic Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays)
|
||||
- [Jagged Arrays (video)](https://www.youtube.com/watch?v=1jtrQqYpt7g)
|
||||
- [Jagged Arrays (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Jagged-arrays/149042/177106-4.html)
|
||||
- [Resizing arrays (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Resizable-arrays/149042/177108-4.html)
|
||||
- [ ] Υλοποίησε μία συλλογή (ευμετάβλητο πίνακα με αυτόματη αλλαγή μεγέθους):
|
||||
- [ ] Κάνε πρακτική σε κώδικα χρησιμοποιώντας πίνακες και δείκτες, και pointer math για να πας σε ένα δείκτη από το να χρησιμοποιήσεις ευρετηρίαση.
|
||||
- [ ] new raw data array with allocated memory
|
||||
- can allocate int array under the hood, just not use its features
|
||||
- start with 16, or if starting number is greater, use power of 2 - 16, 32, 64, 128
|
||||
- [ ] size() - αριθμός των στοιχείων
|
||||
- [ ] capacity() - αριθμός στοιχείων που μπορεί να περιέχει
|
||||
- [ ] is_empty()
|
||||
- [ ] at(index) - επιστρέφει που υπάρχει στη θέση index, *εκρύγνειται* αν ο δείκτης είναι εκτός συνόρων του πίνακα
|
||||
- [ ] push(item)
|
||||
- [ ] insert(index, item) - εισάγει ένα σημείο στη θέση index, μετακινεί την τιμή του index και σύρει όλα τα στοιχεία στα δεξιά
|
||||
- [ ] prepend(item) - εισάγει το αντικείμενο στην αρχή της συλλογής(insert(0,item))
|
||||
- [ ] pop() - αφαιρεί από το τέλος, επιστρέφει την τιμή
|
||||
- [ ] delete(index) - διγράφη το στοιχείο στη θέση index, σύρει όλα τα στοιχεία στα αριστερά
|
||||
- [ ] remove(item) - ψάχνει για την τιμή και διαγράφει το δείκτη που την έχει (ακόμα και αν είναι σε περισσότερες από 1 θέσεις)
|
||||
- [ ] find(item) - ψάχνει για την τιμή και επιστρέφει τον πρώτο δείκτη με αυτή την τιμή, -1 έαν δε βρεθεί
|
||||
- [ ] resize(new_capacity) // private function
|
||||
- όταν φτάνεις στη χωρητικώτητα, άλλαξε το μέγεθος του πίνακα κατά το διπλάσιο
|
||||
- όταν αφαιρείς ένα στοιχείο, εάν το μέγεθος είναι 1/4 της χωρητικότητας, άλλαξε το μέγεθος κατά το μισό
|
||||
- [ ] Χρόνος
|
||||
- O(1) για πρόσθεση/αφαίρεση στο τέλος (απελευθέρωση των δεσμευμένων θέσεων για περισσότερο χώρο)
|
||||
- O(n) για πρόσθεση/αφαίρεση αλλού
|
||||
- [ ] Χώρος
|
||||
- συνεχόμενος στη μνήμη, έτσι η μικρή απόσταση βοηθάει στην απόδοση
|
||||
- απαιτούμενος χώρος = (χωρητικότητα πίνακα, η οποία είναι >= n) * μέγεθος του στοιχείου, αλλά ακόμα και αν είναι 2n => O(n)
|
||||
|
||||
- ### Συνδεδεμένες λίστες
|
||||
- [ ] Περιγραφή:
|
||||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists)
|
||||
- [ ] [CS 61B - Linked Lists (video)](https://www.youtube.com/watch?v=sJtJOtXCW_M&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=5)
|
||||
- [ ] [[Review] Linked lists in 4 minutes (video)](https://youtu.be/F8AbOfQwl1c)
|
||||
- [ ] [C Code (video)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
|
||||
- not the whole video, just portions about Node struct and memory allocation.
|
||||
- [ ] Linked List vs Arrays:
|
||||
- [Core Linked Lists Vs Arrays (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/rjBs9/core-linked-lists-vs-arrays)
|
||||
- [In The Real World Linked Lists Vs Arrays (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/QUaUd/in-the-real-world-lists-vs-arrays)
|
||||
- [ ] [why you should avoid linked lists (video)](https://www.youtube.com/watch?v=YQs6IC-vgmo)
|
||||
- [ ] Gotcha: you need pointer to pointer knowledge:
|
||||
(for when you pass a pointer to a function that may change the address where that pointer points)
|
||||
This page is just to get a grasp on ptr to ptr. I don't recommend this list traversal style. Readability and maintainability suffer due to cleverness.
|
||||
- [Pointers to Pointers](https://www.eskimo.com/~scs/cclass/int/sx8.html)
|
||||
- [ ] υλοποίηση (Το έκανα με δείκτη ουράς και χωρίς):
|
||||
|
||||
# untill here
|
||||
|
||||
- [ ] size() - returns number of data elements in list
|
||||
- [ ] empty() - bool returns true if empty
|
||||
- [ ] value_at(index) - returns the value of the nth item (starting at 0 for first)
|
||||
- [ ] push_front(value) - adds an item to the front of the list
|
||||
- [ ] pop_front() - remove front item and return its value
|
||||
- [ ] push_back(value) - adds an item at the end
|
||||
- [ ] pop_back() - removes end item and returns its value
|
||||
- [ ] front() - get value of front item
|
||||
- [ ] back() - get value of end item
|
||||
- [ ] insert(index, value) - insert value at index, so current item at that index is pointed to by new item at index
|
||||
- [ ] erase(index) - removes node at given index
|
||||
- [ ] value_n_from_end(n) - returns the value of the node at nth position from the end of the list
|
||||
- [ ] reverse() - reverses the list
|
||||
- [ ] remove_value(value) - removes the first item in the list with this value
|
||||
- [ ] Doubly-linked List
|
||||
- [Description (video)](https://www.coursera.org/learn/data-structures/lecture/jpGKD/doubly-linked-lists)
|
||||
- No need to implement
|
||||
|
||||
- ### Stack
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [Using Stacks Last-In First-Out (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-stacks-last-first-out/149042/177120-4.html)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Will not implement. Implementing with array is trivial.
|
||||
|
||||
- ### Queue
|
||||
- [ ] [Using Queues First-In First-Out(video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-queues-first-first-out/149042/177122-4.html)
|
||||
- [ ] [Queue (video)](https://www.coursera.org/learn/data-structures/lecture/EShpq/queue)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [Priority Queues (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Priority-queues-deques/149042/177123-4.html)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] Implement using linked-list, with tail pointer:
|
||||
- enqueue(value) - adds value at position at tail
|
||||
- dequeue() - returns value and removes least recently added element (front)
|
||||
- empty()
|
||||
- [ ] Implement using fixed-sized array:
|
||||
- enqueue(value) - adds item at end of available storage
|
||||
- dequeue() - returns value and removes least recently added element
|
||||
- empty()
|
||||
- full()
|
||||
- [ ] Cost:
|
||||
- a bad implementation using linked list where you enqueue at head and dequeue at tail would be O(n)
|
||||
because you'd need the next to last element, causing a full traversal each dequeue
|
||||
- enqueue: O(1) (amortized, linked list and array [probing])
|
||||
- dequeue: O(1) (linked list and array)
|
||||
- empty: O(1) (linked list and array)
|
||||
|
||||
- ### Hash table
|
||||
- [ ] Videos:
|
||||
- [ ] [Hashing with Chaining (video)](https://www.youtube.com/watch?v=0M_kIqhwbFo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=8)
|
||||
- [ ] [Table Doubling, Karp-Rabin (video)](https://www.youtube.com/watch?v=BRO7mVIFt08&index=9&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [Open Addressing, Cryptographic Hashing (video)](https://www.youtube.com/watch?v=rvdJDijO2Ro&index=10&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [PyCon 2010: The Mighty Dictionary (video)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
|
||||
- [ ] [(Advanced) Randomization: Universal & Perfect Hashing (video)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(Advanced) Perfect hashing (video)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4)
|
||||
- [ ] [[Review] Hash tables in 4 minutes (video)](https://youtu.be/knV86FlSXJ8)
|
||||
|
||||
- [ ] Online Courses:
|
||||
- [ ] [Understanding Hash Functions (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Understanding-hash-functions/149042/177126-4.html)
|
||||
- [ ] [Using Hash Tables (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-hash-tables/149042/177127-4.html)
|
||||
- [ ] [Supporting Hashing (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Supporting-hashing/149042/177128-4.html)
|
||||
- [ ] [Language Support Hash Tables (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Language-support-hash-tables/149042/177129-4.html)
|
||||
- [ ] [Core Hash Tables (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables)
|
||||
- [ ] [Data Structures (video)](https://www.coursera.org/learn/data-structures/home/week/3)
|
||||
- [ ] [Phone Book Problem (video)](https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem)
|
||||
- [ ] distributed hash tables:
|
||||
- [Instant Uploads And Storage Optimization In Dropbox (video)](https://www.coursera.org/learn/data-structures/lecture/DvaIb/instant-uploads-and-storage-optimization-in-dropbox)
|
||||
- [Distributed Hash Tables (video)](https://www.coursera.org/learn/data-structures/lecture/tvH8H/distributed-hash-tables)
|
||||
|
||||
- [ ] implement with array using linear probing
|
||||
- hash(k, m) - m is size of hash table
|
||||
- add(key, value) - if key already exists, update value
|
||||
- exists(key)
|
||||
- get(key)
|
||||
- remove(key)
|
||||
|
||||
## More Knowledge
|
||||
|
||||
- ### Binary search
|
||||
- [ ] [Binary Search (video)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [Binary Search (video)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [detail](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Implement:
|
||||
- binary search (on sorted array of integers)
|
||||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.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:
|
||||
[Bit Manipulation (video)](https://www.youtube.com/watch?v=7jkIUgLC29I)
|
||||
- [ ] [C Programming Tutorial 2-10: Bitwise Operators (video)](https://www.youtube.com/watch?v=d0AwjSpNXR0)
|
||||
- [ ] [Bit Manipulation](https://en.wikipedia.org/wiki/Bit_manipulation)
|
||||
- [ ] [Bitwise Operation](https://en.wikipedia.org/wiki/Bitwise_operation)
|
||||
- [ ] [Bithacks](https://graphics.stanford.edu/~seander/bithacks.html)
|
||||
- [ ] [The Bit Twiddler](http://bits.stephan-brumme.com/)
|
||||
- [ ] [The Bit Twiddler Interactive](http://bits.stephan-brumme.com/interactive.html)
|
||||
- [ ] 2s and 1s complement
|
||||
- [Binary: Plusses & Minuses (Why We Use Two's Complement) (video)](https://www.youtube.com/watch?v=lKTsv6iVxV4)
|
||||
- [1s Complement](https://en.wikipedia.org/wiki/Ones%27_complement)
|
||||
- [2s Complement](https://en.wikipedia.org/wiki/Two%27s_complement)
|
||||
- [ ] count set bits
|
||||
- [4 ways to count bits in a byte (video)](https://youtu.be/Hzuzo9NJrlc)
|
||||
- [Count Bits](https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan)
|
||||
- [How To Count The Number Of Set Bits In a 32 Bit Integer](http://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer)
|
||||
- [ ] round to next power of 2:
|
||||
- [Round Up To Next Power Of Two](http://bits.stephan-brumme.com/roundUpToNextPowerOfTwo.html)
|
||||
- [ ] swap values:
|
||||
- [Swap](http://bits.stephan-brumme.com/swap.html)
|
||||
- [ ] absolute value:
|
||||
- [Absolute Integer](http://bits.stephan-brumme.com/absInteger.html)
|
||||
|
||||
## Trees
|
||||
|
||||
- ### Trees - Notes & Background
|
||||
- [ ] [Series: Core Trees (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees)
|
||||
- [ ] [Series: Trees (video)](https://www.coursera.org/learn/data-structures/lecture/95qda/trees)
|
||||
- basic tree construction
|
||||
- traversal
|
||||
- manipulation algorithms
|
||||
- BFS (breadth-first search)
|
||||
- [MIT (video)](https://www.youtube.com/watch?v=s-CYnVz-uh4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=13)
|
||||
- level order (BFS, using queue)
|
||||
time complexity: O(n)
|
||||
space complexity: best: O(1), worst: O(n/2)=O(n)
|
||||
- DFS (depth-first search)
|
||||
- [MIT (video)](https://www.youtube.com/watch?v=AfSk24UTFS8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=14)
|
||||
- notes:
|
||||
time complexity: O(n)
|
||||
space complexity:
|
||||
best: O(log n) - avg. height of tree
|
||||
worst: O(n)
|
||||
- inorder (DFS: left, self, right)
|
||||
- postorder (DFS: left, right, self)
|
||||
- preorder (DFS: self, left, right)
|
||||
- [ ] [[Review] Breadth-first search in 4 minutes (video)](https://youtu.be/HZ5YTanv5QE)
|
||||
- [ ] [[Review] Depth-first search in 4 minutes (video)](https://youtu.be/Urx87-NMm6c)
|
||||
- [ ] [[Review] Tree Traversal (playlist) in 11 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b)
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
|
|
@ -1,10 +1,18 @@
|
|||
# Coding Interview University
|
||||
|
||||
Translations:
|
||||
Traductions:
|
||||
- [中文版本](README-cn.md)
|
||||
- [Español (in progress)](README-es.md) [Issue #80](https://github.com/jwasham/coding-interview-university/issues/80)
|
||||
- मानक हिन्दी (in progress) [Issue #81](https://github.com/jwasham/coding-interview-university/issues/81)
|
||||
|
||||
<div align="center">
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
## C'est quoi?
|
||||
|
||||
C'est un plan d'études de plusieurs mois pour aller d'un développeur web (Autodidacte, sans diplôme en informatique) à ingénieur logiciel google.
|
||||
|
|
@ -15,13 +23,13 @@ Cette longue liste a été extraite et étendue de **Google's coaching notes**,
|
|||
En bas, j'ai rajouté des unités supplémentaires qui peuvent être soulevées pendant l'entretien, ou qui peuvent être utiles pour résoudre des problèmes. Plusieurs unités proviennent de
|
||||
"[Get that job at Google](http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html)" par Steve Yegge, et sont parfois reflétées mot pour mot dans les notes de coaching de google.
|
||||
|
||||
J'ai épuré ce que vous devez savoir de ce qui est recommendé par Yegge. J'ai modifié les prérequis de Yegge.
|
||||
D'après les informations reçues de la part des contact travaillant à Google. Ceci est destiné aux **new software engineers** ou aux developpeur logiciel/web qui souhaitent devenir des ingénieurs en génie logiciel (où la science de l'informatique est requise). Si vous avez plusieurs années d'expérience et vous déclarez plusieurs années d'éxperience en génie logiciel attendez vous à un entretien plus dur.
|
||||
J'ai épuré ce que vous devez savoir de ce qui est recommandé par Yegge. J'ai modifié les prérequis de Yegge.
|
||||
D'après les informations reçues de la part des contacts travaillant à Google. Ceci est destiné aux **new software engineers** ou aux développeurs logiciel/web qui souhaitent devenir des ingénieurs en génie logiciel (où la science de l'informatique est requise). Si vous avez plusieurs années d'expérience et vous déclarez plusieurs années d'expérience en génie logiciel attendez vous à un entretien plus dur.
|
||||
[Read more here](https://googleyasheck.com/what-you-need-to-know-for-your-google-interview-and-what-you-dont/).
|
||||
|
||||
Si vous avez plusieurs années d'experience en development web/logiciel, notez que google font une distinction entre le développement logiciel et l'ingénieurie en génie civil.
|
||||
Si vous avez plusieurs années d'expérience en développement web/logiciel, notez que google font une distinction entre le développement logiciel et l'ingénierie en génie civil.
|
||||
|
||||
Si vous souhaitez devenir ingénieur de fiabilité, ou ingénieur systèmes, suivez plus de cours de la liste optionelle (Réseau, sécurité)
|
||||
Si vous souhaitez devenir ingénieur de fiabilité, ou ingénieur systèmes, suivez plus de cours de la liste optionnelle (Réseau, sécurité)
|
||||
---
|
||||
|
||||
## Table of Contents
|
||||
|
|
@ -32,7 +40,7 @@ Si vous souhaitez devenir ingénieur de fiabilité, ou ingénieur systèmes, sui
|
|||
- [Se mettre dans l'humeur Googley](#get-in-a-googley-mood)
|
||||
- [J'ai décroché le Job?](#did-i-get-the-job)
|
||||
- [Follow Along with Me](#follow-along-with-me)
|
||||
- [Don't feel you aren't smart enough](#dont-feel-you-arent-smart-enough)
|
||||
- [Ne vous sentez pas stupide](#ne-vous-sentez-pas-stupide)
|
||||
- [A propos de Google](#about-google)
|
||||
- [A propos des ressources vidéo](#about-video-resources)
|
||||
- [Déroulement de l'entretien & préparations générales à l'entretien](#interview-process--general-interview-prep)
|
||||
|
|
@ -52,11 +60,11 @@ Si vous souhaitez devenir ingénieur de fiabilité, ou ingénieur systèmes, sui
|
|||
- [More Knowledge](#more-knowledge)
|
||||
- [Recherche dichotomique](#binary-search)
|
||||
- [Opérations bit à bit](#bitwise-operations)
|
||||
- [Arbes](#trees)
|
||||
- [Arbres](#trees)
|
||||
- [Arbres - Notes & Background](#trees---notes--background)
|
||||
- [Arbres binaires de recherche: BSTs](#binary-search-trees-bsts)
|
||||
- [Tas / File de Priorité / Tas binaire](#heap--priority-queue--binary-heap)
|
||||
- Arbre de recherche equilibré (general concept, not details)
|
||||
- Arbre de recherche équilibré (general concept, not details)
|
||||
- Parcours : Préfixe, infixe, postfixe, BFS, DFS
|
||||
- [Tri](#sorting)
|
||||
- sélection
|
||||
|
|
@ -91,7 +99,7 @@ Si vous souhaitez devenir ingénieur de fiabilité, ou ingénieur systèmes, sui
|
|||
- [Votre CV](#your-resume)
|
||||
- [Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes)
|
||||
- [Ayez les questions pour l'entretien](#have-questions-for-the-interviewer)
|
||||
- [Quand vous aurez eu le travial:](#once-youve-got-the-job)
|
||||
- [Quand vous aurez eu le travail:](#once-youve-got-the-job)
|
||||
|
||||
---------------- Everything below this point is optional ----------------
|
||||
|
||||
|
|
@ -133,7 +141,6 @@ Si vous souhaitez devenir ingénieur de fiabilité, ou ingénieur systèmes, sui
|
|||
- [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)
|
||||
|
|
@ -147,34 +154,23 @@ Si vous souhaitez devenir ingénieur de fiabilité, ou ingénieur systèmes, sui
|
|||
|
||||
---
|
||||
|
||||
## Why use it?
|
||||
## Pourquoi l'utiliser?
|
||||
|
||||
I'm following this plan to prepare for my Google interview. I've been building the web, building
|
||||
services, and launching startups since 1997. I have an economics degree, not a CS degree. I've
|
||||
been very successful in my career, but I want to work at Google. I want to progress into larger systems
|
||||
and get a real understanding of computer systems, algorithmic efficiency, data structure performance,
|
||||
low-level languages, and how it all works. And if you don't know any of it, Google won't hire you.
|
||||
Je suis ce plan pour préparer mon entretien chez Google. J'ai construit le web, construit des services, et lancé des startups depuis 1997. J'ai un diplôme en économie, non pas d'informatique. J'ai eu beaucoup de succès dans ma carrière , mais je veux travailler chez Google. Je veux progresser sur de larges systèmes, et avec une réelle compréhension des systèmes informatiques, de l'efficacité algorithmique, de la performance des structures de données, de langages bas-niveau, et de comment ça marche. Et si vous ne connaissez rien de tout cela, Google ne vous engagera pas.
|
||||
|
||||
When I started this project, I didn't know a stack from a heap, didn't know Big-O anything, anything about trees, or how to
|
||||
traverse a graph. If I had to code a sorting algorithm, I can tell ya it wouldn't have been very good.
|
||||
Every data structure I've ever used was built into the language, and I didn't know how they worked
|
||||
under the hood at all. I've never had to manage memory unless a process I was running would give an "out of
|
||||
memory" error, and then I'd have to find a workaround. I've used a few multidimensional arrays in my life and
|
||||
thousands of associative arrays, but I've never created data structures from scratch.
|
||||
Quand j'ai commencé ce projet, je ne savais pas distinguer une pile d'un tas, ne connaissais rien sur le Grand O, rien sur les arbres, ou comment traverser un graphe. Si je devais coder un algorithme, je peux vous dire que ça n'aurait pas été très bon. Chaque structure de données que j'ai utilisée était construite dans le langage, et je ne savais pas du tout comment elles fonctionnaient sous le capot. Je n'avais jamais eu à gérer de mémoire sauf si un processus que j'exécutais donnais une erreur "Out of memory", et je devais alors trouver une parade. J'ai utilisé quelques tableaux multidimensionnels dans ma vie et des milliers de tableaux associatifs, mais je n'ai jamais créé de structures de données de zéro.
|
||||
|
||||
But after going through this study plan I have high confidence I'll be hired. It's a long plan. It's going to take me
|
||||
months. If you are familiar with a lot of this already it will take you a lot less time.
|
||||
Mais après avoir suivi ce plan d'études, je suis confiant que je serai embauché. C'est un long plan. cela me prendra des mois. Si vous êtes déjà familier avec beaucoup de points, cela vous prendra beaucoup moins de temps.
|
||||
|
||||
## How to use it
|
||||
## Comment s'en servir?
|
||||
|
||||
Everything below is an outline, and you should tackle the items in order from top to bottom.
|
||||
Tout ce qui suit est très important et vous devriez attaquer ces points dans l'ordre de haut en bas.
|
||||
|
||||
I'm using Github's special markdown flavor, including tasks lists to check progress.
|
||||
J'utilise la typologie Markdown de GitHub, incluant les listes de tâches pour suivre les progrès.
|
||||
|
||||
- [x] Create a new branch so you can check items like this, just put an x in the brackets: [x]
|
||||
- [x] Créez une nouvelle branche afin de vérifier les éléments comme ceci, mettez juste un "x" entre crochets : [x]
|
||||
|
||||
|
||||
Fork a branch and follow the commands below
|
||||
Effectuez un fork d'une branche et suivez les commandes suivantes
|
||||
|
||||
`git checkout -b progress`
|
||||
|
||||
|
|
@ -188,25 +184,25 @@ 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 `
|
||||
|
||||
[More about Github-flavored markdown](https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown)
|
||||
[Plus sur Markdown à la sauce Github](https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown)
|
||||
|
||||
## 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?
|
||||
## Comment j'ai eu le job ?
|
||||
|
||||
I'm in the queue right now. Hope to interview soon.
|
||||
|
||||
Thanks for the referral, JP.
|
||||
|
||||
## Follow Along with Me
|
||||
## Follow moi ailleurs
|
||||
|
||||
My story: [Why I Studied Full-Time for 8 Months for a Google Interview](https://medium.com/@googleyasheck/why-i-studied-full-time-for-8-months-for-a-google-interview-cc662ce9bb13)
|
||||
|
||||
|
|
@ -220,199 +216,202 @@ I'm on the journey, too. Follow along:
|
|||
|
||||
|
||||
|
||||
## Don't feel you aren't smart enough
|
||||
- Google engineers are smart, but many have an insecurity that they aren't smart enough, even though they work at Google.
|
||||
- [The myth of the Genius Programmer](https://www.youtube.com/watch?v=0SARbwvhupQ)
|
||||
- [It's Dangerous to Go Alone: Battling the Invisible Monsters in Tech](https://www.youtube.com/watch?v=1i8ylq4j_EY)
|
||||
## Ne vous sentez pas stupide
|
||||
- Les ingénieurs de Google sont intelligents, mais beaucoup ont comme insécurité qu'ils ne sont pas suffisamment intelligents, même s'ils travaillent pour Google.
|
||||
- [Le mythe du programmeur génie](https://www.youtube.com/watch?v=0SARbwvhupQ)
|
||||
- [C'est dangereux de rester seul: Combattre les monstres invisibles dans la Tech](https://www.youtube.com/watch?v=1i8ylq4j_EY)
|
||||
|
||||
## About Google
|
||||
## À propos de Google
|
||||
|
||||
- [ ] For students - [Google Careers: Technical Development Guide](https://www.google.com/about/careers/students/guide-to-technical-development.html)
|
||||
- [ ] How Search Works:
|
||||
- [ ] [The Evolution of Search (video)](https://www.youtube.com/watch?v=mTBShTwCnD4)
|
||||
- [ ] [How Search Works - the story](https://www.google.com/insidesearch/howsearchworks/thestory/)
|
||||
- [ ] [How Search Works](https://www.google.com/insidesearch/howsearchworks/)
|
||||
- [ ] [How Search Works - Matt Cutts (video)](https://www.youtube.com/watch?v=BNHR6IQJGZs)
|
||||
- [ ] [How Google makes improvements to its search algorithm (video)](https://www.youtube.com/watch?v=J5RZOU6vK4Q)
|
||||
- [ ] Series:
|
||||
- [ ] [How Google Search Dealt With Mobile](https://backchannel.com/how-google-search-dealt-with-mobile-33bc09852dc9)
|
||||
- [ ] [Google's Secret Study To Find Out Our Needs](https://backchannel.com/googles-secret-study-to-find-out-our-needs-eba8700263bf)
|
||||
- [ ] [Google Search Will Be Your Next Brain](https://backchannel.com/google-search-will-be-your-next-brain-5207c26e4523)
|
||||
- [ ] [The Deep Mind Of Demis Hassabis](https://backchannel.com/the-deep-mind-of-demis-hassabis-156112890d8a)
|
||||
- [ ] [Book: How Google Works](https://www.amazon.com/How-Google-Works-Eric-Schmidt/dp/1455582344)
|
||||
- [ ] [Made by Google announcement - Oct 2016 (video)](https://www.youtube.com/watch?v=q4y0KOeXViI)
|
||||
- [ ] Pour les étudiants - [Carrières Google: Guide de développement technique](https://www.google.com/about/careers/students/guide-to-technical-development.html)
|
||||
- [ ] Comment marche la recherche:
|
||||
- [ ] [L'évolution de la recherche (video)](https://www.youtube.com/watch?v=mTBShTwCnD4)
|
||||
- [ ] [Comment la recherche fonctionne - l'histoire](https://www.google.com/insidesearch/howsearchworks/thestory/)
|
||||
- [ ] [Comment la recherche fonctionne](https://www.google.com/insidesearch/howsearchworks/)
|
||||
- [ ] [Comment la recherche fonctionne - Matt Cutts (video)](https://www.youtube.com/watch?v=BNHR6IQJGZs)
|
||||
- [ ] [Comment Google améliore son algorithme de recherche (video)](https://www.youtube.com/watch?v=J5RZOU6vK4Q)
|
||||
- [ ] Séries:
|
||||
- [ ] [Comment la recherche Google Search fonctionne sur mobile](https://backchannel.com/how-google-search-dealt-with-mobile-33bc09852dc9)
|
||||
- [ ] [L'étude secrète de Google pour découvrir nos besoins](https://backchannel.com/googles-secret-study-to-find-out-our-needs-eba8700263bf)
|
||||
- [ ] [La recherche Google Search sera votre prochain cerveau](https://backchannel.com/google-search-will-be-your-next-brain-5207c26e4523)
|
||||
- [ ] [L'esprit profond de Demis Hassabis](https://backchannel.com/the-deep-mind-of-demis-hassabis-156112890d8a)
|
||||
- [ ] [Livre: Comment Google fonctionne](https://www.amazon.com/How-Google-Works-Eric-Schmidt/dp/1455582344)
|
||||
- [ ] [Annonce faite par Google - Oct 2016 (video)](https://www.youtube.com/watch?v=q4y0KOeXViI)
|
||||
|
||||
## About Video Resources
|
||||
## À propos des ressources vidéos
|
||||
|
||||
Some videos are available only by enrolling in a Coursera, EdX, or Lynda.com class. These are called MOOCs.
|
||||
Sometimes the classes are not in session so you have to wait a couple of months, so you have no access. Lynda.com courses are not free.
|
||||
Certaines vidéos sont disponibles uniquement en s'inscrivant à une classe Coursera, EdX ou Lynda.com. Ce sont des MOOC.
|
||||
Parfois, les cours ne sont pas en session, alors vous devez attendre quelques mois, donc vous n'y avez pas accès. Les cours sur Lynda.com ne sont pas gratuits.
|
||||
|
||||
I'd appreciate your help to add free and always-available public sources, such as YouTube videos to accompany the online course videos.
|
||||
I like using university lectures.
|
||||
J'apprécierais votre aide pour ajouter des sources publiques gratuites et toujours disponibles, telles que des vidéos YouTube pour accompagner les vidéos de cours en ligne.
|
||||
J'aime utiliser les cours universitaires.
|
||||
|
||||
|
||||
## Interview Process & General Interview Prep
|
||||
## Processus pour l'entrevue et Préparation
|
||||
|
||||
- [ ] Videos:
|
||||
- [ ] [How to Work at Google: Prepare for an Engineering Interview (video)](https://www.youtube.com/watch?v=ko-KkSmp-Lk)
|
||||
- [ ] [How to Work at Google: Example Coding/Engineering Interview (video)](https://www.youtube.com/watch?v=XKu_SEDAykw)
|
||||
- [ ] [How to Work at Google - Candidate Coaching Session (video)](https://www.youtube.com/watch?v=oWbUtlUhwa8&feature=youtu.be)
|
||||
- [ ] [Google Recruiters Share Technical Interview Tips (video)](https://www.youtube.com/watch?v=qc1owf2-220&feature=youtu.be)
|
||||
- [ ] [How to Work at Google: Tech Resume Preparation (video)](https://www.youtube.com/watch?v=8npJLXkcmu8)
|
||||
- [ ] Vidéos:
|
||||
- [ ] [Comment travailler à Google: Prépare pour une interview d'ingénieur (vidéo)](https://www.youtube.com/watch?v=ko-KkSmp-Lk)
|
||||
- [ ] [Comment travailler à Google: Exemple pour une entrevue de coding/ingénieur (vidéo)](https://www.youtube.com/watch?v=XKu_SEDAykw)
|
||||
- [ ] [Comment travailler à Google: Préparation pour le candidat (vidéo)](https://www.youtube.com/watch?v=oWbUtlUhwa8&feature=youtu.be)
|
||||
- [ ] [Les conseils pour les interviews par les employés (vidéo)](https://www.youtube.com/watch?v=qc1owf2-220&feature=youtu.be)
|
||||
- [ ] [Comment travailler à Google: Préparation pour ton résumé (vidéo)](https://www.youtube.com/watch?v=8npJLXkcmu8)
|
||||
|
||||
- [ ] Articles:
|
||||
- [ ] [Becoming a Googler in Three Steps](http://www.google.com/about/careers/lifeatgoogle/hiringprocess/)
|
||||
- [ ] [Get That Job at Google](http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html)
|
||||
- all the things he mentions that you need to know are listed below
|
||||
- [ ] _(very dated)_ [How To Get A Job At Google, Interview Questions, Hiring Process](http://dondodge.typepad.com/the_next_big_thing/2010/09/how-to-get-a-job-at-google-interview-questions-hiring-process.html)
|
||||
- [ ] [Phone Screen Questions](http://sites.google.com/site/steveyegge2/five-essential-phone-screen-questions)
|
||||
- [ ] [Comment être un Googler dans trois étapes](http://www.google.com/about/careers/lifeatgoogle/hiringprocess/)
|
||||
- [ ] [Reçoit cet emploi à Google](http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html)
|
||||
- Toutes les choses mentionnent par lui est en forme de liste en dessous
|
||||
- [ ] _(très vieux)_ [Comment avoir un emploi à Google, Questions d'Interview, Processus d'Embauchement](http://dondodge.typepad.com/the_next_big_thing/2010/09/how-to-get-a-job-at-google-interview-questions-hiring-process.html)
|
||||
- [ ] [Questions pour l'appeler de sélection](http://sites.google.com/site/steveyegge2/five-essential-phone-screen-questions)
|
||||
|
||||
- [ ] Prep Courses:
|
||||
- [ ] [Software Engineer Interview Unleashed (paid course)](https://www.udemy.com/software-engineer-interview-unleashed):
|
||||
- Learn how to make yourself ready for software engineer interviews from a former Google interviewer.
|
||||
- [ ] Cours pour préparer:
|
||||
- [ ] [Comment réussir dans une interview d'ingénieur logiciel (besoin de payer)](https://www.udemy.com/software-engineer-interview-unleashed):
|
||||
- Apprends comment être prêt pour l'entrevue de quelqu'un qui était responsable de l'embauche pour Google.
|
||||
|
||||
- [ ] Additional (not suggested by Google but I added):
|
||||
- [ ] [ABC: Always Be Coding](https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.4heg8zvm4)
|
||||
- [ ] [Four Steps To Google Without A Degree](https://medium.com/always-be-coding/four-steps-to-google-without-a-degree-8f381aa6bd5e#.asalo1vfx)
|
||||
- [ ] [Whiteboarding](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1)
|
||||
- [ ] [How Google Thinks About Hiring, Management And Culture](http://www.kpcb.com/blog/lessons-learned-how-google-thinks-about-hiring-management-and-culture)
|
||||
- [ ] [Effective Whiteboarding during Programming Interviews](http://www.coderust.com/blog/2014/04/10/effective-whiteboarding-during-programming-interviews/)
|
||||
- [ ] Cracking The Coding Interview Set 1:
|
||||
- [ ] [Gayle L McDowell - Cracking The Coding Interview (video)](https://www.youtube.com/watch?v=rEJzOhC5ZtQ)
|
||||
- [ ] [Cracking the Coding Interview with Author Gayle Laakmann McDowell (video)](https://www.youtube.com/watch?v=aClxtDcdpsQ)
|
||||
- [ ] How to Get a Job at the Big 4:
|
||||
- [ ] ['How to Get a Job at the Big 4 - Amazon, Facebook, Google & Microsoft' (video)](https://www.youtube.com/watch?v=YJZCUhxNCv8)
|
||||
- [ ] [Failing at Google Interviews](http://alexbowe.com/failing-at-google-interviews/)
|
||||
- [ ] Supplémentaires (ne sont pas suggéré par Google, mais je l'ai ajouté):
|
||||
- [ ] [Toujours en train de faire le codage (Anglais ABC: Always Be Coding)](https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.4heg8zvm4)
|
||||
- [ ] [Quatre étapes à Google, sans un diplôme](https://medium.com/always-be-coding/four-steps-to-google-without-a-degree-8f381aa6bd5e#.asalo1vfx)
|
||||
- [ ] [Tableau blanc](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1)
|
||||
- [ ] [Comment Google pense à propos de l'embauche, gestion, et culture](http://www.kpcb.com/blog/lessons-learned-how-google-thinks-about-hiring-management-and-culture)
|
||||
- [ ] Réussis dans une entrevue de codage:
|
||||
- [ ] [Gayle L McDowell - Réussi l'entretien de codage (vidéo)](https://www.youtube.com/watch?v=rEJzOhC5ZtQ)
|
||||
- [ ] [Réussi l'entretien de codage avec auteur Author Gayle Laakmann McDowell (vidéo)](https://www.youtube.com/watch?v=aClxtDcdpsQ)
|
||||
- [ ] Comment obtenir un emploi à Google, Microsoft, Amazon ou Facebook:
|
||||
- [ ] ['Comment obtenir un emploi aux grandes quatre - Amazon, Facebook, Google & Microsoft' (vidéo)](https://www.youtube.com/watch?v=YJZCUhxNCv8)
|
||||
- [ ] [Échouer à une entrevue de Google](http://alexbowe.com/failing-at-google-interviews/)
|
||||
|
||||
## Pick One Language for the Interview
|
||||
## Choisis une langue pour l'Entrevue
|
||||
|
||||
I wrote this short article about it: [Important: Pick One Language for the Google Interview](https://googleyasheck.com/important-pick-one-language-for-the-google-interview/)
|
||||
Je l'ai écrit cet article à propos de cela : [Important: Choisis une langue pour l'entrevue Google](https://googleyasheck.com/important-pick-one-language-for-the-google-interview/)
|
||||
|
||||
You can use a language you are comfortable in to do the coding part of the interview, but for Google, these are solid choices:
|
||||
Tu peux choisir une langue avec laquelle vous êtes confortable pour faire la partie de codage, mais pour Google, celles-ci sont les bons choix:
|
||||
|
||||
- C++
|
||||
- Java
|
||||
- Python
|
||||
|
||||
You could also use these, but read around first. There may be caveats:
|
||||
Tu pourrais aussi faire celles-ci, mais fait de la recherche avant. Il y aurait peut-être des problèmes:
|
||||
|
||||
- JavaScript
|
||||
- Ruby
|
||||
|
||||
You need to be very comfortable in the language and be knowledgeable.
|
||||
Tu dois être très comfortable avec la langue et tu dois aussi savoir beaucoup à propos la langue.
|
||||
|
||||
Read more about choices:
|
||||
Lis à propos vos choix:
|
||||
- http://www.byte-by-byte.com/choose-the-right-language-for-your-coding-interview/
|
||||
- http://blog.codingforinterviews.com/best-programming-language-jobs/
|
||||
- https://www.quora.com/What-is-the-best-language-to-program-in-for-an-in-person-Google-interview
|
||||
|
||||
[See language resources here](programming-language-resources.md)
|
||||
[Regarde les ressources pour chaque langue ici](programming-language-resources.md)
|
||||
|
||||
You'll see some C, C++, and Python learning included below, because I'm learning. There are a few books involved, see the bottom.
|
||||
Vous voyez C, C++ et Python en dessous, parce que j'apprends. Il y a quelques livres qui vont t'aider, regarde en dessous.
|
||||
|
||||
## Book List
|
||||
## Liste de livres
|
||||
|
||||
This is a shorter list than what I used. This is abbreviated to save you time.
|
||||
Voici une liste que j'ai réduite afin de vous faire gagner du temps.
|
||||
|
||||
### Interview Prep
|
||||
### Préparation de l'entretien
|
||||
|
||||
- [ ] [Programming Interviews Exposed: Secrets to Landing Your Next Job, 2nd Edition](http://www.wiley.com/WileyCDA/WileyTitle/productCd-047012167X.html)
|
||||
- answers in C++ and Java
|
||||
- recommended in Google candidate coaching
|
||||
- [ ] [Entretien de développement dévoilé : Les secrets pour avoir votre prochain job, 2 ème édition](http://www.wiley.com/WileyCDA/WileyTitle/productCd-047012167X.html)
|
||||
- réponses en c++ et java
|
||||
- recommandé par un candidat en coaching de Google
|
||||
- this is a good warm-up for Cracking the Coding Interview
|
||||
- not too difficult, most problems may be easier than what you'll see in an interview (from what I've read)
|
||||
- c'est un bon échauffement pour cracker l'entretien de développement
|
||||
- pas trop difficile, la plupart des problèmes seront plus faciles que ceux que vous aurez dans l'entretien (de ce que j'ai lu)
|
||||
- [ ] [Cracking the Coding Interview, 6th Edition](http://www.amazon.com/Cracking-Coding-Interview-6th-Programming/dp/0984782850/)
|
||||
- answers in Java
|
||||
- recommended on the [Google Careers site](https://www.google.com/about/careers/how-we-hire/interview/)
|
||||
- If you see people reference "The Google Resume", it was a book replaced by "Cracking the Coding Interview".
|
||||
- réponses en java
|
||||
- recommandé sur le [Google Careers site](https://www.google.com/about/careers/how-we-hire/interview/)
|
||||
- Si vous voyez des personnes faire référence à "The Google Resume", c'était le livre remplacé par "Cracking the Coding Interview"
|
||||
|
||||
If you have tons of extra time:
|
||||
Si vous avez beaucoup de temps libre:
|
||||
|
||||
- [ ] [Elements of Programming Interviews](https://www.amazon.com/Elements-Programming-Interviews-Insiders-Guide/dp/1479274836)
|
||||
- all code is in C++, very good if you're looking to use C++ in your interview
|
||||
- a good book on problem solving in general.
|
||||
- Tout le code est en C++, très utile si vous cherchez à utiliser du C++ pendant l'entretien
|
||||
- Un très bon livre sur la résolution de problème dans son ensemble
|
||||
|
||||
### Computer Architecture
|
||||
### Architecture de l'ordinateur
|
||||
|
||||
If short on time:
|
||||
Si vous n'avez pas beaucoup de temps :
|
||||
|
||||
- [ ] [Write Great Code: Volume 1: Understanding the Machine](https://www.amazon.com/Write-Great-Code-Understanding-Machine/dp/1593270038)
|
||||
- The book was published in 2004, and is somewhat outdated, but it's a terrific resource for understanding a computer in brief.
|
||||
- The author invented HLA, so take mentions and examples in HLA with a grain of salt. Not widely used, but decent examples of what assembly looks like.
|
||||
- These chapters are worth the read to give you a nice foundation:
|
||||
- Chapter 2 - Numeric Representation
|
||||
- Chapter 3 - Binary Arithmetic and Bit Operations
|
||||
- Chapter 4 - Floating-Point Representation
|
||||
- Chapter 5 - Character Representation
|
||||
- Chapter 6 - Memory Organization and Access
|
||||
- Chapter 7 - Composite Data Types and Memory Objects
|
||||
- Chapter 9 - CPU Architecture
|
||||
- Chapter 10 - Instruction Set Architecture
|
||||
- Chapter 11 - Memory Architecture and Organization
|
||||
- Le livre est un peu dépassé car il a été publié en 2004, mais il reste intéressant pour comprendre brièvement comment marche un ordinateur.
|
||||
- L'auteur a inventé HLA, prenez donc ses remarques et ses exemples sur le HLA avec scepticisme. Il n'est pas souvent cité mais propose de nombreux exemples sur ce à quoi un assembleur ressemble
|
||||
- Ces chapitres vous donneront des fondations :
|
||||
- Chapitre 2 - Représentation numérique
|
||||
- Chapitre 3 - Arithmétique binaire et les opérations bit à bit
|
||||
- Chapitre 4 - Floating-Point Representation
|
||||
- Chapitre 4 - La représentation de la virgule flottante
|
||||
- Chapitre 5 - Représentation caractérielle
|
||||
- Chapitre 6 - Organisation et accès de la mémoire
|
||||
- Chapitre 7 - Type de données composites et les objets de mémoire
|
||||
- Chapitre 9 - Architecture CPU
|
||||
- Chapitre 10 - Jeu d'instructions
|
||||
- Chapitre 11 - Organisation et architecture de la mémoire
|
||||
|
||||
If you have more time (I want this book):
|
||||
Si vous avez plus de temps (Je veux ce livre):
|
||||
|
||||
- [ ] [Computer Architecture, Fifth Edition: A Quantitative Approach](https://www.amazon.com/dp/012383872X/)
|
||||
- For a richer, more up-to-date (2011), but longer treatment
|
||||
- Pour quelque chose de plus récent (2011) mais qui prendre plus de temps.
|
||||
|
||||
### Language Specific
|
||||
### Sur les langages
|
||||
|
||||
**You need to choose a language for the interview (see above).** Here are my recommendations by language. I don't have resources for all languages. I welcome additions.
|
||||
**Vous avez besoin de choisir un langage pour l'entretien (voir au-dessus).** Voici mes recommandations sur les différents langages. Je n'ai pas de ressources pour tous les langages alors n'hésitez pas à en rajouter.
|
||||
|
||||
If you read though one of these, you should have all the data structures and algorithms knowledge you'll need to start doing coding problems.
|
||||
**You can skip all the video lectures in this project**, unless you'd like a review.
|
||||
Si vous lisez un d'eux, vous devez d'abord avoir toutes les connaissances sur les structures de données et les algorithmes pour pouvoir résoudre des problèmes de codage.
|
||||
**Vous pouvez passer toutes les vidéos de cours de ce projet**, à moins que vous voulez un avis.
|
||||
|
||||
[Additional language-specific resources here.](programming-language-resources.md)
|
||||
|
||||
### C++
|
||||
|
||||
I haven't read these two, but they are highly rated and written by Sedgewick. He's awesome.
|
||||
Je n'ai pas lu ces deux-là mais ils sont bien notées et écrit par Sedgewick. Il est incroyable.
|
||||
|
||||
- [ ] [Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching](https://www.amazon.com/Algorithms-Parts-1-4-Fundamentals-Structure/dp/0201350882/)
|
||||
- [ ] [Algorithms in C++ Part 5: Graph Algorithms](https://www.amazon.com/Algorithms-Part-Graph-3rd-Pt-5/dp/0201361183/)
|
||||
|
||||
If you have a better recommendation for C++, please let me know. Looking for a comprehensive resource.
|
||||
Si vous avez une meilleure recommandation pour le C++, dites le moi. Je recherche des ressources plus compréhensives.
|
||||
|
||||
### Java
|
||||
|
||||
- [ ] [Algorithms (Sedgewick and Wayne)](https://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/)
|
||||
- videos with book content (and Sedgewick!):
|
||||
- les vidéos avec le contenu des livres (and Sedgewick!):
|
||||
- [Algorithms I](https://www.youtube.com/user/algorithmscourses/playlists?view=50&sort=dd&shelf_id=2)
|
||||
- [Algorithms II](https://www.youtube.com/user/algorithmscourses/playlists?shelf_id=3&view=50&sort=dd)
|
||||
|
||||
OR:
|
||||
OU:
|
||||
|
||||
- [ ] [Data Structures and Algorithms in Java](https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/1118771338/)
|
||||
- by Goodrich, Tamassia, Goldwasser
|
||||
- used as optional text for CS intro course at UC Berkeley
|
||||
- see my book report on the Python version below. This book covers the same topics.
|
||||
- par Goodrich, Tamassia, Goldwasser
|
||||
- utilisé pour du texte optionnel dans les cours d'introduction à l'informatique à l'UC Berkeley
|
||||
- allez voir le rapport que j'ai fait sur le Python proposé en-dessous. Ce livre couvre les mêmes sujets.
|
||||
|
||||
### Python
|
||||
|
||||
- [ ] [Data Structures and Algorithms in Python](https://www.amazon.com/Structures-Algorithms-Python-Michael-Goodrich/dp/1118290275/)
|
||||
- by Goodrich, Tamassia, Goldwasser
|
||||
- par Goodrich, Tamassia, Goldwasser
|
||||
- I loved this book. It covered everything and more.
|
||||
- j'ai aimé ce livre, il couvrait tout voire plus.
|
||||
- Pythonic code
|
||||
- my glowing book report: https://googleyasheck.com/book-report-data-structures-and-algorithms-in-python/
|
||||
- mon rapport : https://googleyasheck.com/book-report-data-structures-and-algorithms-in-python/
|
||||
|
||||
|
||||
### Optional Books
|
||||
### Livres optionnels
|
||||
|
||||
**Some people recommend these, but I think it's going overboard, unless you have many years of software engineering experience and expect a much harder interview:**
|
||||
**Plusieurs personnes les recommandes, cependant je pense qu'ils vont trop loin, à moins que vous ayez plusieurs années dans le développement logiciel and que vous vous attendez à un entretien bien plus difficile**
|
||||
|
||||
- [ ] [Algorithm Design Manual](http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1849967202) (Skiena)
|
||||
- As a review and problem recognition
|
||||
- The algorithm catalog portion is well beyond the scope of difficulty you'll get in an interview.
|
||||
- This book has 2 parts:
|
||||
- En tant qu'examen et reconnaissance de problème
|
||||
- Le catalogue algorithmique est bien plus difficile que ce que vous aurez pendant l'entretien.
|
||||
- Ce livre est divisé en deux parties :
|
||||
- class textbook on data structures and algorithms
|
||||
- pros:
|
||||
- is a good review as any algorithms textbook would be
|
||||
- nice stories from his experiences solving problems in industry and academia
|
||||
- code examples in C
|
||||
- cons:
|
||||
- can be as dense or impenetrable as CLRS, and in some cases, CLRS may be a better alternative for some subjects
|
||||
- pour:
|
||||
- est une bonne critique comme n'importe quel manuel le serait
|
||||
- des histoires intéressantes venant de son expérience dans la résolution de problèmes dans l'industriel et l'académique
|
||||
- des exemples de code en C
|
||||
- contre:
|
||||
- peut être aussi dense ou impénétrable que CLRS, et dans plusieurs cas, CLRS peut être une meilleure alternative sur certains sujets
|
||||
- chapters 7, 8, 9 can be painful to try to follow, as some items are not explained well or require more brain than I have
|
||||
- don't get me wrong: I like Skiena, his teaching style, and mannerisms, but I may not be Stony Brook material.
|
||||
- les chapitres 7, 8, 9 peuvent être difficiles à suivre, comme certains points ne sont pas bien expliqués ou requiert une plus grande concentration pour comprendre
|
||||
- ne vous méprenez pas, J'aime bien Skiena, sa pédagogie et ses manières mais je ne suis pas fais pas Stony Brook
|
||||
- algorithm catalog:
|
||||
- this is the real reason you buy this book.
|
||||
- about to get to this part. Will update here once I've made my way through it.
|
||||
|
|
@ -469,7 +468,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
|
||||
|
|
@ -561,7 +560,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/)
|
||||
- [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/)
|
||||
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
If some of the lectures are too mathy, you can jump down to the bottom and
|
||||
watch the discrete mathematics videos to get the background knowledge.
|
||||
|
|
@ -573,12 +572,8 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] Description:
|
||||
- [Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays)
|
||||
- [UCBerkley CS61B - Linear and Multi-Dim Arrays (video)](https://youtu.be/Wp8oiO_CZZE?t=15m32s)
|
||||
- [Basic Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_04-basicArrays.mp4)
|
||||
- [Multi-dim (video)](https://archive.org/details/0102WhatYouShouldKnow/02_05-multidimensionalArrays.mp4)
|
||||
- [Dynamic Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays)
|
||||
- [Jagged Arrays (video)](https://www.youtube.com/watch?v=1jtrQqYpt7g)
|
||||
- [Jagged Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_06-jaggedArrays.mp4)
|
||||
- [Resizing arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/03_01-resizableArrays.mp4)
|
||||
- [ ] Implement a vector (mutable array with automatic resizing):
|
||||
- [ ] Practice coding using arrays and pointers, and pointer math to jump to an index instead of using indexing.
|
||||
- [ ] new raw data array with allocated memory
|
||||
|
|
@ -609,6 +604,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] Description:
|
||||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists)
|
||||
- [ ] [CS 61B - Linked Lists (video)](https://www.youtube.com/watch?v=sJtJOtXCW_M&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=5)
|
||||
- [ ] [[Review] Linked lists in 4 minutes (video)](https://youtu.be/F8AbOfQwl1c)
|
||||
- [ ] [C Code (video)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
|
||||
- not the whole video, just portions about Node struct and memory allocation.
|
||||
- [ ] Linked List vs Arrays:
|
||||
|
|
@ -640,14 +636,13 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
|
||||
- ### Stack
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [Using Stacks Last-In First-Out (video)](https://archive.org/details/0102WhatYouShouldKnow/05_01-usingStacksForLast-inFirst-out.mp4)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Will not implement. Implementing with array is trivial.
|
||||
|
||||
- ### Queue
|
||||
- [ ] [Using Queues First-In First-Out(video)](https://archive.org/details/0102WhatYouShouldKnow/05_03-usingQueuesForFirst-inFirst-out.mp4)
|
||||
- [ ] [Queue (video)](https://www.coursera.org/learn/data-structures/lecture/EShpq/queue)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [Priority Queues (video)](https://archive.org/details/0102WhatYouShouldKnow/05_04-priorityQueuesAndDeques.mp4)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] Implement using linked-list, with tail pointer:
|
||||
- enqueue(value) - adds value at position at tail
|
||||
- dequeue() - returns value and removes least recently added element (front)
|
||||
|
|
@ -672,12 +667,9 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [PyCon 2010: The Mighty Dictionary (video)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
|
||||
- [ ] [(Advanced) Randomization: Universal & Perfect Hashing (video)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(Advanced) Perfect hashing (video)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4)
|
||||
- [ ] [[Review] Hash tables in 4 minutes (video)](https://youtu.be/knV86FlSXJ8)
|
||||
|
||||
- [ ] Online Courses:
|
||||
- [ ] [Understanding Hash Functions (video)](https://archive.org/details/0102WhatYouShouldKnow/06_02-understandingHashFunctions.mp4)
|
||||
- [ ] [Using Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_03-usingHashTables.mp4)
|
||||
- [ ] [Supporting Hashing (video)](https://archive.org/details/0102WhatYouShouldKnow/06_04-supportingHashing.mp4)
|
||||
- [ ] [Language Support Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_05-languageSupportForHashTables.mp4)
|
||||
- [ ] [Core Hash Tables (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables)
|
||||
- [ ] [Data Structures (video)](https://www.coursera.org/learn/data-structures/home/week/3)
|
||||
- [ ] [Phone Book Problem (video)](https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem)
|
||||
|
|
@ -698,12 +690,13 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [Binary Search (video)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [Binary Search (video)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [detail](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Implement:
|
||||
- binary search (on sorted array of integers)
|
||||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.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:
|
||||
|
|
@ -732,7 +725,6 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
## Trees
|
||||
|
||||
- ### Trees - Notes & Background
|
||||
- [ ] [Series: Core Trees (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees)
|
||||
- [ ] [Series: Trees (video)](https://www.coursera.org/learn/data-structures/lecture/95qda/trees)
|
||||
- basic tree construction
|
||||
- traversal
|
||||
|
|
@ -752,6 +744,9 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- inorder (DFS: left, self, right)
|
||||
- postorder (DFS: left, right, self)
|
||||
- preorder (DFS: self, left, right)
|
||||
- [ ] [[Review] Breadth-first search in 4 minutes (video)](https://youtu.be/HZ5YTanv5QE)
|
||||
- [ ] [[Review] Depth-first search in 4 minutes (video)](https://youtu.be/Urx87-NMm6c)
|
||||
- [ ] [[Review] Tree Traversal (playlist) in 11 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b)
|
||||
|
||||
- ### Binary search trees: BSTs
|
||||
- [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -799,6 +794,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [MIT: Heaps and Heap Sort (video)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B Lecture 24: Priority Queues (video)](https://www.youtube.com/watch?v=yIUFT6AKBGE&index=24&list=PL4BBB74C7D2A1049C)
|
||||
- [ ] [Linear Time BuildHeap (max-heap)](https://www.youtube.com/watch?v=MiyLo8adrWw)
|
||||
- [ ] [[Review] Heap (playlist) in 13 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNsyqgPW-DNwUeT8F8uhWc6)
|
||||
- [ ] Implement a max-heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - needed for insert
|
||||
|
|
@ -828,25 +824,6 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
|
||||
- For heapsort, see Heap data structure above. Heap sort is great, but not stable.
|
||||
|
||||
- [ ] [Sedgewick - Mergesort (5 videos)](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [1. Mergesort](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=1)
|
||||
- [ ] [2. Bottom up Mergesort](https://www.youtube.com/watch?v=HGOIGUYjeyk&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=2)
|
||||
- [ ] [3. Sorting Complexity](https://www.youtube.com/watch?v=WvU_mIWo0Ac&index=3&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [4. Comparators](https://www.youtube.com/watch?v=7MvC1kmBza0&index=4&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [5. Stability](https://www.youtube.com/watch?v=XD_5iINB5GI&index=5&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
|
||||
- [ ] [Sedgewick - Quicksort (4 videos)](https://www.youtube.com/playlist?list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [1. Quicksort](https://www.youtube.com/watch?v=5M5A7qPWk84&index=1&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [2. Selection](https://www.youtube.com/watch?v=CgVYfSyct_M&index=2&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [3. Duplicate Keys](https://www.youtube.com/watch?v=WBFzOYJ5ybM&index=3&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [4. System Sorts](https://www.youtube.com/watch?v=rejpZ2htBjE&index=4&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
|
||||
- [ ] UC Berkeley:
|
||||
- [ ] [CS 61B Lecture 29: Sorting I (video)](https://www.youtube.com/watch?v=EiUvYS2DT6I&list=PL4BBB74C7D2A1049C&index=29)
|
||||
- [ ] [CS 61B Lecture 30: Sorting II (video)](https://www.youtube.com/watch?v=2hTY3t80Qsk&list=PL4BBB74C7D2A1049C&index=30)
|
||||
- [ ] [CS 61B Lecture 32: Sorting III (video)](https://www.youtube.com/watch?v=Y6LOLpxg6Dc&index=32&list=PL4BBB74C7D2A1049C)
|
||||
- [ ] [CS 61B Lecture 33: Sorting V (video)](https://www.youtube.com/watch?v=qNMQ4ly43p4&index=33&list=PL4BBB74C7D2A1049C)
|
||||
|
||||
- [ ] [Bubble Sort (video)](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB)
|
||||
- [ ] [Analyzing Bubble Sort (video)](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB)
|
||||
- [ ] [Insertion Sort, Merge Sort (video)](https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
|
|
@ -864,6 +841,14 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [Implementation (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c)
|
||||
- [ ] [Implementation (Python)](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py)
|
||||
|
||||
- [ ] [[Review] Sorting (playlist) in 18 minutes](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOZSbGAXAPIq1BeUf4j20pl)
|
||||
- [ ] [Quick sort in 4 minutes (video)](https://youtu.be/Hoixgm4-P4M)
|
||||
- [ ] [Heap sort in 4 minutes (video)](https://youtu.be/2DmK_H7IdTo)
|
||||
- [ ] [Merge sort in 3 minutes (video)](https://youtu.be/4VqmGXwpLqc)
|
||||
- [ ] [Bubble sort in 2 minutes (video)](https://youtu.be/xli_FI7CuzA)
|
||||
- [ ] [Selection sort in 3 minutes (video)](https://youtu.be/g-PGLbMth_g)
|
||||
- [ ] [Insertion sort in 2 minutes (video)](https://youtu.be/JU767SDMDvA)
|
||||
|
||||
- [ ] Implement:
|
||||
- [ ] Mergesort: O(n log n) average and worst case
|
||||
- [ ] Quicksort O(n log n) average case
|
||||
|
|
@ -921,6 +906,8 @@ Graphs can be used to represent many problems in computer science, so this secti
|
|||
- [ ] [CS 61B 2014: Weighted graphs (video)](https://www.youtube.com/watch?v=aJjlQCFwylA&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=19)
|
||||
- [ ] [Greedy Algorithms: Minimum Spanning Tree (video)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||
- [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (video)](https://www.youtube.com/watch?v=RpgcYiky7uw)
|
||||
- [ ] [[Review] Shortest Path Algorithms (playlist) in 16 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO-Y-H3xIC9DGSfVYJng9Yw)
|
||||
- [ ] [[Review] Minimum Spanning Trees (playlist) in 4 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZObEi3Hf6lmyW-CBfs7nkOV)
|
||||
|
||||
- Full Coursera Course:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -961,7 +948,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- when it is appropriate to use it
|
||||
- how is tail recursion better than not?
|
||||
- [ ] [What Is Tail Recursion Why Is It So Bad?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad)
|
||||
- [ ] [Tail Recursion (video)](https://www.youtube.com/watch?v=L1jjXGfxozc)
|
||||
- [ ] [Tail Recursion (video)](https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1)
|
||||
|
||||
- ### Object-Oriented Programming
|
||||
- [ ] [Optional: UML 2.0 Series (video)](https://www.youtube.com/watch?v=OkC7HKtiZC0&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc)
|
||||
|
|
@ -1248,7 +1235,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
|
||||
|
|
@ -1288,34 +1275,9 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
|
||||
- [ ] Series of 2-3 minutes short subject videos (23 videos)
|
||||
- [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (18 videos):
|
||||
- [Videos](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] [Sedgewick Videos - Algorithms I](https://www.youtube.com/user/algorithmscourses/playlists?shelf_id=2&view=50&sort=dd)
|
||||
- [ ] [01. Union-Find](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
||||
- [ ] [02. Analysis of Algorithms](https://www.youtube.com/watch?v=ZN-nFW0mEpg&list=PLe-ggMe31CTf0_bkOhh7sa5uqeppp3Sr0)
|
||||
- [ ] [03. Stacks and Queues](https://www.youtube.com/watch?v=TIC1gappbP8&list=PLe-ggMe31CTe-9jhnj3P_3mmrCh0A7iHh)
|
||||
- [ ] [04. Elementary Sorts](https://www.youtube.com/watch?v=CD2AL6VO0ak&list=PLe-ggMe31CTe_5WhGV0F--7CK8MoRUqBd)
|
||||
- [ ] [05. Mergesort](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [06. Quicksort](https://www.youtube.com/watch?v=5M5A7qPWk84&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [07. Priority Queues](https://www.youtube.com/watch?v=G9TMe0KC0w0&list=PLe-ggMe31CTducy9LDiGVkdSv0NfiRwn5)
|
||||
- [ ] [08. Elementary Symbol Tables](https://www.youtube.com/watch?v=up_nlilw3ac&list=PLe-ggMe31CTc3a8nKRDxFZZrWrBvkc9SG)
|
||||
- [ ] [09. Balanced Search Trees](https://www.youtube.com/watch?v=qC1BLLPK_5w&list=PLe-ggMe31CTf7jHH_mFT50kayjCEA6Rhu)
|
||||
- [ ] [10. Geometric Applications of BST](https://www.youtube.com/watch?v=Wl30aGAp6TY&list=PLe-ggMe31CTdBsRIw0hXln0hilRs-DqAx)
|
||||
- [ ] [11. Hash Tables](https://www.youtube.com/watch?v=QA8fJGO-i9o&list=PLe-ggMe31CTcKxIRGqqThMts2eHtSrf11)
|
||||
- [ ] [Sedgewick Videos - Algorithms II](https://www.youtube.com/user/algorithmscourses/playlists?flow=list&shelf_id=3&view=50)
|
||||
- [ ] [01. Undirected Graphs](https://www.youtube.com/watch?v=GmVhD-mmMBg&list=PLe-ggMe31CTc0zDzANxl4I2MhMoRVlbRM)
|
||||
- [ ] [02. Directed Graphs](https://www.youtube.com/watch?v=_z-JsVaUS40&list=PLe-ggMe31CTcEwaU8a1P1Gd95A77HV85K)
|
||||
- [ ] [03. Minimum Spanning Trees](https://www.youtube.com/watch?v=t8fNk9tfVYY&list=PLe-ggMe31CTceUZxDesGfHGLE7kcSafqj)
|
||||
- [ ] [04. Shortest Paths](https://www.youtube.com/watch?v=HoGSiB7tSeI&list=PLe-ggMe31CTePpG3jbeOTsnGUGZDKxgZD)
|
||||
- [ ] [05. Maximum Flow](https://www.youtube.com/watch?v=rYIKlFstBqE&list=PLe-ggMe31CTduQ68XQ-sVj32wYJIspTma)
|
||||
- [ ] [06. Radix Sorts](https://www.youtube.com/watch?v=HKPrVm5FWvg&list=PLe-ggMe31CTcNvUX9E3tQeM6ntrdR8e53)
|
||||
- [ ] [07. Tries](https://www.youtube.com/watch?v=00YaFPcC65g&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ)
|
||||
- [ ] [08. Substring Search](https://www.youtube.com/watch?v=QzI0p6zDjK4&list=PLe-ggMe31CTdAdjXB3lIuf2maubzo9t66)
|
||||
- [ ] [09. Regular Expressions](https://www.youtube.com/watch?v=TQWNQsJSPnk&list=PLe-ggMe31CTetTlJWouM42fyttyKPgSDh)
|
||||
- [ ] [10. Data Compression](https://www.youtube.com/watch?v=at9tjpxcBh8&list=PLe-ggMe31CTciifRRo6yY0Yt0mzgIXXVZ)
|
||||
- [ ] [11. Reductions](https://www.youtube.com/watch?v=Ow5x-ooMGv8&list=PLe-ggMe31CTe_yliW5vc3yO-dj1LSSDyF)
|
||||
- [ ] [12. Linear Programming](https://www.youtube.com/watch?v=rWhcLyiLZLA&list=PLe-ggMe31CTdy6dKzMgkWFuTTN1H8B-E1)
|
||||
- [ ] [13. Intractability](https://www.youtube.com/watch?v=6qcaaDp4cdQ&list=PLe-ggMe31CTcZCjluBHw53e_ek2k9Kn-S)
|
||||
- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos):
|
||||
- [Videos](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1350,7 +1312,6 @@ Supplemental:
|
|||
- [Mathematics for Topcoders](https://www.topcoder.com/community/data-science/data-science-tutorials/mathematics-for-topcoders/)
|
||||
- [Dynamic Programming – From Novice to Advanced](https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/)
|
||||
- [MIT Interview Materials](https://web.archive.org/web/20160906124824/http://courses.csail.mit.edu/iap/interview/materials.php)
|
||||
- [Exercises for getting better at a given language](http://exercism.io/languages)
|
||||
|
||||
**Read and Do Programming Problems (in this order):**
|
||||
|
||||
|
|
@ -1378,10 +1339,10 @@ Challenge sites:
|
|||
- [Codility](https://codility.com/programmers/)
|
||||
- [InterviewCake](https://www.interviewcake.com/)
|
||||
- [Geeks for Geeks](http://www.geeksforgeeks.org/)
|
||||
- [InterviewBit](https://www.interviewbit.com/invite/icjf)
|
||||
- [InterviewBit](https://www.interviewbit.com)
|
||||
|
||||
Maybe:
|
||||
- [Mock interviewers from big companies](http://www.gainlo.co/)
|
||||
- [Mock interviewers from big companies](http://www.gainlo.co/#!/)
|
||||
|
||||
## Once you're closer to the interview
|
||||
|
||||
|
|
@ -1535,7 +1496,6 @@ You're never really done.
|
|||
- [Emacs Tutorial (Beginners) -Part 3- Expressions, Statements, ~/.emacs file and packages](https://www.youtube.com/watch?v=paSgzPso-yc)
|
||||
- [Evil Mode: Or, How I Learned to Stop Worrying and Love Emacs (video)](https://www.youtube.com/watch?v=JWD1Fpdd4Pc)
|
||||
- [Writing C Programs With Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs)
|
||||
- [(maybe) Org Mode In Depth: Managing Structure (video)](https://www.youtube.com/watch?v=nsGYet02bEk)
|
||||
|
||||
- ### Unix command line tools
|
||||
- suggested by Yegge, from an old Amazon recruiting post. I filled in the list below from good tools.
|
||||
|
|
@ -1724,6 +1684,7 @@ You're never really done.
|
|||
- [ ] [AVL Trees (video)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
||||
- [ ] [AVL Tree Implementation (video)](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation)
|
||||
- [ ] [Split And Merge](https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge)
|
||||
- [ ] [[Review] AVL Trees (playlist) in 19 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOUFgdIeOPuH6cfSnNRMau-)
|
||||
|
||||
- [ ] **Splay trees**
|
||||
- In practice:
|
||||
|
|
@ -1749,6 +1710,7 @@ You're never really done.
|
|||
- [ ] [Aduni - Algorithms - Lecture 5 (video)](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5)
|
||||
- [ ] [Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree)
|
||||
- [ ] [An Introduction To Binary Search And Red Black Tree](https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-binary-search-and-red-black-trees/)
|
||||
- [[Review] Red-Black Trees (playlist) in 30 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNqDI8qfOZgzbqahCUmUEin)
|
||||
|
||||
- [ ] **2-3 search trees**
|
||||
- In practice:
|
||||
|
|
@ -1788,6 +1750,7 @@ You're never really done.
|
|||
- [ ] [MIT 6.851 - Memory Hierarchy Models (video)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
- covers cache-oblivious B-Trees, very interesting data structures
|
||||
- the first 37 minutes are very technical, may be skipped (B is block size, cache line size)
|
||||
- [[Review] B-Trees (playlist) in 26 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz)
|
||||
|
||||
|
||||
- ### k-D Trees
|
||||
|
|
@ -1806,10 +1769,6 @@ You're never really done.
|
|||
- [ ] [Ford-Fulkerson Algorithm (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0)
|
||||
- [ ] [Network Flows (video)](https://www.youtube.com/watch?v=2vhN4Ice5jI)
|
||||
|
||||
- ### Disjoint Sets & Union Find
|
||||
- [ ] [UCB 61B - Disjoint Sets; Sorting & selection (video)](https://www.youtube.com/watch?v=MAEGXTwmUsI&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=21)
|
||||
- [ ] [Sedgewick Algorithms - Union-Find (6 videos)](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
||||
|
||||
- ### Math for Fast Processing
|
||||
- [ ] [Integer Arithmetic, Karatsuba Multiplication (video)](https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [The Chinese Remainder Theorem (used in cryptography) (video)](https://www.youtube.com/watch?v=ru7mWZJlRQg)
|
||||
|
|
@ -1852,7 +1811,6 @@ You're never really done.
|
|||
- [Google's Deep Learning Nanodegree](https://www.udacity.com/course/deep-learning--ud730)
|
||||
- [Google/Kaggle Machine Learning Engineer Nanodegree](https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009)
|
||||
- [Self-Driving Car Engineer Nanodegree](https://www.udacity.com/drive)
|
||||
- [Metis Online Course ($99 for 2 months)](http://www.thisismetis.com/explore-data-science)
|
||||
- Resources:
|
||||
- Books:
|
||||
- [Python Machine Learning](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/)
|
||||
|
|
@ -1957,7 +1915,7 @@ Sit back and enjoy. "Netflix and skill" :P
|
|||
|
||||
- [ ] [Computer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory](https://www.youtube.com/playlist?list=PL-XXv-cvA_iD8wQm8U0gG_Z1uHjImKXFy)
|
||||
|
||||
- [ ] [Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PL3o9D4Dl2FJ9q0_gtFXPh_H4POI5dK0yG)
|
||||
- [ ] [Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PLWX710qNZo_sNlSWRMVIh6kfTjolNaZ8t)
|
||||
|
||||
- [ ] [Discrete Mathematics Part 1 by Sarada Herke (5 videos)](https://www.youtube.com/playlist?list=PLGxuz-nmYlQPOc4w1Kp2MZrdqOOm4Jxeo)
|
||||
|
||||
|
|
@ -1998,7 +1956,7 @@ Sit back and enjoy. "Netflix and skill" :P
|
|||
|
||||
- [ ] [MIT 6.858 Computer Systems Security, Fall 2014](https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/view_play_list?p=9D558D49CA734A02)
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/playlist?list=PL9D558D49CA734A02)
|
||||
|
||||
- [ ] [Introduction to Cryptography by Christof Paar](https://www.youtube.com/playlist?list=PL6N5qY2nvvJE8X75VkXglSrVhLv1tVcfy)
|
||||
- [Course Website along with Slides and Problem Sets](http://www.crypto-textbook.com/)
|
||||
|
|
|
|||
|
|
@ -1,11 +1,29 @@
|
|||
# Coding Interview University אוניברסיטיה של ראיונות קוד
|
||||
<div dir='rtl'>
|
||||
<h2> על מה מדובר כאן?</h2>
|
||||
<p>
|
||||
בהתחלה, זאת היתה רשימה קצרה של נושאי לימוד כדי להיות מהנדס תוכנה, אבל עם הזמן הפרוייקט צמח להיות מה שאפשר לראות כיום.
|
||||
לאחר סיום תוכנית הלימודים הזאת,
|
||||
<a href='https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu'>התקבלתי לעבוד כמפתח תוכנה באמזון!</a>
|
||||
את\אתה כנראה לא תצטרכו ללמוד באותה כמות שאני למדתי. בכל אופן כל מה שאתם זקוקים לו נמצא פה.</p>
|
||||
<p>
|
||||
למדתי בין 8-12 שעות ביום, למשך מספר חודשים. זהו הסיפור שלי:
|
||||
<a href='https://medium.freecodecamp.org/why-i-studied-full-time-for-8-months-for-a-google-interview-cc662ce9bb13'> למה למדתי במשרה מלאה למשך שמונה חודשים בשביל ראיון עבודה בגוגל.</a>
|
||||
</p>
|
||||
<p><strong>אנא שימו לב:</strong> את\ה לא צריכים ללמוד באותה הכמות שאני למדתי. בזבזתי זמן רב על דברים שלא הייתי צריך לדעת. מידע נוסף על כך בהמשך. אני .אעזור לך לסיים מבלי לבזבז את זמנכם היקר
|
||||
</p>
|
||||
<p>הפריטים ברשימה המובאת כאן יכינו אותך לראיון טכני פחות או יותר בכל חברת טכנולוגיה, כולל הענקיות: אמזון, פייסבוק, גוגל ומייקרוסופט.</p>
|
||||
<br/>
|
||||
<p font-style='italic'>שיהיה המון בהצלחה!</p>
|
||||
</div>
|
||||
|
||||
## על מה מדובר כאן?
|
||||
זוהי התוכנית הפעולה אותה הגיתי על מנת להפוך בהצלחה ממפתח אתרים, ללא תואר במדעי המחשב, למהנדס תוכנה בחברת גוגל.
|
||||
|
||||
|
||||
רשימת המשימות הארוכה המצורפת להלן, הוצאה מקובץ האימון האישי אותו מפרסמת גוגל לעזור למועמדים פוטנציאליים **Google's coaching notes**. לפני שאתם מתחילים במשימה ישנם מספר דברים שעליכם לדעת.
|
||||
ישנם מספר דברים בתחתית הרשימה שמעוד יועילו בהכנה לראיון עצמו לאחר שצלחתם את חומר הלימוד,
|
||||
על מנת לפתור את הבעיות המוצגות בראיון ביעילות.
|
||||
<div align="center">
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
חלק גדול מהתכנים לקוחים מהאתר המצויין של סטיב יגיי: המשרה הזו בגוגל? שלך!
|
||||
"[Get that job at Google](http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html)"
|
||||
|
|
@ -13,7 +31,7 @@
|
|||
ערכתי וקיצרתי עבורכם את מה שלדעתי נדרש עבור מהנדס תוכנה מתחיל עם מעט ניסיון מתוך המקורות הנ"ל.
|
||||
עבור אלו מכם הרוצים הסבת מקצוע מפיתוח אתרים או פיתוח תוכנה בתפקידים כאלו ואחרים שאינם הנדסת תוכנה.
|
||||
עבור אלו מכם בעלי הניסיון כמהנדסי תוכנה, בייחוד אם ישנן שנות ניסיון רבות כמהנדס תוכנה בתחום, המשימות הנ"ל עלולות להיות קלות מדי והציפיות מהם בראיון לגוגל יהיו הרבה יותר גבוהות.
|
||||
במידה ואתם בעלי מספר שנות ניסיון כמפתחים, גוגל רואה בהנדסת תוכנה משהו שונה מתכנות נטו ולכן הדרישות הן שונות ודבוהות יותר.
|
||||
במידה ואתם בעלי מספר שנות ניסיון כמפתחים, גוגל רואה בהנדסת תוכנה משהו שונה מתכנות נטו ולכן הדרישות הן שונות וגבוהות יותר.
|
||||
עבור מהנדסי המערכת ומהנדסי האמינות שביניכם, השקיעו יותר בחומר המופיע ב"רשימת הרשות" זוהי רשימת משימות המכילה נושאי רשות עבור מהנדס תוכנה.
|
||||
---
|
||||
## תוכן העניינים Table of Contents
|
||||
|
|
@ -125,7 +143,6 @@
|
|||
- [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)
|
||||
|
|
@ -143,7 +160,7 @@
|
|||
|
||||
אני מתכונן לראיון בגוגל תוך כדי יישום תוכנית זו. בניתי את הרשת, בניתי שרותים ברשת, אני בונה ומשיק סטארטאפים מאז 1997.
|
||||
יש לי תואר בכלכלה, לא במדעי המחשב. הייתה לי קריירה מוצלחת אבל אני חולם לעבוד בגוגל.
|
||||
אני רוצה להתקדם ולעבוד עם מערכות גדולות יותר ולקבל הבנה מעמירה של מערכות מחשוב, אלגוריתמים יעילים, התנהגות בסיסי נתונים,
|
||||
אני רוצה להתקדם ולעבוד עם מערכות גדולות יותר ולקבל הבנה מעמיקה של מערכות מחשוב, אלגוריתמים יעילים, התנהגות בסיסי נתונים,
|
||||
I'm following this plan to prepare for my Google interview. I've been building the web, building
|
||||
services, and launching startups since 1997. I have an economics degree, not a CS degree. I've
|
||||
been very successful in my career, but I want to work at Google. I want to progress into larger systems
|
||||
|
|
@ -182,7 +199,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 +207,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)
|
||||
|
||||
## האם קיבלתי את העבודה?
|
||||
|
||||
|
|
@ -270,7 +287,6 @@ Sometimes the classes are not in session so you have to wait a couple of months,
|
|||
- [ ] [ארבעה צעדים לקראת גוגל בלי תואר](https://medium.com/always-be-coding/four-steps-to-google-without-a-degree-8f381aa6bd5e#.asalo1vfx)
|
||||
- [ ] [לוח מחיק](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1)
|
||||
- [ ] [How Google Thinks About Hiring, Management And Culture](http://www.kpcb.com/blog/lessons-learned-how-google-thinks-about-hiring-management-and-culture)
|
||||
- [ ] [Effective Whiteboarding during Programming Interviews](http://www.coderust.com/blog/2014/04/10/effective-whiteboarding-during-programming-interviews/)
|
||||
- [ ] Cracking The Coding Interview Set 1:
|
||||
- [ ] [Gayle L McDowell - Cracking The Coding Interview (video)](https://www.youtube.com/watch?v=rEJzOhC5ZtQ)
|
||||
- [ ] [Cracking the Coding Interview with Author Gayle Laakmann McDowell (video)](https://www.youtube.com/watch?v=aClxtDcdpsQ)
|
||||
|
|
@ -304,7 +320,7 @@ Read more about choices:
|
|||
|
||||
You'll see some C, C++, and Python learning included below, because I'm learning. There are a few books involved, see the bottom.
|
||||
|
||||
## Book List
|
||||
## רשימת ספרים
|
||||
|
||||
This is a shorter list than what I used. This is abbreviated to save you time.
|
||||
|
||||
|
|
@ -326,7 +342,7 @@ If you have tons of extra time:
|
|||
- all code is in C++, very good if you're looking to use C++ in your interview
|
||||
- a good book on problem solving in general.
|
||||
|
||||
### Computer Architecture
|
||||
### מבנה המחשב
|
||||
|
||||
If short on time:
|
||||
|
||||
|
|
@ -419,8 +435,8 @@ OR:
|
|||
- Can rent it on kindle
|
||||
- Half.com is a great resource for textbooks at good prices.
|
||||
- Answers:
|
||||
- [Solutions](http://www.algorithm.cs.sunysb.edu/algowiki/index.php/The_Algorithms_Design_Manual_(Second_Edition))
|
||||
- [Solutions](http://blog.panictank.net/category/algorithmndesignmanualsolutions/page/2/)
|
||||
- [פתרון](http://www.algorithm.cs.sunysb.edu/algowiki/index.php/The_Algorithms_Design_Manual_(Second_Edition))
|
||||
- [פתרון](http://blog.panictank.net/category/algorithmndesignmanualsolutions/page/2/)
|
||||
- [Errata](http://www3.cs.stonybrook.edu/~skiena/algorist/book/errata)
|
||||
|
||||
- [ ] [Introduction to Algorithms](https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844)
|
||||
|
|
@ -438,7 +454,7 @@ OR:
|
|||
- Would rather spend time on coding problems from another book or online coding problems.
|
||||
|
||||
|
||||
## Before you Get Started
|
||||
## לפני שאתם מתחילים
|
||||
|
||||
This list grew over many months, and yes, it kind of got out of hand.
|
||||
|
||||
|
|
@ -463,7 +479,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
|
||||
|
|
@ -542,8 +558,8 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [Big O Notations (general quick tutorial) (video)](https://www.youtube.com/watch?v=V6mKVRU1evU)
|
||||
- [ ] [Big O Notation (and Omega and Theta) - best mathematical explanation (video)](https://www.youtube.com/watch?v=ei-A_wy5Yxw&index=2&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN)
|
||||
- [ ] Skiena:
|
||||
- [video](https://www.youtube.com/watch?v=gSyDMtdPNpU&index=2&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b)
|
||||
- [slides](http://www3.cs.stonybrook.edu/~algorith/video-lectures/2007/lecture2.pdf)
|
||||
- [סרטון](https://www.youtube.com/watch?v=gSyDMtdPNpU&index=2&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b)
|
||||
- [מצגות](http://www3.cs.stonybrook.edu/~algorith/video-lectures/2007/lecture2.pdf)
|
||||
- [ ] [A Gentle Introduction to Algorithm Complexity Analysis](http://discrete.gr/complexity/)
|
||||
- [ ] [Orders of Growth (video)](https://class.coursera.org/algorithmicthink1-004/lecture/59)
|
||||
- [ ] [Asymptotics (video)](https://class.coursera.org/algorithmicthink1-004/lecture/61)
|
||||
|
|
@ -555,24 +571,20 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/)
|
||||
- [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
|
||||
If some of the lectures are too mathy, you can jump down to the bottom and
|
||||
watch the discrete mathematics videos to get the background knowledge.
|
||||
|
||||
## Data Structures
|
||||
## מבנה נתונים
|
||||
|
||||
- ### Arrays
|
||||
- ### מערכים
|
||||
- Implement an automatically resizing vector.
|
||||
- [ ] Description:
|
||||
- [Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays)
|
||||
- [UCBerkley CS61B - Linear and Multi-Dim Arrays (video)](https://youtu.be/Wp8oiO_CZZE?t=15m32s)
|
||||
- [Basic Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_04-basicArrays.mp4)
|
||||
- [Multi-dim (video)](https://archive.org/details/0102WhatYouShouldKnow/02_05-multidimensionalArrays.mp4)
|
||||
- [Dynamic Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays)
|
||||
- [Jagged Arrays (video)](https://www.youtube.com/watch?v=1jtrQqYpt7g)
|
||||
- [Jagged Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_06-jaggedArrays.mp4)
|
||||
- [Resizing arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/03_01-resizableArrays.mp4)
|
||||
- [ ] Implement a vector (mutable array with automatic resizing):
|
||||
- [ ] Practice coding using arrays and pointers, and pointer math to jump to an index instead of using indexing.
|
||||
- [ ] new raw data array with allocated memory
|
||||
|
|
@ -603,6 +615,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] Description:
|
||||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists)
|
||||
- [ ] [CS 61B - Linked Lists (video)](https://www.youtube.com/watch?v=sJtJOtXCW_M&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=5)
|
||||
- [ ] [[Review] Linked lists in 4 minutes (video)](https://youtu.be/F8AbOfQwl1c)
|
||||
- [ ] [C Code (video)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
|
||||
- not the whole video, just portions about Node struct and memory allocation.
|
||||
- [ ] Linked List vs Arrays:
|
||||
|
|
@ -632,16 +645,15 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [Description (video)](https://www.coursera.org/learn/data-structures/lecture/jpGKD/doubly-linked-lists)
|
||||
- No need to implement
|
||||
|
||||
- ### Stack
|
||||
- ### מחסנית
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [Using Stacks Last-In First-Out (video)](https://archive.org/details/0102WhatYouShouldKnow/05_01-usingStacksForLast-inFirst-out.mp4)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Will not implement. Implementing with array is trivial.
|
||||
|
||||
- ### Queue
|
||||
- [ ] [Using Queues First-In First-Out(video)](https://archive.org/details/0102WhatYouShouldKnow/05_03-usingQueuesForFirst-inFirst-out.mp4)
|
||||
- ### תור
|
||||
- [ ] [Queue (video)](https://www.coursera.org/learn/data-structures/lecture/EShpq/queue)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [Priority Queues (video)](https://archive.org/details/0102WhatYouShouldKnow/05_04-priorityQueuesAndDeques.mp4)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] Implement using linked-list, with tail pointer:
|
||||
- enqueue(value) - adds value at position at tail
|
||||
- dequeue() - returns value and removes least recently added element (front)
|
||||
|
|
@ -666,12 +678,9 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [PyCon 2010: The Mighty Dictionary (video)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
|
||||
- [ ] [(Advanced) Randomization: Universal & Perfect Hashing (video)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(Advanced) Perfect hashing (video)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4)
|
||||
- [ ] [[Review] Hash tables in 4 minutes (video)](https://youtu.be/knV86FlSXJ8)
|
||||
|
||||
- [ ] Online Courses:
|
||||
- [ ] [Understanding Hash Functions (video)](https://archive.org/details/0102WhatYouShouldKnow/06_02-understandingHashFunctions.mp4)
|
||||
- [ ] [Using Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_03-usingHashTables.mp4)
|
||||
- [ ] [Supporting Hashing (video)](https://archive.org/details/0102WhatYouShouldKnow/06_04-supportingHashing.mp4)
|
||||
- [ ] [Language Support Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_05-languageSupportForHashTables.mp4)
|
||||
- [ ] [Core Hash Tables (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables)
|
||||
- [ ] [Data Structures (video)](https://www.coursera.org/learn/data-structures/home/week/3)
|
||||
- [ ] [Phone Book Problem (video)](https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem)
|
||||
|
|
@ -686,18 +695,19 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- get(key)
|
||||
- remove(key)
|
||||
|
||||
## More Knowledge
|
||||
## ידע נוסף
|
||||
|
||||
- ### Binary search
|
||||
- ### חיפוש בינארי
|
||||
- [ ] [Binary Search (video)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [Binary Search (video)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [detail](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Implement:
|
||||
- binary search (on sorted array of integers)
|
||||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.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:
|
||||
|
|
@ -723,10 +733,9 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] absolute value:
|
||||
- [Absolute Integer](http://bits.stephan-brumme.com/absInteger.html)
|
||||
|
||||
## Trees
|
||||
## עצים
|
||||
|
||||
- ### Trees - Notes & Background
|
||||
- [ ] [Series: Core Trees (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees)
|
||||
- ### עצים - Notes & Background
|
||||
- [ ] [Series: Trees (video)](https://www.coursera.org/learn/data-structures/lecture/95qda/trees)
|
||||
- basic tree construction
|
||||
- traversal
|
||||
|
|
@ -746,6 +755,9 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- inorder (DFS: left, self, right)
|
||||
- postorder (DFS: left, right, self)
|
||||
- preorder (DFS: self, left, right)
|
||||
- [ ] [[Review] Breadth-first search in 4 minutes (video)](https://youtu.be/HZ5YTanv5QE)
|
||||
- [ ] [[Review] Depth-first search in 4 minutes (video)](https://youtu.be/Urx87-NMm6c)
|
||||
- [ ] [[Review] Tree Traversal (playlist) in 11 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b)
|
||||
|
||||
- ### Binary search trees: BSTs
|
||||
- [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -793,6 +805,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [MIT: Heaps and Heap Sort (video)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B Lecture 24: Priority Queues (video)](https://www.youtube.com/watch?v=yIUFT6AKBGE&index=24&list=PL4BBB74C7D2A1049C)
|
||||
- [ ] [Linear Time BuildHeap (max-heap)](https://www.youtube.com/watch?v=MiyLo8adrWw)
|
||||
- [ ] [[Review] Heap (playlist) in 13 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNsyqgPW-DNwUeT8F8uhWc6)
|
||||
- [ ] Implement a max-heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - needed for insert
|
||||
|
|
@ -806,7 +819,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] heap_sort() - take an unsorted array and turn it into a sorted array in-place using a max heap
|
||||
- note: using a min heap instead would save operations, but double the space needed (cannot do in-place).
|
||||
|
||||
## Sorting
|
||||
## מיונים
|
||||
|
||||
- [ ] Notes:
|
||||
- Implement sorts & know best case/worst case, average complexity of each:
|
||||
|
|
@ -822,25 +835,6 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
|
||||
- For heapsort, see Heap data structure above. Heap sort is great, but not stable.
|
||||
|
||||
- [ ] [Sedgewick - Mergesort (5 videos)](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [1. Mergesort](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=1)
|
||||
- [ ] [2. Bottom up Mergesort](https://www.youtube.com/watch?v=HGOIGUYjeyk&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=2)
|
||||
- [ ] [3. Sorting Complexity](https://www.youtube.com/watch?v=WvU_mIWo0Ac&index=3&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [4. Comparators](https://www.youtube.com/watch?v=7MvC1kmBza0&index=4&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [5. Stability](https://www.youtube.com/watch?v=XD_5iINB5GI&index=5&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
|
||||
- [ ] [Sedgewick - Quicksort (4 videos)](https://www.youtube.com/playlist?list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [1. Quicksort](https://www.youtube.com/watch?v=5M5A7qPWk84&index=1&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [2. Selection](https://www.youtube.com/watch?v=CgVYfSyct_M&index=2&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [3. Duplicate Keys](https://www.youtube.com/watch?v=WBFzOYJ5ybM&index=3&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [4. System Sorts](https://www.youtube.com/watch?v=rejpZ2htBjE&index=4&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
|
||||
- [ ] UC Berkeley:
|
||||
- [ ] [CS 61B Lecture 29: Sorting I (video)](https://www.youtube.com/watch?v=EiUvYS2DT6I&list=PL4BBB74C7D2A1049C&index=29)
|
||||
- [ ] [CS 61B Lecture 30: Sorting II (video)](https://www.youtube.com/watch?v=2hTY3t80Qsk&list=PL4BBB74C7D2A1049C&index=30)
|
||||
- [ ] [CS 61B Lecture 32: Sorting III (video)](https://www.youtube.com/watch?v=Y6LOLpxg6Dc&index=32&list=PL4BBB74C7D2A1049C)
|
||||
- [ ] [CS 61B Lecture 33: Sorting V (video)](https://www.youtube.com/watch?v=qNMQ4ly43p4&index=33&list=PL4BBB74C7D2A1049C)
|
||||
|
||||
- [ ] [Bubble Sort (video)](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB)
|
||||
- [ ] [Analyzing Bubble Sort (video)](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB)
|
||||
- [ ] [Insertion Sort, Merge Sort (video)](https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
|
|
@ -858,6 +852,14 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [Implementation (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c)
|
||||
- [ ] [Implementation (Python)](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py)
|
||||
|
||||
- [ ] [[Review] Sorting (playlist) in 18 minutes](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOZSbGAXAPIq1BeUf4j20pl)
|
||||
- [ ] [Quick sort in 4 minutes (video)](https://youtu.be/Hoixgm4-P4M)
|
||||
- [ ] [Heap sort in 4 minutes (video)](https://youtu.be/2DmK_H7IdTo)
|
||||
- [ ] [Merge sort in 3 minutes (video)](https://youtu.be/4VqmGXwpLqc)
|
||||
- [ ] [Bubble sort in 2 minutes (video)](https://youtu.be/xli_FI7CuzA)
|
||||
- [ ] [Selection sort in 3 minutes (video)](https://youtu.be/g-PGLbMth_g)
|
||||
- [ ] [Insertion sort in 2 minutes (video)](https://youtu.be/JU767SDMDvA)
|
||||
|
||||
- [ ] Implement:
|
||||
- [ ] Mergesort: O(n log n) average and worst case
|
||||
- [ ] Quicksort O(n log n) average case
|
||||
|
|
@ -915,6 +917,8 @@ Graphs can be used to represent many problems in computer science, so this secti
|
|||
- [ ] [CS 61B 2014: Weighted graphs (video)](https://www.youtube.com/watch?v=aJjlQCFwylA&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=19)
|
||||
- [ ] [Greedy Algorithms: Minimum Spanning Tree (video)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||
- [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (video)](https://www.youtube.com/watch?v=RpgcYiky7uw)
|
||||
- [ ] [[Review] Shortest Path Algorithms (playlist) in 16 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO-Y-H3xIC9DGSfVYJng9Yw)
|
||||
- [ ] [[Review] Minimum Spanning Trees (playlist) in 4 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZObEi3Hf6lmyW-CBfs7nkOV)
|
||||
|
||||
- Full Coursera Course:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -946,7 +950,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
|
||||
## Even More Knowledge
|
||||
|
||||
- ### Recursion
|
||||
- ### רקורסיה
|
||||
- [ ] Stanford lectures on recursion & backtracking:
|
||||
- [ ] [Lecture 8 | Programming Abstractions (video)](https://www.youtube.com/watch?v=gl3emqCuueQ&list=PLFE6E58F856038C69&index=8)
|
||||
- [ ] [Lecture 9 | Programming Abstractions (video)](https://www.youtube.com/watch?v=uFJhEPrbycQ&list=PLFE6E58F856038C69&index=9)
|
||||
|
|
@ -955,7 +959,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- when it is appropriate to use it
|
||||
- how is tail recursion better than not?
|
||||
- [ ] [What Is Tail Recursion Why Is It So Bad?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad)
|
||||
- [ ] [Tail Recursion (video)](https://www.youtube.com/watch?v=L1jjXGfxozc)
|
||||
- [ ] [Tail Recursion (video)](https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1)
|
||||
|
||||
- ### Object-Oriented Programming
|
||||
- [ ] [Optional: UML 2.0 Series (video)](https://www.youtube.com/watch?v=OkC7HKtiZC0&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc)
|
||||
|
|
@ -1038,12 +1042,12 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- [Jupyter Notebook](http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb)
|
||||
- Pages 1048 - 1140 in CLRS if you have it.
|
||||
|
||||
- ### Caches
|
||||
- [ ] LRU cache:
|
||||
- ### מטמון
|
||||
- [ ] LRU מטמון:
|
||||
- [ ] [The Magic of LRU Cache (100 Days of Google Dev) (video)](https://www.youtube.com/watch?v=R5ON3iwx78M)
|
||||
- [ ] [Implementing LRU (video)](https://www.youtube.com/watch?v=bq6N7Ym81iI)
|
||||
- [ ] [LeetCode - 146 LRU Cache (C++) (video)](https://www.youtube.com/watch?v=8-FZRAjR7qU)
|
||||
- [ ] CPU cache:
|
||||
- [ ] CPU מטמון:
|
||||
- [ ] [MIT 6.004 L15: The Memory Hierarchy (video)](https://www.youtube.com/watch?v=vjYF_fAZI5E&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-&index=24)
|
||||
- [ ] [MIT 6.004 L16: Cache Issues (video)](https://www.youtube.com/watch?v=ajgC3-pyGlk&index=25&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-)
|
||||
|
||||
|
|
@ -1107,7 +1111,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- [ ] [2015: How Developers Search for Code: A Case Study](http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43835.pdf)
|
||||
- [ ] [2016: Borg, Omega, and Kubernetes](http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44843.pdf)
|
||||
|
||||
- ### Testing
|
||||
- ### בדיקות
|
||||
- To cover:
|
||||
- how unit testing works
|
||||
- what are mock objects
|
||||
|
|
@ -1242,7 +1246,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
|
||||
|
|
@ -1262,7 +1266,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- infrastructure: load balancing, messaging
|
||||
- rough overview of any key algorithm that drives the service
|
||||
- consider bottlenecks and determine solutions
|
||||
- Exercises:
|
||||
- תרגילים :
|
||||
- [Design a CDN network: old article](http://repository.cmu.edu/cgi/viewcontent.cgi?article=2112&context=compsci)
|
||||
- [Design a random unique ID generation system](https://blog.twitter.com/2010/announcing-snowflake)
|
||||
- [Design an online multiplayer card game](http://www.indieflashblog.com/how-to-create-an-asynchronous-multiplayer-game.html)
|
||||
|
|
@ -1275,41 +1279,16 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
|
||||
---
|
||||
|
||||
## Final Review
|
||||
## חזרה סופית
|
||||
|
||||
This section will have shorter videos that can you watch pretty quickly to review most of the important concepts.
|
||||
It's nice if you want a refresher often.
|
||||
|
||||
- [ ] Series of 2-3 minutes short subject videos (23 videos)
|
||||
- [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (18 videos):
|
||||
- [Videos](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] [Sedgewick Videos - Algorithms I](https://www.youtube.com/user/algorithmscourses/playlists?shelf_id=2&view=50&sort=dd)
|
||||
- [ ] [01. Union-Find](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
||||
- [ ] [02. Analysis of Algorithms](https://www.youtube.com/watch?v=ZN-nFW0mEpg&list=PLe-ggMe31CTf0_bkOhh7sa5uqeppp3Sr0)
|
||||
- [ ] [03. Stacks and Queues](https://www.youtube.com/watch?v=TIC1gappbP8&list=PLe-ggMe31CTe-9jhnj3P_3mmrCh0A7iHh)
|
||||
- [ ] [04. Elementary Sorts](https://www.youtube.com/watch?v=CD2AL6VO0ak&list=PLe-ggMe31CTe_5WhGV0F--7CK8MoRUqBd)
|
||||
- [ ] [05. Mergesort](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [06. Quicksort](https://www.youtube.com/watch?v=5M5A7qPWk84&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [07. Priority Queues](https://www.youtube.com/watch?v=G9TMe0KC0w0&list=PLe-ggMe31CTducy9LDiGVkdSv0NfiRwn5)
|
||||
- [ ] [08. Elementary Symbol Tables](https://www.youtube.com/watch?v=up_nlilw3ac&list=PLe-ggMe31CTc3a8nKRDxFZZrWrBvkc9SG)
|
||||
- [ ] [09. Balanced Search Trees](https://www.youtube.com/watch?v=qC1BLLPK_5w&list=PLe-ggMe31CTf7jHH_mFT50kayjCEA6Rhu)
|
||||
- [ ] [10. Geometric Applications of BST](https://www.youtube.com/watch?v=Wl30aGAp6TY&list=PLe-ggMe31CTdBsRIw0hXln0hilRs-DqAx)
|
||||
- [ ] [11. Hash Tables](https://www.youtube.com/watch?v=QA8fJGO-i9o&list=PLe-ggMe31CTcKxIRGqqThMts2eHtSrf11)
|
||||
- [ ] [Sedgewick Videos - Algorithms II](https://www.youtube.com/user/algorithmscourses/playlists?flow=list&shelf_id=3&view=50)
|
||||
- [ ] [01. Undirected Graphs](https://www.youtube.com/watch?v=GmVhD-mmMBg&list=PLe-ggMe31CTc0zDzANxl4I2MhMoRVlbRM)
|
||||
- [ ] [02. Directed Graphs](https://www.youtube.com/watch?v=_z-JsVaUS40&list=PLe-ggMe31CTcEwaU8a1P1Gd95A77HV85K)
|
||||
- [ ] [03. Minimum Spanning Trees](https://www.youtube.com/watch?v=t8fNk9tfVYY&list=PLe-ggMe31CTceUZxDesGfHGLE7kcSafqj)
|
||||
- [ ] [04. Shortest Paths](https://www.youtube.com/watch?v=HoGSiB7tSeI&list=PLe-ggMe31CTePpG3jbeOTsnGUGZDKxgZD)
|
||||
- [ ] [05. Maximum Flow](https://www.youtube.com/watch?v=rYIKlFstBqE&list=PLe-ggMe31CTduQ68XQ-sVj32wYJIspTma)
|
||||
- [ ] [06. Radix Sorts](https://www.youtube.com/watch?v=HKPrVm5FWvg&list=PLe-ggMe31CTcNvUX9E3tQeM6ntrdR8e53)
|
||||
- [ ] [07. Tries](https://www.youtube.com/watch?v=00YaFPcC65g&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ)
|
||||
- [ ] [08. Substring Search](https://www.youtube.com/watch?v=QzI0p6zDjK4&list=PLe-ggMe31CTdAdjXB3lIuf2maubzo9t66)
|
||||
- [ ] [09. Regular Expressions](https://www.youtube.com/watch?v=TQWNQsJSPnk&list=PLe-ggMe31CTetTlJWouM42fyttyKPgSDh)
|
||||
- [ ] [10. Data Compression](https://www.youtube.com/watch?v=at9tjpxcBh8&list=PLe-ggMe31CTciifRRo6yY0Yt0mzgIXXVZ)
|
||||
- [ ] [11. Reductions](https://www.youtube.com/watch?v=Ow5x-ooMGv8&list=PLe-ggMe31CTe_yliW5vc3yO-dj1LSSDyF)
|
||||
- [ ] [12. Linear Programming](https://www.youtube.com/watch?v=rWhcLyiLZLA&list=PLe-ggMe31CTdy6dKzMgkWFuTTN1H8B-E1)
|
||||
- [ ] [13. Intractability](https://www.youtube.com/watch?v=6qcaaDp4cdQ&list=PLe-ggMe31CTcZCjluBHw53e_ek2k9Kn-S)
|
||||
- [סרטונים](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos):
|
||||
- [סרטונים](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1344,7 +1323,6 @@ Supplemental:
|
|||
- [Mathematics for Topcoders](https://www.topcoder.com/community/data-science/data-science-tutorials/mathematics-for-topcoders/)
|
||||
- [Dynamic Programming – From Novice to Advanced](https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/)
|
||||
- [MIT Interview Materials](https://web.archive.org/web/20160906124824/http://courses.csail.mit.edu/iap/interview/materials.php)
|
||||
- [Exercises for getting better at a given language](http://exercism.io/languages)
|
||||
|
||||
**Read and Do Programming Problems (in this order):**
|
||||
|
||||
|
|
@ -1372,11 +1350,11 @@ See [Book List above](#book-list)
|
|||
- [Codility](https://codility.com/programmers/)
|
||||
- [InterviewCake](https://www.interviewcake.com/)
|
||||
- [Geeks for Geeks](http://www.geeksforgeeks.org/)
|
||||
- [InterviewBit](https://www.interviewbit.com/invite/icjf)
|
||||
- [InterviewBit](https://www.interviewbit.com)
|
||||
|
||||
ראיונות דמה:
|
||||
- [Pramp - להתאמן בראיונות קידוד עם אחרים, בחינם](https://www.pramp.com/)
|
||||
- [Mock interviewers from big companies](http://www.gainlo.co/)
|
||||
- [Mock interviewers from big companies](http://www.gainlo.co/#!/)
|
||||
|
||||
## Once you're closer to the interview
|
||||
|
||||
|
|
@ -1385,7 +1363,7 @@ See [Book List above](#book-list)
|
|||
- [Cracking the Coding Interview - Fullstack Speaker Series](https://www.youtube.com/watch?v=Eg5-tdAwclo)
|
||||
- [Ask Me Anything: Gayle Laakmann McDowell (author of Cracking the Coding Interview)](https://www.youtube.com/watch?v=1fqxMuPmGak)
|
||||
|
||||
## Your Resume
|
||||
## קורות חיים שלך
|
||||
|
||||
- [Ten Tips for a (Slightly) Less Awful Resume](http://steve-yegge.blogspot.co.uk/2007_09_01_archive.html)
|
||||
- See Resume prep items in Cracking The Coding Interview and back of Programming Interviews Exposed
|
||||
|
|
@ -1447,7 +1425,7 @@ You're never really done.
|
|||
|
||||
---
|
||||
|
||||
## Additional Books
|
||||
## ספרים נוספים
|
||||
|
||||
- [ ] [The Unix Programming Environment](http://product.half.ebay.com/The-UNIX-Programming-Environment-by-Brian-W-Kernighan-and-Rob-Pike-1983-Other/54385&tg=info)
|
||||
- an oldie but a goodie
|
||||
|
|
@ -1463,7 +1441,7 @@ You're never really done.
|
|||
- [Site Reliability Engineering: How Google Runs Production Systems](https://landing.google.com/sre/)
|
||||
- [ ] [UNIX and Linux System Administration Handbook, 4th Edition](https://www.amazon.com/UNIX-Linux-System-Administration-Handbook/dp/0131480057/)
|
||||
|
||||
## Additional Learning
|
||||
## לימודים נוספים
|
||||
|
||||
- ### Dynamic Programming
|
||||
- This subject can be pretty difficult, as each DP soluble problem must be defined as a recursion relation, and coming up with it can be tricky.
|
||||
|
|
@ -1490,7 +1468,7 @@ You're never really done.
|
|||
- [ ] [Global pairwise sequence alignment (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/UZ7o6/global-pairwise-sequence-alignment)
|
||||
- [ ] [Local pairwise sequence alignment (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/WnNau/local-pairwise-sequence-alignment)
|
||||
|
||||
- ### Compilers
|
||||
- ### קומפיילרים
|
||||
- [ ] [How a Compiler Works in ~1 minute (video)](https://www.youtube.com/watch?v=IhC7sdYe-Jg)
|
||||
- [ ] [Harvard CS50 - Compilers (video)](https://www.youtube.com/watch?v=CSZLNYF4Klo)
|
||||
- [ ] [C++ (video)](https://www.youtube.com/watch?v=twodd1KFfGk)
|
||||
|
|
@ -1530,7 +1508,6 @@ You're never really done.
|
|||
- [Emacs Tutorial (Beginners) -Part 3- Expressions, Statements, ~/.emacs file and packages](https://www.youtube.com/watch?v=paSgzPso-yc)
|
||||
- [Evil Mode: Or, How I Learned to Stop Worrying and Love Emacs (video)](https://www.youtube.com/watch?v=JWD1Fpdd4Pc)
|
||||
- [Writing C Programs With Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs)
|
||||
- [(maybe) Org Mode In Depth: Managing Structure (video)](https://www.youtube.com/watch?v=nsGYet02bEk)
|
||||
|
||||
- ### Unix command line tools
|
||||
- suggested by Yegge, from an old Amazon recruiting post. I filled in the list below from good tools.
|
||||
|
|
@ -1586,7 +1563,7 @@ You're never really done.
|
|||
- [ ] [Compressor Head videos](https://www.youtube.com/playlist?list=PLOU2XLYxmsIJGErt5rrCqaSGTMyyqNt2H)
|
||||
- [ ] [(optional) Google Developers Live: GZIP is not enough!](https://www.youtube.com/watch?v=whGwm0Lky2s)
|
||||
|
||||
- ### Networking
|
||||
- ### רשתות
|
||||
- **if you have networking experience or want to be a systems engineer, expect questions**
|
||||
- otherwise, this is just good to know
|
||||
- [ ] [Khan Academy](https://www.khanacademy.org/computing/computer-science/internet-intro)
|
||||
|
|
@ -1708,7 +1685,7 @@ You're never really done.
|
|||
- I want to learn more about B-Tree since it's used so widely with very large data sets.
|
||||
- [ ] [Self-balancing binary search tree](https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree)
|
||||
|
||||
- [ ] **AVL trees**
|
||||
- [ ] **AVL עצים**
|
||||
- In practice:
|
||||
From what I can tell, these aren't used much in practice, but I could see where they would be:
|
||||
The AVL tree is another structure supporting O(log n) search, insertion, and removal. It is more rigidly
|
||||
|
|
@ -1719,6 +1696,7 @@ You're never really done.
|
|||
- [ ] [AVL Trees (video)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
||||
- [ ] [AVL Tree Implementation (video)](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation)
|
||||
- [ ] [Split And Merge](https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge)
|
||||
- [ ] [[Review] AVL Trees (playlist) in 19 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOUFgdIeOPuH6cfSnNRMau-)
|
||||
|
||||
- [ ] **Splay trees**
|
||||
- In practice:
|
||||
|
|
@ -1744,6 +1722,7 @@ You're never really done.
|
|||
- [ ] [Aduni - Algorithms - Lecture 5 (video)](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5)
|
||||
- [ ] [Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree)
|
||||
- [ ] [An Introduction To Binary Search And Red Black Tree](https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-binary-search-and-red-black-trees/)
|
||||
- [[Review] Red-Black Trees (playlist) in 30 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNqDI8qfOZgzbqahCUmUEin)
|
||||
|
||||
- [ ] **2-3 search trees**
|
||||
- In practice:
|
||||
|
|
@ -1783,6 +1762,7 @@ You're never really done.
|
|||
- [ ] [MIT 6.851 - Memory Hierarchy Models (video)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
- covers cache-oblivious B-Trees, very interesting data structures
|
||||
- the first 37 minutes are very technical, may be skipped (B is block size, cache line size)
|
||||
- [[Review] B-Trees (playlist) in 26 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz)
|
||||
|
||||
|
||||
- ### k-D Trees
|
||||
|
|
@ -1801,10 +1781,6 @@ You're never really done.
|
|||
- [ ] [Ford-Fulkerson Algorithm (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0)
|
||||
- [ ] [Network Flows (video)](https://www.youtube.com/watch?v=2vhN4Ice5jI)
|
||||
|
||||
- ### Disjoint Sets & Union Find
|
||||
- [ ] [UCB 61B - Disjoint Sets; Sorting & selection (video)](https://www.youtube.com/watch?v=MAEGXTwmUsI&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=21)
|
||||
- [ ] [Sedgewick Algorithms - Union-Find (6 videos)](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
||||
|
||||
- ### Math for Fast Processing
|
||||
- [ ] [Integer Arithmetic, Karatsuba Multiplication (video)](https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [The Chinese Remainder Theorem (used in cryptography) (video)](https://www.youtube.com/watch?v=ru7mWZJlRQg)
|
||||
|
|
@ -1826,8 +1802,8 @@ You're never really done.
|
|||
- [ ] [Geometric Algorithms: Graham & Jarvis - Lecture 10](https://www.youtube.com/watch?v=J5aJEcOr6Eo&index=10&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm)
|
||||
- [ ] [Divide & Conquer: Convex Hull, Median Finding](https://www.youtube.com/watch?v=EzeYI7p9MjU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=2)
|
||||
|
||||
- ### Discrete math
|
||||
- see videos below
|
||||
- ### מטמטיקה בדידה
|
||||
- יש סרטונים למטה
|
||||
|
||||
- ### Machine Learning
|
||||
- [ ] Why ML?
|
||||
|
|
@ -1847,9 +1823,8 @@ You're never really done.
|
|||
- [Google's Deep Learning Nanodegree](https://www.udacity.com/course/deep-learning--ud730)
|
||||
- [Google/Kaggle Machine Learning Engineer Nanodegree](https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009)
|
||||
- [Self-Driving Car Engineer Nanodegree](https://www.udacity.com/drive)
|
||||
- [Metis Online Course ($99 for 2 months)](http://www.thisismetis.com/explore-data-science)
|
||||
- Resources:
|
||||
- Books:
|
||||
- ספרים:
|
||||
- [Python Machine Learning](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/)
|
||||
- [Data Science from Scratch: First Principles with Python](https://www.amazon.com/Data-Science-Scratch-Principles-Python/dp/149190142X)
|
||||
- [Introduction to Machine Learning with Python](https://www.amazon.com/Introduction-Machine-Learning-Python-Scientists/dp/1449369413/)
|
||||
|
|
@ -1857,11 +1832,11 @@ You're never really done.
|
|||
- Data School: http://www.dataschool.io/
|
||||
|
||||
- ### Go
|
||||
- [ ] Videos:
|
||||
- [ ] סרטונים:
|
||||
- [ ] [Why Learn Go?](https://www.youtube.com/watch?v=FTl0tl9BGdc)
|
||||
- [ ] [Go Programming](https://www.youtube.com/watch?v=CF9S4QZuV30)
|
||||
- [ ] [A Tour of Go](https://www.youtube.com/watch?v=ytEkHepK08c)
|
||||
- [ ] Books:
|
||||
- [ ] ספרים:
|
||||
- [ ] [An Introduction to Programming in Go (read free online)](https://www.golang-book.com/books/intro)
|
||||
- [ ] [The Go Programming Language (Donovan & Kernighan)](https://www.amazon.com/Programming-Language-Addison-Wesley-Professional-Computing/dp/0134190440)
|
||||
- [ ] [Bootcamp](https://www.golang-book.com/guides/bootcamp)
|
||||
|
|
@ -1924,7 +1899,7 @@ You're never really done.
|
|||
- nice explanation of tries
|
||||
- can be skipped
|
||||
|
||||
- [ ] **Sorting**
|
||||
- [ ] **מינום**
|
||||
|
||||
- [ ] Stanford lectures on sorting:
|
||||
- [ ] [Lecture 15 | Programming Abstractions (video)](https://www.youtube.com/watch?v=ENp00xylP7c&index=15&list=PLFE6E58F856038C69)
|
||||
|
|
@ -1952,7 +1927,7 @@ Sit back and enjoy. "Netflix and skill" :P
|
|||
|
||||
- [ ] [Computer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory](https://www.youtube.com/playlist?list=PL-XXv-cvA_iD8wQm8U0gG_Z1uHjImKXFy)
|
||||
|
||||
- [ ] [Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PL3o9D4Dl2FJ9q0_gtFXPh_H4POI5dK0yG)
|
||||
- [ ] [Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PLWX710qNZo_sNlSWRMVIh6kfTjolNaZ8t)
|
||||
|
||||
- [ ] [Discrete Mathematics Part 1 by Sarada Herke (5 videos)](https://www.youtube.com/playlist?list=PLGxuz-nmYlQPOc4w1Kp2MZrdqOOm4Jxeo)
|
||||
|
||||
|
|
@ -1993,7 +1968,7 @@ Sit back and enjoy. "Netflix and skill" :P
|
|||
|
||||
- [ ] [MIT 6.858 Computer Systems Security, Fall 2014](https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/view_play_list?p=9D558D49CA734A02)
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/playlist?list=PL9D558D49CA734A02)
|
||||
|
||||
- [ ] [Introduction to Cryptography by Christof Paar](https://www.youtube.com/playlist?list=PL6N5qY2nvvJE8X75VkXglSrVhLv1tVcfy)
|
||||
- [Course Website along with Slides and Problem Sets](http://www.crypto-textbook.com/)
|
||||
|
|
@ -2002,7 +1977,7 @@ Sit back and enjoy. "Netflix and skill" :P
|
|||
|
||||
- [ ] [Graph Theory by Sarada Herke (67 videos)](https://www.youtube.com/user/DrSaradaHerke/playlists?shelf_id=5&view=50&sort=dd)
|
||||
|
||||
## Computer Science Courses
|
||||
## קורסים במדעי המחשב
|
||||
|
||||
- [Directory of Online CS Courses](https://github.com/open-source-society/computer-science)
|
||||
- [Directory of CS Courses (many with online lectures)](https://github.com/prakhar1989/awesome-courses)
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
|
|
@ -1,55 +1,72 @@
|
|||
# Universidade de Entrevista de Programação
|
||||
|
||||
> Originalmente eu criei isso como uma pequena lista to-do de tópicos de estudo para se tornar um engenheiro de software,
|
||||
> mas isso cresceu para a grande lista que você vê hoje. Após passar por esse plano de estudo, [Eu fui contratado
|
||||
> Originalmente eu criei isso como uma pequena lista to-do (a fazer) de tópicos de estudo para se tornar um engenheiro de software,
|
||||
> mas isso cresceu para este imenso acervo que você consulta hoje. Após passar por todo esse plano de estudo, [Eu fui contratado
|
||||
> como Engenheiro de Desenvolvimento de Software na Amazon](https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)!
|
||||
> Você provavelmente não vai precisar estudar tanto quanto eu. De qualquer maneira, tudo que você precisa está aqui.
|
||||
>
|
||||
> Os itens listados aqui irão preparar você muito bem para uma entrevista em praticamente qualquer empresa de software,
|
||||
> incluindo as gigantes: Amazon, Facebook, Google ou Microsoft.
|
||||
> incluindo as gigantes como: Amazon, Facebook, Google ou Microsoft.
|
||||
>
|
||||
> *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)
|
||||
|
||||
**Tradutores**: [Marlon Aviz](https://github.com/avizmarlon) ([Contribuições](https://github.com/avizmarlon/coding-interview-university/commits/ptbr-translation/translations/README-ptbr.md?author=avizmarlon)), [marceloogeda](https://github.com/marceloogeda) ([Contribuições](https://github.com/avizmarlon/coding-interview-university/commits/ptbr-translation/translations/README-ptbr.md?author=marceloogeda)), [laris151](https://github.com/laris151) ([Contribuições](https://github.com/avizmarlon/coding-interview-university/commits/ptbr-translation/translations/README-ptbr.md?author=laris151))
|
||||
|
||||
Traduções:
|
||||
- [中文版本](translations/README-cn.md)
|
||||
- [Tiếng Việt - Vietnamese](translations/README-vi.md)
|
||||
- [Bahasa Indonesia](translations/README-id.md)
|
||||
- [Bulgarian](translations/README-bg.md)
|
||||
- [Español](translations/README-es.md)
|
||||
- [Português Brasileiro](README-ptbr.md)
|
||||
- [German](translations/README-de.md)
|
||||
- [Japanese (日本語)](translations/README-ja.md)
|
||||
- [Polish](translations/README-pl.md)
|
||||
- [Português Brasileiro](translations/README-ptbr.md)
|
||||
- [Russian](translations/README-ru.md)
|
||||
- [Tiếng Việt - Vietnamese](translations/README-vi.md)
|
||||
- [Urdu - اردو](tanslations/README-ur.md)
|
||||
- [Uzbek](translations/README-uz.md)
|
||||
- [বাংলা - Bangla](translations/README-bn.md)
|
||||
- [ខ្មែរ - Khmer](translations/README-kh.md)
|
||||
- [中文版本](translations/README-cn.md)
|
||||
- [繁體中文](translations/README-tw.md)
|
||||
|
||||
Traduções em progresso:
|
||||
- [हिन्दी](https://github.com/jwasham/coding-interview-university/issues/81)
|
||||
- [עברית](https://github.com/jwasham/coding-interview-university/issues/82)
|
||||
- [Bahasa Indonesia](https://github.com/jwasham/coding-interview-university/issues/101)
|
||||
- [Afrikaans](https://github.com/jwasham/coding-interview-university/issues/1164)
|
||||
- [Arabic](https://github.com/jwasham/coding-interview-university/issues/98)
|
||||
- [Turkish](https://github.com/jwasham/coding-interview-university/issues/90)
|
||||
- [French](https://github.com/jwasham/coding-interview-university/issues/89)
|
||||
- [Russian](https://github.com/jwasham/coding-interview-university/issues/87)
|
||||
- [Ukrainian](https://github.com/jwasham/coding-interview-university/issues/106)
|
||||
- [Korean(한국어)](https://github.com/jwasham/coding-interview-university/issues/118)
|
||||
- [Telugu](https://github.com/jwasham/coding-interview-university/issues/117)
|
||||
- [Polish](https://github.com/jwasham/coding-interview-university/issues/122)
|
||||
- [German](https://github.com/jwasham/coding-interview-university/issues/135)
|
||||
- [Urdu](https://github.com/jwasham/coding-interview-university/issues/140)
|
||||
- [Thai](https://github.com/jwasham/coding-interview-university/issues/156)
|
||||
- [Greek](https://github.com/jwasham/coding-interview-university/issues/166)
|
||||
- [Italian](https://github.com/jwasham/coding-interview-university/issues/170)
|
||||
|
||||
- [Italian](https://github.com/jwasham/coding-interview-university/issues/1030)
|
||||
- [Korean(한국어)](https://github.com/jwasham/coding-interview-university/issues/118)
|
||||
- [Malayalam](https://github.com/jwasham/coding-interview-university/issues/239)
|
||||
- [Persian - Farsi](https://github.com/jwasham/coding-interview-university/issues/186)
|
||||
- [Telugu](https://github.com/jwasham/coding-interview-university/issues/117)
|
||||
- [Thai](https://github.com/jwasham/coding-interview-university/issues/156)
|
||||
- [Turkish](https://github.com/jwasham/coding-interview-university/issues/90)
|
||||
- [Українська](https://github.com/jwasham/coding-interview-university/issues/106)
|
||||
- [עברית](https://github.com/jwasham/coding-interview-university/issues/82)
|
||||
- [हिन्दी](https://github.com/jwasham/coding-interview-university/issues/81)
|
||||
|
||||
<div align="center">
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
## O que é isso?
|
||||
|
||||
Esse é o meu plano de estudo mensal para ir de desenvolvedor web (autodidata, sem formação em Ciência da Computação) à engenheiro de software para uma grande empresa.
|
||||
Esse é o meu plano de estudo mensal para ir de desenvolvedor web (autodidata, sem formação em Ciência da Computação) à engenheiro de software em uma grande empresa.
|
||||
|
||||
|
||||
|
||||
Essa longa lista foi extraída e expandida a partir das **anotações de treinamento da Google**, então essas são as coisas que você precisa saber.
|
||||
Eu adicionei alguns itens extras no final que podem aparecer na entrevista ou serem úteis para resolver um problema. Muitos itens são da obra “[Get that job at Google](http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html)” (Consiga aquele trabalho na Google) de Steve Yegge's e às vezes são expressados palavra-por-palavra nas anotações de treinamento da Google.
|
||||
|
||||
Isso é direcionado à **engenheiros de software novos** ou àqueles que estão migrando de desenvolvimento de software/web para engenharia de software (onde conhecimento de ciência da computação é necessário). Se você tem vários anos de experiência e está alegando muitos anos de experiência com engenharia de software, pode esperar por uma entrevista mais difícil.
|
||||
Isso é direcionado à **novos engenheiros de software**, ou àqueles que estão migrando de desenvolvimento de software/web para engenharia de software, onde conhecimento sobre ciência da computação é necessário. Se você tem vários anos de experiência e está alegando muitos anos de experiência com engenharia de software, pode esperar por uma entrevista mais difícil.
|
||||
|
||||
Se você tem vários anos de experiência com desenvolvimento de software/web, observe que grandes empresas como Google, Amazon, Facebook e Microsoft consideram engenharia de software como algo distinto de desenvolvimento de software/web e elas requerem conhecimento de ciência da computação.
|
||||
|
||||
|
|
@ -73,13 +90,13 @@ Se você quer ser um engenheiro de confiabilidade ou engenheiro de sistemas, est
|
|||
- [Conhecimento Prévio](#conhecimento-prévio)
|
||||
- [Complexidade Algorítmica / Big-O / Análise assintótica](#complexidade-algorítmica--big-o--análise-assintótica)
|
||||
- [Estrutura de Dados](#estrutura-de-dados)
|
||||
- [Arrays](#arrays)
|
||||
- [Listas Ligadas](#listas-ligadas)
|
||||
- [Stack](#stack)
|
||||
- [Queue (Fila)](#queue-fila)
|
||||
- [Tabela hash](#tabela-hash)
|
||||
- [Vetores (Arrays)](#arrays)
|
||||
- [Listas Ligadas (Linked List)](#listas-ligadas)
|
||||
- [Pilha (Stack)](#stack)
|
||||
- [Fila (Queue)](#queue-fila)
|
||||
- [Tabela hash (Hash Table)](#tabela-hash)
|
||||
- [Mais Conhecimento](#mais-conhecimento)
|
||||
- [Busca binária](#busca-binária)
|
||||
- [Busca binária ( Binary Search)](#busca-binária)
|
||||
- [Lógica binária](#lógica-binária)
|
||||
- [Árvores](#Árvores)
|
||||
- [Árvores - Anotações e Fundamentos](#Árvores---anotações-e-fundamentos)
|
||||
|
|
@ -88,17 +105,17 @@ Se você quer ser um engenheiro de confiabilidade ou engenheiro de sistemas, est
|
|||
- árvores de busca balanceadas (conceito geral, não detalhes)
|
||||
- transversais: pré-ordem, em-ordem (ordem simétrica), pós-ordem, busca em largura, busca em profundidade
|
||||
- [Ordenação](#ordenação)
|
||||
- seleção
|
||||
- inserção
|
||||
- heapsort
|
||||
- quicksort
|
||||
- ordenação por mistura (merge sort)
|
||||
- Seleção
|
||||
- Inserção
|
||||
- Heapsort
|
||||
- Quicksort
|
||||
- Merge sort
|
||||
- [Grafos](#grafos)
|
||||
- directed
|
||||
- undirected
|
||||
- matriz de adjacência
|
||||
- lista de adjacência
|
||||
- traversals: BFS, DFS
|
||||
- Diretos
|
||||
- Indiretos
|
||||
- Matriz de Adjacência
|
||||
- Lista de Adjacência
|
||||
- Traversals: BFS, DFS
|
||||
- [Ainda Mais Conhecimento](#ainda-mais-conhecimento)
|
||||
- [Recursão](#recursão)
|
||||
- [Programação Dinâmica](#programação-dinâmica)
|
||||
|
|
@ -113,7 +130,7 @@ Se você quer ser um engenheiro de confiabilidade ou engenheiro de sistemas, est
|
|||
- [Agendamento](#agendamento)
|
||||
- [Implementar rotinas de sistema](#implementar-rotinas-de-sistema)
|
||||
- [Busca de string e manipulações](#busca-de-string-e-manipulações)
|
||||
- [Tries (ou Árvore de Prefixos)](#tries-ou-Árvore-de-prefixos)
|
||||
- [Árvore de Prefixos (Tries)](#tries-ou-Árvore-de-prefixos)
|
||||
- [Números de Ponto Flutuantes ("Floating Point Numbers")](#números-de-ponto-flutuantes-floating-point-numbers)
|
||||
- [Unicode](#unicode)
|
||||
- [Extremidade (ordenação) (ou "endianness" em Inglês)](#extremidade-ordenação-ou-endianness-em-inglês)
|
||||
|
|
@ -162,7 +179,6 @@ Se você quer ser um engenheiro de confiabilidade ou engenheiro de sistemas, est
|
|||
- [Árvores k-D](#Árvores-k-d)
|
||||
- [Skiplists](#skiplists)
|
||||
- [Fluxos de Rede](#fluxos-de-rede)
|
||||
- [Conjuntos Disjuntos e Union-find](#conjuntos-disjuntos-e-union-find)
|
||||
- [Matemática para Processamento Rápido](#matemática-para-processamento-rápido)
|
||||
- [Treap](#treap)
|
||||
- [Programação Linear](#programação-linear-vídeos)
|
||||
|
|
@ -178,13 +194,13 @@ Se você quer ser um engenheiro de confiabilidade ou engenheiro de sistemas, est
|
|||
## Por que usar?
|
||||
|
||||
Quando eu comecei esse projeto, eu não sabia diferenciar memória dinâmica de memória estática, não sabia notação Big-O, árvores, ou como percorrer um grafo. Se eu tivesse que escrever um algoritmo de ordenação, eu posso te dizer que ele não seria muito bom.
|
||||
Todas as estruturas de dados que eu já usei eram construídas dentro da linguagem, e eu não sabia como elas funcionavam por debaixo dos panos. Eu nunca tive que gerenciar memória a não ser que um processo que eu estava rodando desse um erro de "memória insuficiente", nesse caso eu teria que dar um jeito. Eu já usei alguns arrays multidimensionais na minha vida e milhares de arrays associativos, mas eu nunca criei estruturas de dados do zero.
|
||||
Todas as estruturas de dados que eu já usei eram construídas dentro da linguagem, e eu não sabia como elas funcionavam por debaixo dos panos. Eu nunca tive que gerenciar memória a não ser que um processo que eu estava rodando desse um erro de "memória insuficiente", nesse caso eu teria que dar um jeito. Eu já usei alguns vetores multidimensionais na minha vida e milhares de vetores associativos, mas eu nunca criei estruturas de dados do zero.
|
||||
|
||||
É um longo plano. Você vai levar meses. Se você já é familiarizado com muitas dessas coisas, você vai precisar de muito menos tempo.
|
||||
|
||||
## Como usar
|
||||
|
||||
Tudo abaixo é um esboço, e você deve abordar os itens em ordem de cima para baixo.
|
||||
**Tudo abaixo é um esboço**, e você deve abordar os itens em ordem de cima para baixo.
|
||||
|
||||
Eu estou usando a sintaxe de markdown especial do Github, incluindo listas de tarefas para verificar o progresso.
|
||||
|
||||
|
|
@ -205,7 +221,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 `
|
||||
|
||||
|
|
@ -229,7 +245,6 @@ Alguns vídeos estão disponíveis somente ao ingressar em um curso no Coursera,
|
|||
|
||||
- [ ] [ABC: Always Be Coding](https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.4heg8zvm4)
|
||||
- [ ] [Whiteboarding](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1) (Usando O Quadro Branco)
|
||||
- [ ] [Effective Whiteboarding during Programming Interviews](http://www.coderust.com/blog/2014/04/10/effective-whiteboarding-during-programming-interviews/) (Usando o Quadro Branco Efetivamente durante Entrevistas de Programação)
|
||||
- [ ] [Demystifying Tech Recruiting](https://www.youtube.com/watch?v=N233T0epWTs) (Desmistificando Recrutamento Técnico)
|
||||
- [ ] Decifrando A Entrevista de Programação Série 1:
|
||||
- [ ] [Gayle L McDowell - Cracking The Coding Interview (video)](https://www.youtube.com/watch?v=rEJzOhC5ZtQ) (Gayle L McDowell - Decifrando A Entrevista de Programação - vídeo)
|
||||
|
|
@ -316,7 +331,7 @@ Se você tem mais tempo (eu quero esse livro):
|
|||
Se você ler um desses, você deverá ter todo conhecimento de estrutura de dados e algoritmos que precisará para começar a resolver problemas de programação.
|
||||
**Você pode pular todas as aulas em vídeo nesse projeto**, a não ser que você queira uma revisão.
|
||||
|
||||
[Recursos adicionais específicos a cada linguagem aqui.](programming-language-resources.md)
|
||||
[Recursos adicionais específicos a cada linguagem aqui.](../programming-language-resources.md)
|
||||
|
||||
### C++
|
||||
|
||||
|
|
@ -393,13 +408,13 @@ OU:
|
|||
|
||||
## Antes de começar
|
||||
|
||||
Essa lista cresceu por longos meses, e sim, ela meio que saiu do controle.
|
||||
Essa lista cresceu por longos meses, e sim, ela meio que saiu do controle!
|
||||
|
||||
Aqui estão alguns erros que eu cometi para que você tenha uma experiência melhor.
|
||||
**Aqui estão alguns erros que eu cometi para que você tenha uma experiência melhor**.
|
||||
|
||||
### 1. Você não se lembrará de tudo
|
||||
|
||||
Assisti a horas de vídeos e fiz anotações e meses depois havia muito que eu não lembrava. Eu passei 3 dias revisando minhas anotaçes e fazendo flashcards para que eu pudesse relembrar.
|
||||
Assisti a horas de vídeos e fiz anotações e meses depois havia muito que eu não lembrava. Eu passei 3 dias revisando minhas anotações e fazendo flashcards para que eu pudesse relembrar.
|
||||
|
||||
Por favor, leia para que você não cometa os meus erros:
|
||||
|
||||
|
|
@ -415,8 +430,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.
|
||||
|
||||
|
|
@ -467,9 +482,9 @@ Por que programar em todas essas linguagens?
|
|||
Talvez eu não tenha tempo para fazer tudo isso para cada tema, mas eu vou tentar.
|
||||
|
||||
Você pode ver meu código aqui:
|
||||
- [C] (https://github.com/jwasham/practice-c)
|
||||
- [C++] (https://github.com/jwasham/practice-cpp)
|
||||
- [Python] (https://github.com/jwasham/practice-python)
|
||||
- [C](https://github.com/jwasham/practice-c)
|
||||
- [C++](https://github.com/jwasham/practice-cpp)
|
||||
- [Python](https://github.com/jwasham/practice-python)
|
||||
|
||||
Você não precisa memorizar os detalhes intrínsecos de cada algoritmo.
|
||||
|
||||
|
|
@ -507,6 +522,7 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
- [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/) (Complexidade Computacional: Seção 1)
|
||||
- [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/) (Complexidade Computacional: Seção 2)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/) (Folha de Consultas)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
|
||||
Se alguma das aulas forem muito "matemáticas", você pode pular para o final e
|
||||
|
|
@ -519,12 +535,8 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
- [ ] Descrição:
|
||||
- [Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays)
|
||||
- [UCBerkley CS61B - Linear and Multi-Dim Arrays (video)](https://youtu.be/Wp8oiO_CZZE?t=15m32s) (Arrays lineares e multidimensionais - vídeo)
|
||||
- [Basic Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_04-basicArrays.mp4) (Arrays básicos - vídeo)
|
||||
- [Multi-dim (video)](https://archive.org/details/0102WhatYouShouldKnow/02_05-multidimensionalArrays.mp4) (Multidimensionais - vídeo)
|
||||
- [Dynamic Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays) (Arrays Dinâmicos - vídeo)
|
||||
- [Jagged Arrays (video)](https://www.youtube.com/watch?v=1jtrQqYpt7g) (Arrays Multidimensionais - vídeo)
|
||||
- [Jagged Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_06-jaggedArrays.mp4) (Arrays Multidimensionais - vídeo)
|
||||
- [Resizing arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/03_01-resizableArrays.mp4) (Arrays Dinâmicos)
|
||||
- [ ] Implementar um vetor (array mutável com redimensionamento automático):
|
||||
- [ ] Praticar programação usando arrays e ponteiros, e matemática de ponteiros para pular para um índice ao invés de usar indexação.
|
||||
- [ ] novo array de dados brutos com memória alocada
|
||||
|
|
@ -556,6 +568,7 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists) (listas ligadas individualmente - vídeo)
|
||||
- [ ] [CS 61B - Linked Lists 1 (video)](https://www.youtube.com/watch?v=htzJdKoEmO0&list=PL4BBB74C7D2A1049C&index=7) (CS 61B - Listas Ligadas 1 - vídeo)
|
||||
- [ ] [CS 61B - Linked Lists 2 (video)](https://www.youtube.com/watch?v=-c4I3gFYe3w&index=8&list=PL4BBB74C7D2A1049C) (CS 61B - Listas Ligadas 2 - vídeo)
|
||||
- [ ] [[Review] Linked lists in 4 minutes (video)](https://youtu.be/F8AbOfQwl1c)
|
||||
- [ ] [C Code (video)](https://www.youtube.com/watch?v=QN6FPiD0Gzo) (Código em C - vídeo)
|
||||
- não o vídeo inteiro, apenas as partes sobre estrutura de nodes (nós) e alocação de memória.
|
||||
- [ ] Listas Ligadas vs Arrays:
|
||||
|
|
@ -587,14 +600,13 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
|
||||
- ### Stack
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [Using Stacks Last-In First-Out (video)](https://archive.org/details/0102WhatYouShouldKnow/05_01-usingStacksForLast-inFirst-out.mp4) (Usando Stacks Último a Entrar Primeiro a Sair - vídeo)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Não implementarei. Implementar com array é trivial.
|
||||
|
||||
- ### Queue (Fila)
|
||||
- [ ] [Using Queues First-In First-Out(video)](https://archive.org/details/0102WhatYouShouldKnow/05_03-usingQueuesForFirst-inFirst-out.mp4) (Usando queues FIFO(Primeiro a entrar, último a sair) - vídeo)
|
||||
- [ ] [Queue (video)](https://www.coursera.org/learn/data-structures/lecture/EShpq/queue)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer) (Buffer circular/Primeiro a entrar, último a sair)
|
||||
- [ ] [Priority Queues (video)](https://archive.org/details/0102WhatYouShouldKnow/05_04-priorityQueuesAndDeques.mp4) (Queues com Prioridade - vídeo)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)(Buffer circular/Primeiro a entrar, último a sair)
|
||||
- [ ] Implementar usando lista ligada, com ponteiro de cauda (aponta para o último elemento de uma lista):
|
||||
- enqueue(valor) - adiciona "valor" na posição na cauda (final da lista)
|
||||
- dequeue() - retorna um valor e remove o elemento menos recentemente adicionado (início da lista))
|
||||
|
|
@ -619,12 +631,9 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
- [ ] [PyCon 2010: The Mighty Dictionary (video)](https://www.youtube.com/watch?v=C4Kc8xzcA68) (PyCon 2010: O Poderoso Dicionário (vídeo)
|
||||
- [ ] [(Advanced) Randomization: Universal & Perfect Hashing (video)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11) ((Avançado) Randomização: Hashing Perfeito & Universal - vídeo)
|
||||
- [ ] [(Advanced) Perfect hashing (video)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4) ((Avançado) Hashing perfeito - vídeo)
|
||||
- [ ] [[Review] Hash tables in 4 minutes (video)](https://youtu.be/knV86FlSXJ8)
|
||||
|
||||
- [ ] Cursos Online:
|
||||
- [ ] [Understanding Hash Functions (video)](https://archive.org/details/0102WhatYouShouldKnow/06_02-understandingHashFunctions.mp4) (Compreendendo Funções Hash - vídeo)
|
||||
- [ ] [Using Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_03-usingHashTables.mp4) (Usando Tabelas Hash - vídeo)
|
||||
- [ ] [Supporting Hashing (video)](https://archive.org/details/0102WhatYouShouldKnow/06_04-supportingHashing.mp4) (Hashing de Suporte - vídeo)
|
||||
- [ ] [Language Support Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_05-languageSupportForHashTables.mp4) (Tabelas Hash de Suporte de Linguagem - vídeo)
|
||||
- [ ] [Core Hash Tables (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables) (Fundamentos de Tabelas Hash - vídeo)
|
||||
- [ ] [Data Structures (video)](https://www.coursera.org/learn/data-structures/home/week/3) (Estruturas de Dados - vídeo)
|
||||
- [ ] [Phone Book Problem (video)](https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem) (Problema da Lista Telefônica (vídeo) )
|
||||
|
|
@ -645,12 +654,13 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
- [ ] [Binary Search (video)](https://www.youtube.com/watch?v=D5SrAga1pno) (Busca Binária - vídeo)
|
||||
- [ ] [Binary Search (video)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search) (Busca Binária - vídeo)
|
||||
- [ ] [detail](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/) (detalhes)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Implementar:
|
||||
- busca binária (em um array ordenado de números inteiros)
|
||||
- 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-cheet.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:
|
||||
|
|
@ -679,7 +689,6 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
## Árvores
|
||||
|
||||
- ### Árvores - Anotações e Fundamentos
|
||||
- [ ] [Series: Core Trees (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees) (Série: Fundamentos de Árvores - vídeo)
|
||||
- [ ] [Series: Trees (video)](https://www.coursera.org/learn/data-structures/lecture/95qda/trees) (Série: Árvores - vídeo)
|
||||
- contrução básica de árvore
|
||||
- transversal
|
||||
|
|
@ -699,6 +708,9 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
- em-ordem ou ordem simétrica(na busca em profundidade (ou DFS): percorre subárvore esquerda em ordem simétrica (em-ordem), visita a raiz, percorre subárvore direita em ordem simétrica)
|
||||
- pós-ordem (na busca em profundidade (ou DFS): percorre subárvore esquerda em pós-ordem, percorre subárvore direita em pós-ordem, visita a raiz)
|
||||
- pré-ordem (na busca em profundidade (ou DFS): visita a raiz, percorre subárvore esquerda em pré-ordem, percorre subárvore direita em pré-ordem)
|
||||
- [ ] [[Review] Breadth-first search in 4 minutes (video)](https://youtu.be/HZ5YTanv5QE)
|
||||
- [ ] [[Review] Depth-first search in 4 minutes (video)](https://youtu.be/Urx87-NMm6c)
|
||||
- [ ] [[Review] Tree Traversal (playlist) in 11 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b)
|
||||
|
||||
- ### Árvores binárias de busca: ABB
|
||||
- [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) (Revisão de Árvores Binárias de Busca - vídeo)
|
||||
|
|
@ -746,6 +758,7 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
- [ ] [MIT: Heaps and Heap Sort (video)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) (MIT: Memórias Dinâmias e heapsort - vídeo)
|
||||
- [ ] [CS 61B Lecture 24: Priority Queues (video)](https://www.youtube.com/watch?v=yIUFT6AKBGE&index=24&list=PL4BBB74C7D2A1049C) (CS (Ciência da Computação) 61B Aula 24: Filas Prioritárias - vídeo)
|
||||
- [ ] [Linear Time BuildHeap (max-heap)](https://www.youtube.com/watch?v=MiyLo8adrWw) (BuildHeap em Tempo Linear (heap máxima))
|
||||
- [ ] [[Review] Heap (playlist) in 13 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNsyqgPW-DNwUeT8F8uhWc6)
|
||||
- [ ] Implementar uma heap máxima (max-heap):
|
||||
- [ ] insert
|
||||
- [ ] sift_up - necessário insert
|
||||
|
|
@ -775,25 +788,6 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
|
||||
- Para heapsort, veja estrutura de dados heap acima. Heapsort é ótimo, mas não é estável.
|
||||
|
||||
- [ ] [Sedgewick - Mergesort (5 vídeos)](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [1. Mergesort](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=1)
|
||||
- [ ] [2. Bottom up Mergesort](https://www.youtube.com/watch?v=HGOIGUYjeyk&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=2) (Mergesort de baixo para cima)
|
||||
- [ ] [3. Sorting Complexity](https://www.youtube.com/watch?v=WvU_mIWo0Ac&index=3&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9) (Complexidade de Ordenação)
|
||||
- [ ] [4. Comparators](https://www.youtube.com/watch?v=7MvC1kmBza0&index=4&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9) (Comparadores)
|
||||
- [ ] [5. Stability](https://www.youtube.com/watch?v=XD_5iINB5GI&index=5&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9) (Estabilidade)
|
||||
|
||||
- [ ] [Sedgewick - Quicksort (4 vídeos)](https://www.youtube.com/playlist?list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [1. Quicksort](https://www.youtube.com/watch?v=5M5A7qPWk84&index=1&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [2. Selection](https://www.youtube.com/watch?v=CgVYfSyct_M&index=2&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1) (Seleção)
|
||||
- [ ] [3. Duplicate Keys](https://www.youtube.com/watch?v=WBFzOYJ5ybM&index=3&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1) (Chaves Duplicadas)
|
||||
- [ ] [4. System Sorts](https://www.youtube.com/watch?v=rejpZ2htBjE&index=4&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1) (Ordenações de Sistema)
|
||||
|
||||
- [ ] Universidade da Califórnia em Berkeley:
|
||||
- [ ] [CS 61B Lecture 29: Sorting I (video)](https://www.youtube.com/watch?v=EiUvYS2DT6I&list=PL4BBB74C7D2A1049C&index=29) (Ciência da Computação 61B Aula 29: Ordenação I - vídeo)
|
||||
- [ ] [CS 61B Lecture 30: Sorting II (video)](https://www.youtube.com/watch?v=2hTY3t80Qsk&list=PL4BBB74C7D2A1049C&index=30) (Ciência da Computação 61B Aula 30: Ordenação II - vídeo)
|
||||
- [ ] [CS 61B Lecture 32: Sorting III (video)](https://www.youtube.com/watch?v=Y6LOLpxg6Dc&index=32&list=PL4BBB74C7D2A1049C) (Ciência da Computação 61B Aula 32: Ordenação III - vídeo)
|
||||
- [ ] [CS 61B Lecture 33: Sorting V (video)](https://www.youtube.com/watch?v=qNMQ4ly43p4&index=33&list=PL4BBB74C7D2A1049C) (Ciência da Computação 61B Aula 33: Ordenação V - vídeo)
|
||||
|
||||
- [ ] [Bubble Sort (video)](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB) (Ordenação por Bolha - vídeo)
|
||||
- [ ] [Analyzing Bubble Sort (video)](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB) (Analisando Ordenação por Bolha - vídeo)
|
||||
- [ ] [Insertion Sort, Merge Sort (video)](https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) (Ordenação por Inserção, Ordenação por Mistura - vídeo)
|
||||
|
|
@ -811,6 +805,14 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u
|
|||
- [ ] [Implementation (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c) (Implementação em C)
|
||||
- [ ] [Implementation (Python)](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py) (Implementação em Python)
|
||||
|
||||
- [ ] [[Review] Sorting (playlist) in 18 minutes](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOZSbGAXAPIq1BeUf4j20pl)
|
||||
- [ ] [Quick sort in 4 minutes (video)](https://youtu.be/Hoixgm4-P4M)
|
||||
- [ ] [Heap sort in 4 minutes (video)](https://youtu.be/2DmK_H7IdTo)
|
||||
- [ ] [Merge sort in 3 minutes (video)](https://youtu.be/4VqmGXwpLqc)
|
||||
- [ ] [Bubble sort in 2 minutes (video)](https://youtu.be/xli_FI7CuzA)
|
||||
- [ ] [Selection sort in 3 minutes (video)](https://youtu.be/g-PGLbMth_g)
|
||||
- [ ] [Insertion sort in 2 minutes (video)](https://youtu.be/JU767SDMDvA)
|
||||
|
||||
- [ ] Implementar:
|
||||
- [ ] Mergesort: O(n log n) caso comum e pior caso
|
||||
- [ ] Quicksort O(n log n) caso comum
|
||||
|
|
@ -870,6 +872,8 @@ Grafos podem ser usados para representar muitos problemas na Ciência da Computa
|
|||
- [ ] [CS 61B 2014: Weighted graphs (video)](https://www.youtube.com/watch?v=aJjlQCFwylA&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=19) (CS 61B 2014: Grafos Ponderados - vídeo)
|
||||
- [ ] [Greedy Algorithms: Minimum Spanning Tree (video)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) (Algoritmos Gulosos: Árvore de Extensão Mínima - vídeo)
|
||||
- [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (video)](https://www.youtube.com/watch?v=RpgcYiky7uw) (Componentes Fortemente Conectados, Algoritmo de Kosaraju, Algoritmo de Grafo - vídeo)
|
||||
- [ ] [[Review] Shortest Path Algorithms (playlist) in 16 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO-Y-H3xIC9DGSfVYJng9Yw)
|
||||
- [ ] [[Review] Minimum Spanning Trees (playlist) in 4 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZObEi3Hf6lmyW-CBfs7nkOV)
|
||||
|
||||
- Curso Completo do Coursera:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome) (Algoritmos em Grafos - vídeo)
|
||||
|
|
@ -903,7 +907,7 @@ Você ganhará mais prática com grafos no livro do Skiena (veja a seção de li
|
|||
- quando é apropriado usá-la
|
||||
- como a recursão de cauda é melhor do que nada?
|
||||
- [ ] [What Is Tail Recursion Why Is It So Bad?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad) (O Que É Recursão de Cauda E Por Que Ela É Tão Ruim?)
|
||||
- [ ] [Tail Recursion (video)](https://www.youtube.com/watch?v=L1jjXGfxozc) (Recursão de Cauda - vídeo)
|
||||
- [ ] [Tail Recursion (video)](https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1) (Recursão de Cauda - vídeo)
|
||||
|
||||
- ### Programação Dinâmica
|
||||
- Esse assunto pode ser bem difícil, já que cada problema solúvel de PD deve ser definido como uma relação de recursão, e isso pode ser complicado.
|
||||
|
|
@ -937,7 +941,7 @@ Você ganhará mais prática com grafos no livro do Skiena (veja a seção de li
|
|||
- [OOSE: Software Dev Using UML and Java](https://www.youtube.com/playlist?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO) (Engenharia de Software Orientada a Objetos: Desenvolvedor de Software usando UML e Java)
|
||||
- [ ] Princípios de SOLID de POO:
|
||||
- [ ] [Bob Martin SOLID Principles of Object Oriented and Agile Design (video)](https://www.youtube.com/watch?v=TMuno5RZNeE) (Princípios de SOLID de Orientação a Objetos e Design Ágil por Bob Martin)
|
||||
- [ ] [SOLID Design Patterns in C# (video)](https://www.youtube.com/playlist?list=PL8m4NUhTQU48oiGCSgCP1FiJEcg_xJzyQ) (Padrões de Design de SOLID em C# - vídeo)
|
||||
- [ ] [SOLID Design Patterns in C# (video)](https://www.youtube.com/playlist?list=PL8RerBWgqkey0rgzdmoJTc_ijMo8lf5T-) (Padrões de Design de SOLID em C# - vídeo)
|
||||
- [ ] [SOLID Principles (video)](https://www.youtube.com/playlist?list=PL4CE9F710017EA77A) (Princípios de SOLID - vídeo)
|
||||
- [ ] S - [Single Responsibility Principle](http://www.oodesign.com/single-responsibility-principle.html) | [Single responsibility to each Object](http://www.javacodegeeks.com/2011/11/solid-single-responsibility-principle.html) (S - Princípio da Responsabilidade Única)
|
||||
- [more flavor](https://docs.google.com/open?id=0ByOwmqah_nuGNHEtcU5OekdDMkk) (mais informações)
|
||||
|
|
@ -1133,17 +1137,17 @@ Você ganhará mais prática com grafos no livro do Skiena (veja a seção de li
|
|||
- Note que há tipos diferentes de tries. Alguns tem prefixos, alguns não, e alguns usam string ao invés de bits
|
||||
para rastrear o caminho.
|
||||
- Eu li todo o código, mas não irei implementar.
|
||||
- [ ] [Sedgewick - Tries (3 vídeos)](https://www.youtube.com/playlist?list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ)
|
||||
- [ ] [1. Tries R-Way](https://www.youtube.com/watch?v=buq2bn8x3Vo&index=3&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ)
|
||||
- [ ] [2. Ternary Search Tries](https://www.youtube.com/watch?v=LelV-kkYMIg&index=2&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ) (Tries de Busca Ternária)
|
||||
- [ ] [3. Character Based Operations](https://www.youtube.com/watch?v=00YaFPcC65g&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ&index=1) (Operações Baseadas Em Caracteres)
|
||||
- [ ] [Sedgewick - Tries (3 vídeos)](https://www.coursera.org/learn/algorithms-part2/home/week/4)
|
||||
- [ ] [1. Tries R-Way](https://www.coursera.org/learn/algorithms-part2/lecture/CPVdr/r-way-tries)
|
||||
- [ ] [2. Ternary Search Tries](https://www.coursera.org/learn/algorithms-part2/lecture/yQM8K/ternary-search-tries) (Tries de Busca Ternária)
|
||||
- [ ] [3. Character Based Operations](https://www.coursera.org/learn/algorithms-part2/lecture/jwNmV/character-based-operations) (Operações Baseadas Em Caracteres)
|
||||
- [ ] [Notes on Data Structures and Programming Techniques](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries) (Anotações sobre Estruturas de Dados e Técnicas de Programação)
|
||||
- [ ] Vídeos de cursos curtos:
|
||||
- [ ] [Introduction To Tries (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08Xyf/core-introduction-to-tries) (Introdução À Tries - vídeo)
|
||||
- [ ] [Performance Of Tries (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/PvlZW/core-performance-of-tries) (Desempenho De Tries - vídeo)
|
||||
- [ ] [Implementing A Trie (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie) (Implementando Uma Trie - vídeo)
|
||||
- [ ] [The Trie: A Neglected Data Structure](https://www.toptal.com/java/the-trie-a-neglected-data-structure) (A Trie: Uma Estrutura de Dados Negligenciada)
|
||||
- [ ] [TopCoder - Using Tries](https://www.topcoder.com/community/data-science/data-science-tutorials/using-tries/) (TopCoder - Usando Tries)
|
||||
- [ ] [TopCoder - Using Tries](https://www.topcoder.com/community/competitive-programming/tutorials/using-tries) (TopCoder - Usando Tries)
|
||||
- [ ] [Stanford Lecture (real world use case) (video)](https://www.youtube.com/watch?v=TJ8SkcUSdbU) (Aula de Stanfort (caso de uso no mundo real) - vídeo)
|
||||
- [ ] [MIT, Advanced Data Structures, Strings (pode ficar bem obscuro pela metade)](https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf) (MIT, Estruturas De Dados Avançadas, Strings)
|
||||
|
||||
|
|
@ -1275,7 +1279,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
|
||||
|
|
@ -1314,34 +1318,9 @@ Você ganhará mais prática com grafos no livro do Skiena (veja a seção de li
|
|||
|
||||
- [ ] Séries de vídeos curtos (2 - 3 minutos) sobre o assunto (23 vídeos)
|
||||
- [Vídeos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Séries de vídeos curtos (2 - 5 minutos) sobre o assunto - Michael Sambol (18 vídeos):
|
||||
- [Vídeos](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] [Sedgewick Videos - Algorithms I](https://www.youtube.com/user/algorithmscourses/playlists?shelf_id=2&view=50&sort=dd) (Vídeos de Sedgewick - Algoritmos I)
|
||||
- [ ] [01. Union-Find](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
||||
- [ ] [02. Analysis of Algorithms](https://www.youtube.com/watch?v=ZN-nFW0mEpg&list=PLe-ggMe31CTf0_bkOhh7sa5uqeppp3Sr0) (Análises de Algoritmos)
|
||||
- [ ] [03. Stacks and Queues](https://www.youtube.com/watch?v=TIC1gappbP8&list=PLe-ggMe31CTe-9jhnj3P_3mmrCh0A7iHh) (Memórias Estáticas e Filas)
|
||||
- [ ] [04. Elementary Sorts](https://www.youtube.com/watch?v=CD2AL6VO0ak&list=PLe-ggMe31CTe_5WhGV0F--7CK8MoRUqBd) (Ordenações Elementares)
|
||||
- [ ] [05. Mergesort](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [06. Quicksort](https://www.youtube.com/watch?v=5M5A7qPWk84&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [07. Priority Queues](https://www.youtube.com/watch?v=G9TMe0KC0w0&list=PLe-ggMe31CTducy9LDiGVkdSv0NfiRwn5) (Filas Prioritárias)
|
||||
- [ ] [08. Elementary Symbol Tables](https://www.youtube.com/watch?v=up_nlilw3ac&list=PLe-ggMe31CTc3a8nKRDxFZZrWrBvkc9SG) (Tabelas de Símbolos Elementares)
|
||||
- [ ] [09. Balanced Search Trees](https://www.youtube.com/watch?v=qC1BLLPK_5w&list=PLe-ggMe31CTf7jHH_mFT50kayjCEA6Rhu) (Árvores de Busca Balanceadas)
|
||||
- [ ] [10. Geometric Applications of BST](https://www.youtube.com/watch?v=Wl30aGAp6TY&list=PLe-ggMe31CTdBsRIw0hXln0hilRs-DqAx) (Aplicações Geométricas de Árvores de Busca Balanceada)
|
||||
- [ ] [11. Hash Tables](https://www.youtube.com/watch?v=QA8fJGO-i9o&list=PLe-ggMe31CTcKxIRGqqThMts2eHtSrf11) (Tabelas Hash)
|
||||
- [ ] [Sedgewick Videos - Algorithms II](https://www.youtube.com/user/algorithmscourses/playlists?flow=list&shelf_id=3&view=50) (Vídeos de Sedgewick - Algoritmos II)
|
||||
- [ ] [01. Undirected Graphs](https://www.youtube.com/watch?v=GmVhD-mmMBg&list=PLe-ggMe31CTc0zDzANxl4I2MhMoRVlbRM) (Grafos Não Direcionados)
|
||||
- [ ] [02. Directed Graphs](https://www.youtube.com/watch?v=_z-JsVaUS40&list=PLe-ggMe31CTcEwaU8a1P1Gd95A77HV85K) (Grafos Direcionados)
|
||||
- [ ] [03. Minimum Spanning Trees](https://www.youtube.com/watch?v=t8fNk9tfVYY&list=PLe-ggMe31CTceUZxDesGfHGLE7kcSafqj) (Árvores de Extensão Mínima)
|
||||
- [ ] [04. Shortest Paths](https://www.youtube.com/watch?v=HoGSiB7tSeI&list=PLe-ggMe31CTePpG3jbeOTsnGUGZDKxgZD) (Menores Caminhos)
|
||||
- [ ] [05. Maximum Flow](https://www.youtube.com/watch?v=rYIKlFstBqE&list=PLe-ggMe31CTduQ68XQ-sVj32wYJIspTma) (Fluxo Máximo)
|
||||
- [ ] [06. Radix Sorts](https://www.youtube.com/watch?v=HKPrVm5FWvg&list=PLe-ggMe31CTcNvUX9E3tQeM6ntrdR8e53) (Ordenações Radix)
|
||||
- [ ] [07. Tries](https://www.youtube.com/watch?v=00YaFPcC65g&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ) (Árvore de Prefixos)
|
||||
- [ ] [08. Substring Search](https://www.youtube.com/watch?v=QzI0p6zDjK4&list=PLe-ggMe31CTdAdjXB3lIuf2maubzo9t66) (Busca de Substring)
|
||||
- [ ] [09. Regular Expressions](https://www.youtube.com/watch?v=TQWNQsJSPnk&list=PLe-ggMe31CTetTlJWouM42fyttyKPgSDh) (Expressões Regulares)
|
||||
- [ ] [10. Data Compression](https://www.youtube.com/watch?v=at9tjpxcBh8&list=PLe-ggMe31CTciifRRo6yY0Yt0mzgIXXVZ) (Compressão de Dados)
|
||||
- [ ] [11. Reductions](https://www.youtube.com/watch?v=Ow5x-ooMGv8&list=PLe-ggMe31CTe_yliW5vc3yO-dj1LSSDyF) (Reduções)
|
||||
- [ ] [12. Linear Programming](https://www.youtube.com/watch?v=rWhcLyiLZLA&list=PLe-ggMe31CTdy6dKzMgkWFuTTN1H8B-E1) (Programação Linear)
|
||||
- [ ] [13. Intractability](https://www.youtube.com/watch?v=6qcaaDp4cdQ&list=PLe-ggMe31CTcZCjluBHw53e_ek2k9Kn-S) (Intratabilidade)
|
||||
- [ ] Séries de vídeos curtos (2 - 5 minutos) sobre o assunto - Michael Sambol (48 vídeos):
|
||||
- [Vídeos](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1374,7 +1353,6 @@ Suplementar:
|
|||
- [Mathematics for Topcoders](https://www.topcoder.com/community/data-science/data-science-tutorials/mathematics-for-topcoders/) (Matemática para Topcoders)
|
||||
- [Dynamic Programming – From Novice to Advanced](https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/) (Programação Dinâmica - De Novato a Avançado)
|
||||
- [MIT Interview Materials](https://web.archive.org/web/20160906124824/http://courses.csail.mit.edu/iap/interview/materials.php) (Materiais de Entrevista do MIT)
|
||||
- [Exercises for getting better at a given language](http://exercism.io/languages) (Exercícios para ficar melhor em uma determinada linguagem)
|
||||
|
||||
**Leia e Faça os Problemas de Programação (nessa ordem):**
|
||||
|
||||
|
|
@ -1407,14 +1385,14 @@ Websites de desafios:
|
|||
- [Codility](https://codility.com/programmers/)
|
||||
- [InterviewCake](https://www.interviewcake.com/)
|
||||
- [Geeks for Geeks](http://www.geeksforgeeks.org/)
|
||||
- [InterviewBit](https://www.interviewbit.com/invite/icjf)
|
||||
- [InterviewBit](https://www.interviewbit.com)
|
||||
- [Sphere Online Judge (spoj)](http://www.spoj.com/)
|
||||
|
||||
Repositórios de desafios:
|
||||
- [Interactive Coding Interview Challenges in Python](https://github.com/donnemartin/interactive-coding-challenges) (Desafios Interativos de Entrevista de Programação em Python)
|
||||
|
||||
Entrevistas Simuladas:
|
||||
- [Gainlo.co: Entrevistas simuladas com entrevistadores de grandes empresas](http://www.gainlo.co/)
|
||||
- [Gainlo.co: Entrevistas simuladas com entrevistadores de grandes empresas](http://www.gainlo.co/#!/)
|
||||
- [Pramp: Entrevistas simuladas com colegas](https://www.pramp.com/)
|
||||
- [Refdash: Entrevistas simuladas](https://refdash.com/)
|
||||
|
||||
|
|
@ -1526,7 +1504,6 @@ Esses tópicos provavelmente não aparecerão em uma entrevista, mas eu adicione
|
|||
- [Emacs Tutorial (Beginners) -Part 3- Expressions, Statements, ~/.emacs file and packages](https://www.youtube.com/watch?v=paSgzPso-yc) (Tutorial de Emacs (Iniciantes) - Parte 3 - Expressões, Declarações, arquivo ~/. emacs e pacotes)
|
||||
- [Evil Mode: Or, How I Learned to Stop Worrying and Love Emacs (video)](https://www.youtube.com/watch?v=JWD1Fpdd4Pc) (Modo Evil: Ou, Como Eu Aprendi A Parar De Me Preocupar E Amar O Emacs - vídeo)
|
||||
- [Writing C Programs With Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs) (Escrevendo Programas Em C Com Emacs)
|
||||
- [(maybe) Org Mode In Depth: Managing Structure (video)](https://www.youtube.com/watch?v=nsGYet02bEk) ((talvez) Análise Profunda do Modo Org: Gerenciando Estrutura - vídeo)
|
||||
|
||||
- ### Ferramentas de linha de comando do Unix
|
||||
- Eu preenchi a lista abaixo com boas ferramentas.
|
||||
|
|
@ -1688,6 +1665,7 @@ Esses tópicos provavelmente não aparecerão em uma entrevista, mas eu adicione
|
|||
- [ ] [AVL Trees (video)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees) (Árvores AVl - vídeo)
|
||||
- [ ] [AVL Tree Implementation (video)](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation) (Implementação de Árvores AVL - vídeo)
|
||||
- [ ] [Split And Merge](https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge) (Dividir e Fundir)
|
||||
- [ ] [[Review] AVL Trees (playlist) in 19 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOUFgdIeOPuH6cfSnNRMau-)
|
||||
|
||||
- [ ] **Árvores Splay**
|
||||
- Ná prática:
|
||||
|
|
@ -1713,6 +1691,7 @@ Esses tópicos provavelmente não aparecerão em uma entrevista, mas eu adicione
|
|||
- [ ] [Aduni - Algorithms - Lecture 5 (video)](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5) (Aduni - Algoritmos - Aula 5 - vídeo)
|
||||
- [ ] [Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree) (Árvore Rubro-Negra)
|
||||
- [ ] [An Introduction To Binary Search And Red Black Tree](https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-binary-search-and-red-black-trees/) (Uma Introdução a Busca Binária E Árvore Rubro-Negra)
|
||||
- [[Review] Red-Black Trees (playlist) in 30 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNqDI8qfOZgzbqahCUmUEin)
|
||||
|
||||
- [ ] **Árvores de busca 2-3**
|
||||
- Ná prática:
|
||||
|
|
@ -1752,6 +1731,7 @@ Esses tópicos provavelmente não aparecerão em uma entrevista, mas eu adicione
|
|||
- [ ] [MIT 6.851 - Memory Hierarchy Models (video)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf) (MIT 6.851 - Modelos de Hierarquia de Memória - vídeo)
|
||||
- cobre Árvores B de cache-alheio (do Inglês, cache-oblivious), estruturas de dados muito interessantes
|
||||
- os primeiros 37 minutos são bem técnicos, pode ser pulado (B é tamanho de bloco, tamanho de linha de cache)
|
||||
- [[Review] B-Trees (playlist) in 26 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz)
|
||||
|
||||
|
||||
- ### Árvores k-D
|
||||
|
|
@ -1770,10 +1750,6 @@ Esses tópicos provavelmente não aparecerão em uma entrevista, mas eu adicione
|
|||
- [ ] [Ford-Fulkerson Algorithm (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0) (Algoritmo de Ford-Fulkerson)
|
||||
- [ ] [Network Flows (video)](https://www.youtube.com/watch?v=2vhN4Ice5jI) (Fluxos de Rede - vídeo)
|
||||
|
||||
- ### Conjuntos Disjuntos e Union-find
|
||||
- [ ] [UCB 61B - Disjoint Sets; Sorting & selection (video)](https://www.youtube.com/watch?v=MAEGXTwmUsI&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=21) (UCB 61B - Conjuntos Disjuntos; Ordenação e seleção - vídeo)
|
||||
- [ ] [Sedgewick Algorithms - Union-Find (6 videos)](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t) (Algoritmos de Sedgewick - Union-find - 6 vídeos)
|
||||
|
||||
- ### Matemática para Processamento Rápido
|
||||
- [ ] [Integer Arithmetic, Karatsuba Multiplication (video)](https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) (Aritmética de Números Inteiros, Multiplicação de Karatsuba - vídeo)
|
||||
- [ ] [The Chinese Remainder Theorem (used in cryptography) (video)](https://www.youtube.com/watch?v=ru7mWZJlRQg) (O Teorema Chinês do Resto)
|
||||
|
|
@ -1816,7 +1792,6 @@ Esses tópicos provavelmente não aparecerão em uma entrevista, mas eu adicione
|
|||
- [Google's Deep Learning Nanodegree](https://www.udacity.com/course/deep-learning--ud730) (Nanodegree de Aprendizagem Profunda da Google)
|
||||
- [Google/Kaggle Machine Learning Engineer Nanodegree](https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009) (Nanodegree de Engenheiro de Aprendizado de Máquina da Google/Kaggle)
|
||||
- [Self-Driving Car Engineer Nanodegree](https://www.udacity.com/drive) (Nanodegree de Engenheiro de Carro Autônomo)
|
||||
- [Metis Online Course ($99 for 2 months)](http://www.thisismetis.com/explore-data-science) (Curso Online do Metis - US$99 por 2 meses)
|
||||
- Recursos:
|
||||
- Livros:
|
||||
- [Python Machine Learning](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/) (Aprendizado de Máquina em Python)
|
||||
|
|
@ -1911,7 +1886,7 @@ Sente-se e aproveite. "Netflix e habilidade" :P
|
|||
|
||||
- [ ] [Computer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory](https://www.youtube.com/playlist?list=PL-XXv-cvA_iD8wQm8U0gG_Z1uHjImKXFy) (Ciência da Computação 70, 001 - Primavera de 2005 - Matemática Discreta e Teoria de Probabilidade)
|
||||
|
||||
- [ ] [Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PL3o9D4Dl2FJ9q0_gtFXPh_H4POI5dK0yG) (Matemática Discreta por Shai Simonson - 19 vídeos)
|
||||
- [ ] [Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PLWX710qNZo_sNlSWRMVIh6kfTjolNaZ8t) (Matemática Discreta por Shai Simonson - 19 vídeos)
|
||||
|
||||
- [ ] [Discrete Mathematics Part 1 by Sarada Herke (5 videos)](https://www.youtube.com/playlist?list=PLGxuz-nmYlQPOc4w1Kp2MZrdqOOm4Jxeo) (Matemática Discreta Parte 1 por Sarada Herke - 5 vídeos)
|
||||
|
||||
|
|
@ -1952,7 +1927,7 @@ Sente-se e aproveite. "Netflix e habilidade" :P
|
|||
|
||||
- [ ] [MIT 6.858 Computer Systems Security, Fall 2014](https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) (MIT 6.858 Segurança de Sistemas de Computador, Outono de 2014)
|
||||
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/view_play_list?p=9D558D49CA734A02) (Stanford: Paradigmas de Programação - 27 vídeos)
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/playlist?list=PL9D558D49CA734A02) (Stanford: Paradigmas de Programação - 27 vídeos)
|
||||
|
||||
- [ ] [Introduction to Cryptography by Christof Paar](https://www.youtube.com/playlist?list=PL6N5qY2nvvJE8X75VkXglSrVhLv1tVcfy) (Introdução a Criptografia por Christof Paar)
|
||||
- [Website de Curso junto com Slides e Conjuntos de Problemas](http://www.crypto-textbook.com/)
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
|
|
@ -26,6 +26,14 @@
|
|||
- [Urdu](https://github.com/jwasham/coding-interview-university/issues/140)
|
||||
- [Thai](https://github.com/jwasham/coding-interview-university/issues/156)
|
||||
|
||||
<div align="center">
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
## นี่คืออะไร ?
|
||||
|
||||
นี่เป็นแผนการศึกษาหลายเดือนของผมจากนักพัฒนาเว็บไซต์ (ด้วยการศึกษาด้วยตัวเอง โดยไม่ได้จบวิทยาการคอมพิวเตอร์) เพื่อจะเป็นวิศวกรซอฟต์แวร์ในบริษัทขนาดใหญ่ที่หลายๆ คนต้องการเข้าทำงานด้วย
|
||||
|
|
@ -140,7 +148,6 @@
|
|||
- [ต้นไม้แบบ k-D](#k-d-trees)
|
||||
- [การข้ามรายการ](#skip-lists)
|
||||
- [กระแสเครือข่าย](#network-flows)
|
||||
- [โครงสร้างข้อมูลไม่มีส่วนร่วม และ ยูเนียนและค้นหา](#disjoint-sets--union-find)
|
||||
- [คณิตศาสต์สำหรับการประมวณผลอย่างรวดเร็ว](#math-for-fast-processing)
|
||||
- [ทรีพ](#treap)
|
||||
- [การโปรแกรมเชิงเส้น](#linear-programming)
|
||||
|
|
@ -186,7 +193,7 @@
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -210,7 +217,6 @@
|
|||
|
||||
- [ ] [ABC: Always Be Coding](https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.4heg8zvm4)
|
||||
- [ ] [Whiteboarding](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1)
|
||||
- [ ] [Effective Whiteboarding during Programming Interviews](http://www.coderust.com/blog/2014/04/10/effective-whiteboarding-during-programming-interviews/)
|
||||
- [ ] Cracking The Coding Interview Set 1:
|
||||
- [ ] [Gayle L McDowell - Cracking The Coding Interview (video)](https://www.youtube.com/watch?v=rEJzOhC5ZtQ)
|
||||
- [ ] [Cracking the Coding Interview with Author Gayle Laakmann McDowell (video)](https://www.youtube.com/watch?v=aClxtDcdpsQ)
|
||||
|
|
@ -392,8 +398,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 และ สถิติ ซึ่งมันก็เกินกว่าที่เราต้องการ
|
||||
|
||||
|
|
@ -486,6 +492,7 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
- [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/)
|
||||
- [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
|
||||
If some of the lectures are too mathy, you can jump down to the bottom and
|
||||
|
|
@ -498,12 +505,8 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
- [ ] Description:
|
||||
- [Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays)
|
||||
- [UCBerkley CS61B - Linear and Multi-Dim Arrays (video)](https://youtu.be/Wp8oiO_CZZE?t=15m32s)
|
||||
- [Basic Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_04-basicArrays.mp4)
|
||||
- [Multi-dim (video)](https://archive.org/details/0102WhatYouShouldKnow/02_05-multidimensionalArrays.mp4)
|
||||
- [Dynamic Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays)
|
||||
- [Jagged Arrays (video)](https://www.youtube.com/watch?v=1jtrQqYpt7g)
|
||||
- [Jagged Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_06-jaggedArrays.mp4)
|
||||
- [Resizing arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/03_01-resizableArrays.mp4)
|
||||
- [ ] Implement a vector (mutable array with automatic resizing):
|
||||
- [ ] Practice coding using arrays and pointers, and pointer math to jump to an index instead of using indexing.
|
||||
- [ ] new raw data array with allocated memory
|
||||
|
|
@ -534,6 +537,7 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
- [ ] Description:
|
||||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists)
|
||||
- [ ] [CS 61B - Linked Lists (video)](https://www.youtube.com/watch?v=sJtJOtXCW_M&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=5)
|
||||
- [ ] [[Review] Linked lists in 4 minutes (video)](https://youtu.be/F8AbOfQwl1c)
|
||||
- [ ] [C Code (video)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
|
||||
- not the whole video, just portions about Node struct and memory allocation.
|
||||
- [ ] Linked List vs Arrays:
|
||||
|
|
@ -565,14 +569,13 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
|
||||
- ### Stack
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [Using Stacks Last-In First-Out (video)](https://archive.org/details/0102WhatYouShouldKnow/05_01-usingStacksForLast-inFirst-out.mp4)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Will not implement. Implementing with array is trivial.
|
||||
|
||||
- ### Queue
|
||||
- [ ] [Using Queues First-In First-Out(video)](https://archive.org/details/0102WhatYouShouldKnow/05_03-usingQueuesForFirst-inFirst-out.mp4)
|
||||
- [ ] [Queue (video)](https://www.coursera.org/learn/data-structures/lecture/EShpq/queue)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [Priority Queues (video)](https://archive.org/details/0102WhatYouShouldKnow/05_04-priorityQueuesAndDeques.mp4)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] Implement using linked-list, with tail pointer:
|
||||
- enqueue(value) - adds value at position at tail
|
||||
- dequeue() - returns value and removes least recently added element (front)
|
||||
|
|
@ -597,12 +600,9 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
- [ ] [PyCon 2010: The Mighty Dictionary (video)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
|
||||
- [ ] [(Advanced) Randomization: Universal & Perfect Hashing (video)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(Advanced) Perfect hashing (video)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4)
|
||||
- [ ] [[Review] Hash tables in 4 minutes (video)](https://youtu.be/knV86FlSXJ8)
|
||||
|
||||
- [ ] Online Courses:
|
||||
- [ ] [Understanding Hash Functions (video)](https://archive.org/details/0102WhatYouShouldKnow/06_02-understandingHashFunctions.mp4)
|
||||
- [ ] [Using Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_03-usingHashTables.mp4)
|
||||
- [ ] [Supporting Hashing (video)](https://archive.org/details/0102WhatYouShouldKnow/06_04-supportingHashing.mp4)
|
||||
- [ ] [Language Support Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_05-languageSupportForHashTables.mp4)
|
||||
- [ ] [Core Hash Tables (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables)
|
||||
- [ ] [Data Structures (video)](https://www.coursera.org/learn/data-structures/home/week/3)
|
||||
- [ ] [Phone Book Problem (video)](https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem)
|
||||
|
|
@ -623,12 +623,13 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
- [ ] [Binary Search (video)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [Binary Search (video)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [detail](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Implement:
|
||||
- binary search (on sorted array of integers)
|
||||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.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:
|
||||
|
|
@ -657,7 +658,6 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
## Trees
|
||||
|
||||
- ### Trees - Notes & Background
|
||||
- [ ] [Series: Core Trees (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees)
|
||||
- [ ] [Series: Trees (video)](https://www.coursera.org/learn/data-structures/lecture/95qda/trees)
|
||||
- basic tree construction
|
||||
- traversal
|
||||
|
|
@ -677,6 +677,9 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
- inorder (DFS: left, self, right)
|
||||
- postorder (DFS: left, right, self)
|
||||
- preorder (DFS: self, left, right)
|
||||
- [ ] [[Review] Breadth-first search in 4 minutes (video)](https://youtu.be/HZ5YTanv5QE)
|
||||
- [ ] [[Review] Depth-first search in 4 minutes (video)](https://youtu.be/Urx87-NMm6c)
|
||||
- [ ] [[Review] Tree Traversal (playlist) in 11 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b)
|
||||
|
||||
- ### Binary search trees: BSTs
|
||||
- [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -724,6 +727,7 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
- [ ] [MIT: Heaps and Heap Sort (video)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B Lecture 24: Priority Queues (video)](https://www.youtube.com/watch?v=yIUFT6AKBGE&index=24&list=PL4BBB74C7D2A1049C)
|
||||
- [ ] [Linear Time BuildHeap (max-heap)](https://www.youtube.com/watch?v=MiyLo8adrWw)
|
||||
- [ ] [[Review] Heap (playlist) in 13 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNsyqgPW-DNwUeT8F8uhWc6)
|
||||
- [ ] Implement a max-heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - needed for insert
|
||||
|
|
@ -753,25 +757,6 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
|
||||
- For heapsort, see Heap data structure above. Heap sort is great, but not stable.
|
||||
|
||||
- [ ] [Sedgewick - Mergesort (5 videos)](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [1. Mergesort](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=1)
|
||||
- [ ] [2. Bottom up Mergesort](https://www.youtube.com/watch?v=HGOIGUYjeyk&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=2)
|
||||
- [ ] [3. Sorting Complexity](https://www.youtube.com/watch?v=WvU_mIWo0Ac&index=3&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [4. Comparators](https://www.youtube.com/watch?v=7MvC1kmBza0&index=4&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [5. Stability](https://www.youtube.com/watch?v=XD_5iINB5GI&index=5&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
|
||||
- [ ] [Sedgewick - Quicksort (4 videos)](https://www.youtube.com/playlist?list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [1. Quicksort](https://www.youtube.com/watch?v=5M5A7qPWk84&index=1&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [2. Selection](https://www.youtube.com/watch?v=CgVYfSyct_M&index=2&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [3. Duplicate Keys](https://www.youtube.com/watch?v=WBFzOYJ5ybM&index=3&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [4. System Sorts](https://www.youtube.com/watch?v=rejpZ2htBjE&index=4&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
|
||||
- [ ] UC Berkeley:
|
||||
- [ ] [CS 61B Lecture 29: Sorting I (video)](https://www.youtube.com/watch?v=EiUvYS2DT6I&list=PL4BBB74C7D2A1049C&index=29)
|
||||
- [ ] [CS 61B Lecture 30: Sorting II (video)](https://www.youtube.com/watch?v=2hTY3t80Qsk&list=PL4BBB74C7D2A1049C&index=30)
|
||||
- [ ] [CS 61B Lecture 32: Sorting III (video)](https://www.youtube.com/watch?v=Y6LOLpxg6Dc&index=32&list=PL4BBB74C7D2A1049C)
|
||||
- [ ] [CS 61B Lecture 33: Sorting V (video)](https://www.youtube.com/watch?v=qNMQ4ly43p4&index=33&list=PL4BBB74C7D2A1049C)
|
||||
|
||||
- [ ] [Bubble Sort (video)](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB)
|
||||
- [ ] [Analyzing Bubble Sort (video)](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB)
|
||||
- [ ] [Insertion Sort, Merge Sort (video)](https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
|
|
@ -789,6 +774,14 @@ There are a lot of distractions that can take up valuable time. Focus and concen
|
|||
- [ ] [Implementation (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c)
|
||||
- [ ] [Implementation (Python)](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py)
|
||||
|
||||
- [ ] [[Review] Sorting (playlist) in 18 minutes](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOZSbGAXAPIq1BeUf4j20pl)
|
||||
- [ ] [Quick sort in 4 minutes (video)](https://youtu.be/Hoixgm4-P4M)
|
||||
- [ ] [Heap sort in 4 minutes (video)](https://youtu.be/2DmK_H7IdTo)
|
||||
- [ ] [Merge sort in 3 minutes (video)](https://youtu.be/4VqmGXwpLqc)
|
||||
- [ ] [Bubble sort in 2 minutes (video)](https://youtu.be/xli_FI7CuzA)
|
||||
- [ ] [Selection sort in 3 minutes (video)](https://youtu.be/g-PGLbMth_g)
|
||||
- [ ] [Insertion sort in 2 minutes (video)](https://youtu.be/JU767SDMDvA)
|
||||
|
||||
- [ ] Implement:
|
||||
- [ ] Mergesort: O(n log n) average and worst case
|
||||
- [ ] Quicksort O(n log n) average case
|
||||
|
|
@ -847,6 +840,8 @@ Graphs can be used to represent many problems in computer science, so this secti
|
|||
- [ ] [CS 61B 2014: Weighted graphs (video)](https://www.youtube.com/watch?v=aJjlQCFwylA&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=19)
|
||||
- [ ] [Greedy Algorithms: Minimum Spanning Tree (video)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||
- [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (video)](https://www.youtube.com/watch?v=RpgcYiky7uw)
|
||||
- [ ] [[Review] Shortest Path Algorithms (playlist) in 16 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO-Y-H3xIC9DGSfVYJng9Yw)
|
||||
- [ ] [[Review] Minimum Spanning Trees (playlist) in 4 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZObEi3Hf6lmyW-CBfs7nkOV)
|
||||
|
||||
- Full Coursera Course:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -880,7 +875,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- when it is appropriate to use it
|
||||
- how is tail recursion better than not?
|
||||
- [ ] [What Is Tail Recursion Why Is It So Bad?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad)
|
||||
- [ ] [Tail Recursion (video)](https://www.youtube.com/watch?v=L1jjXGfxozc)
|
||||
- [ ] [Tail Recursion (video)](https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1)
|
||||
|
||||
- ### Dynamic Programming
|
||||
- This subject can be pretty difficult, as each DP soluble problem must be defined as a recursion relation, and coming up with it can be tricky.
|
||||
|
|
@ -1248,7 +1243,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
|
||||
|
|
@ -1287,34 +1282,9 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
|
||||
- [ ] Series of 2-3 minutes short subject videos (23 videos)
|
||||
- [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (18 videos):
|
||||
- [Videos](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] [Sedgewick Videos - Algorithms I](https://www.youtube.com/user/algorithmscourses/playlists?shelf_id=2&view=50&sort=dd)
|
||||
- [ ] [01. Union-Find](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
||||
- [ ] [02. Analysis of Algorithms](https://www.youtube.com/watch?v=ZN-nFW0mEpg&list=PLe-ggMe31CTf0_bkOhh7sa5uqeppp3Sr0)
|
||||
- [ ] [03. Stacks and Queues](https://www.youtube.com/watch?v=TIC1gappbP8&list=PLe-ggMe31CTe-9jhnj3P_3mmrCh0A7iHh)
|
||||
- [ ] [04. Elementary Sorts](https://www.youtube.com/watch?v=CD2AL6VO0ak&list=PLe-ggMe31CTe_5WhGV0F--7CK8MoRUqBd)
|
||||
- [ ] [05. Mergesort](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [06. Quicksort](https://www.youtube.com/watch?v=5M5A7qPWk84&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [07. Priority Queues](https://www.youtube.com/watch?v=G9TMe0KC0w0&list=PLe-ggMe31CTducy9LDiGVkdSv0NfiRwn5)
|
||||
- [ ] [08. Elementary Symbol Tables](https://www.youtube.com/watch?v=up_nlilw3ac&list=PLe-ggMe31CTc3a8nKRDxFZZrWrBvkc9SG)
|
||||
- [ ] [09. Balanced Search Trees](https://www.youtube.com/watch?v=qC1BLLPK_5w&list=PLe-ggMe31CTf7jHH_mFT50kayjCEA6Rhu)
|
||||
- [ ] [10. Geometric Applications of BST](https://www.youtube.com/watch?v=Wl30aGAp6TY&list=PLe-ggMe31CTdBsRIw0hXln0hilRs-DqAx)
|
||||
- [ ] [11. Hash Tables](https://www.youtube.com/watch?v=QA8fJGO-i9o&list=PLe-ggMe31CTcKxIRGqqThMts2eHtSrf11)
|
||||
- [ ] [Sedgewick Videos - Algorithms II](https://www.youtube.com/user/algorithmscourses/playlists?flow=list&shelf_id=3&view=50)
|
||||
- [ ] [01. Undirected Graphs](https://www.youtube.com/watch?v=GmVhD-mmMBg&list=PLe-ggMe31CTc0zDzANxl4I2MhMoRVlbRM)
|
||||
- [ ] [02. Directed Graphs](https://www.youtube.com/watch?v=_z-JsVaUS40&list=PLe-ggMe31CTcEwaU8a1P1Gd95A77HV85K)
|
||||
- [ ] [03. Minimum Spanning Trees](https://www.youtube.com/watch?v=t8fNk9tfVYY&list=PLe-ggMe31CTceUZxDesGfHGLE7kcSafqj)
|
||||
- [ ] [04. Shortest Paths](https://www.youtube.com/watch?v=HoGSiB7tSeI&list=PLe-ggMe31CTePpG3jbeOTsnGUGZDKxgZD)
|
||||
- [ ] [05. Maximum Flow](https://www.youtube.com/watch?v=rYIKlFstBqE&list=PLe-ggMe31CTduQ68XQ-sVj32wYJIspTma)
|
||||
- [ ] [06. Radix Sorts](https://www.youtube.com/watch?v=HKPrVm5FWvg&list=PLe-ggMe31CTcNvUX9E3tQeM6ntrdR8e53)
|
||||
- [ ] [07. Tries](https://www.youtube.com/watch?v=00YaFPcC65g&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ)
|
||||
- [ ] [08. Substring Search](https://www.youtube.com/watch?v=QzI0p6zDjK4&list=PLe-ggMe31CTdAdjXB3lIuf2maubzo9t66)
|
||||
- [ ] [09. Regular Expressions](https://www.youtube.com/watch?v=TQWNQsJSPnk&list=PLe-ggMe31CTetTlJWouM42fyttyKPgSDh)
|
||||
- [ ] [10. Data Compression](https://www.youtube.com/watch?v=at9tjpxcBh8&list=PLe-ggMe31CTciifRRo6yY0Yt0mzgIXXVZ)
|
||||
- [ ] [11. Reductions](https://www.youtube.com/watch?v=Ow5x-ooMGv8&list=PLe-ggMe31CTe_yliW5vc3yO-dj1LSSDyF)
|
||||
- [ ] [12. Linear Programming](https://www.youtube.com/watch?v=rWhcLyiLZLA&list=PLe-ggMe31CTdy6dKzMgkWFuTTN1H8B-E1)
|
||||
- [ ] [13. Intractability](https://www.youtube.com/watch?v=6qcaaDp4cdQ&list=PLe-ggMe31CTcZCjluBHw53e_ek2k9Kn-S)
|
||||
- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos):
|
||||
- [Videos](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1347,7 +1317,6 @@ Supplemental:
|
|||
- [Mathematics for Topcoders](https://www.topcoder.com/community/data-science/data-science-tutorials/mathematics-for-topcoders/)
|
||||
- [Dynamic Programming – From Novice to Advanced](https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/)
|
||||
- [MIT Interview Materials](https://web.archive.org/web/20160906124824/http://courses.csail.mit.edu/iap/interview/materials.php)
|
||||
- [Exercises for getting better at a given language](http://exercism.io/languages)
|
||||
|
||||
**Read and Do Programming Problems (in this order):**
|
||||
|
||||
|
|
@ -1379,11 +1348,11 @@ Challenge sites:
|
|||
- [Codility](https://codility.com/programmers/)
|
||||
- [InterviewCake](https://www.interviewcake.com/)
|
||||
- [Geeks for Geeks](http://www.geeksforgeeks.org/)
|
||||
- [InterviewBit](https://www.interviewbit.com/invite/icjf)
|
||||
- [InterviewBit](https://www.interviewbit.com)
|
||||
- [Sphere Online Judge (spoj)](http://www.spoj.com/)
|
||||
|
||||
Mock Interviews:
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/)
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/)
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/)
|
||||
|
||||
## Once you're closer to the interview
|
||||
|
|
@ -1496,7 +1465,6 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [Emacs Tutorial (Beginners) -Part 3- Expressions, Statements, ~/.emacs file and packages](https://www.youtube.com/watch?v=paSgzPso-yc)
|
||||
- [Evil Mode: Or, How I Learned to Stop Worrying and Love Emacs (video)](https://www.youtube.com/watch?v=JWD1Fpdd4Pc)
|
||||
- [Writing C Programs With Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs)
|
||||
- [(maybe) Org Mode In Depth: Managing Structure (video)](https://www.youtube.com/watch?v=nsGYet02bEk)
|
||||
|
||||
- ### Unix command line tools
|
||||
- I filled in the list below from good tools.
|
||||
|
|
@ -1658,6 +1626,7 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [ ] [AVL Trees (video)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
||||
- [ ] [AVL Tree Implementation (video)](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation)
|
||||
- [ ] [Split And Merge](https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge)
|
||||
- [ ] [[Review] AVL Trees (playlist) in 19 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOUFgdIeOPuH6cfSnNRMau-)
|
||||
|
||||
- [ ] **Splay trees**
|
||||
- In practice:
|
||||
|
|
@ -1683,6 +1652,7 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [ ] [Aduni - Algorithms - Lecture 5 (video)](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5)
|
||||
- [ ] [Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree)
|
||||
- [ ] [An Introduction To Binary Search And Red Black Tree](https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-binary-search-and-red-black-trees/)
|
||||
- [[Review] Red-Black Trees (playlist) in 30 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNqDI8qfOZgzbqahCUmUEin)
|
||||
|
||||
- [ ] **2-3 search trees**
|
||||
- In practice:
|
||||
|
|
@ -1722,6 +1692,7 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [ ] [MIT 6.851 - Memory Hierarchy Models (video)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
- covers cache-oblivious B-Trees, very interesting data structures
|
||||
- the first 37 minutes are very technical, may be skipped (B is block size, cache line size)
|
||||
- [[Review] B-Trees (playlist) in 26 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz)
|
||||
|
||||
|
||||
- ### k-D Trees
|
||||
|
|
@ -1740,10 +1711,6 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [ ] [Ford-Fulkerson Algorithm (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0)
|
||||
- [ ] [Network Flows (video)](https://www.youtube.com/watch?v=2vhN4Ice5jI)
|
||||
|
||||
- ### Disjoint Sets & Union Find
|
||||
- [ ] [UCB 61B - Disjoint Sets; Sorting & selection (video)](https://www.youtube.com/watch?v=MAEGXTwmUsI&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=21)
|
||||
- [ ] [Sedgewick Algorithms - Union-Find (6 videos)](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
||||
|
||||
- ### Math for Fast Processing
|
||||
- [ ] [Integer Arithmetic, Karatsuba Multiplication (video)](https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [The Chinese Remainder Theorem (used in cryptography) (video)](https://www.youtube.com/watch?v=ru7mWZJlRQg)
|
||||
|
|
@ -1786,7 +1753,6 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [Google's Deep Learning Nanodegree](https://www.udacity.com/course/deep-learning--ud730)
|
||||
- [Google/Kaggle Machine Learning Engineer Nanodegree](https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009)
|
||||
- [Self-Driving Car Engineer Nanodegree](https://www.udacity.com/drive)
|
||||
- [Metis Online Course ($99 for 2 months)](http://www.thisismetis.com/explore-data-science)
|
||||
- แหล่งเรียนรู้:
|
||||
- หนังสือ:
|
||||
- [Python Machine Learning](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/)
|
||||
|
|
@ -1881,7 +1847,7 @@ Sit back and enjoy. "Netflix and skill" :P
|
|||
|
||||
- [ ] [Computer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory](https://www.youtube.com/playlist?list=PL-XXv-cvA_iD8wQm8U0gG_Z1uHjImKXFy)
|
||||
|
||||
- [ ] [Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PL3o9D4Dl2FJ9q0_gtFXPh_H4POI5dK0yG)
|
||||
- [ ] [Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PLWX710qNZo_sNlSWRMVIh6kfTjolNaZ8t)
|
||||
|
||||
- [ ] [Discrete Mathematics Part 1 by Sarada Herke (5 videos)](https://www.youtube.com/playlist?list=PLGxuz-nmYlQPOc4w1Kp2MZrdqOOm4Jxeo)
|
||||
|
||||
|
|
@ -1922,7 +1888,7 @@ Sit back and enjoy. "Netflix and skill" :P
|
|||
|
||||
- [ ] [MIT 6.858 Computer Systems Security, Fall 2014](https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/view_play_list?p=9D558D49CA734A02)
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/playlist?list=PL9D558D49CA734A02)
|
||||
|
||||
- [ ] [Introduction to Cryptography by Christof Paar](https://www.youtube.com/playlist?list=PL6N5qY2nvvJE8X75VkXglSrVhLv1tVcfy)
|
||||
- [Course Website along with Slides and Problem Sets](http://www.crypto-textbook.com/)
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
|
|
@ -1,34 +1,95 @@
|
|||
# Coding Interview University
|
||||
|
||||
Original: [англійською](README.md)
|
||||
Original in [English](README.md)
|
||||
|
||||
> Спочатку я створив це як короткий список завдань для вивчення тем, щоб стати
|
||||
інженером-програмістом, але він збільшився до великого списку, який ви бачите
|
||||
сьогодні. Пройшовши цей навчальний план,
|
||||
[мене найняли розробником програмного забезпечення в Amazon](https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)!
|
||||
>
|
||||
> Я навчався приблизно 8-12 годин на день, протягом декількох місяців. Це моя
|
||||
історія:
|
||||
[Чому я навчався очно протягом 8 місяців для інтерв’ю в Google](https://medium.freecodecamp.org/why-i-studied-full-time-for-8-months-for-a-google-interview-cc662ce9bb13).
|
||||
>
|
||||
> Перелічені тут ресурси добре підготують вас до технічної співбесіди практично
|
||||
в будь-якій компанії, включаючи гігантів: Amazon, Facebook, Google та
|
||||
Microsoft.
|
||||
>
|
||||
> *Нехай щастить!*
|
||||
|
||||
<details>
|
||||
<summary>Переклади:</summary>
|
||||
|
||||
- [Bahasa Indonesia](translations/README-id.md)
|
||||
- [Bulgarian](translations/README-bg.md)
|
||||
- [Español](translations/README-es.md)
|
||||
- [German](translations/README-de.md)
|
||||
- [Japanese (日本語)](translations/README-ja.md)
|
||||
- [Polish](translations/README-pl.md)
|
||||
- [Português Brasileiro](translations/README-ptbr.md)
|
||||
- [Russian](translations/README-ru.md)
|
||||
- [Tiếng Việt - Vietnamese](translations/README-vi.md)
|
||||
- [Urdu - اردو](tanslations/README-ur.md)
|
||||
- [Uzbek](translations/README-uz.md)
|
||||
- [বাংলা - Bangla](translations/README-bn.md)
|
||||
- [ខ្មែរ - Khmer](translations/README-kh.md)
|
||||
- [中文版本](translations/README-cn.md)
|
||||
- [繁體中文](translations/README-tw.md)
|
||||
</details>
|
||||
|
||||
<details>
|
||||
<summary>Переклади в процесі:</summary>
|
||||
|
||||
- [Afrikaans](https://github.com/jwasham/coding-interview-university/issues/1164)
|
||||
- [Arabic](https://github.com/jwasham/coding-interview-university/issues/98)
|
||||
- [French](https://github.com/jwasham/coding-interview-university/issues/89)
|
||||
- [Greek](https://github.com/jwasham/coding-interview-university/issues/166)
|
||||
- [Italian](https://github.com/jwasham/coding-interview-university/issues/1030)
|
||||
- [Korean(한국어)](https://github.com/jwasham/coding-interview-university/issues/118)
|
||||
- [Malayalam](https://github.com/jwasham/coding-interview-university/issues/239)
|
||||
- [Persian - Farsi](https://github.com/jwasham/coding-interview-university/issues/186)
|
||||
- [Telugu](https://github.com/jwasham/coding-interview-university/issues/117)
|
||||
- [Thai](https://github.com/jwasham/coding-interview-university/issues/156)
|
||||
- [Turkish](https://github.com/jwasham/coding-interview-university/issues/90)
|
||||
- [Українська](https://github.com/jwasham/coding-interview-university/issues/106)
|
||||
- [עברית](https://github.com/jwasham/coding-interview-university/issues/82)
|
||||
- [हिन्दी](https://github.com/jwasham/coding-interview-university/issues/81)
|
||||
</details>
|
||||
|
||||
<div align="center">
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
## Що це?
|
||||
|
||||
Це мій багатомісячний навчальний план для перетворення з веб-розробника (самоучки без ступеню з CS)
|
||||
на розробника програмного забезпечення у Google.
|
||||
Це мій багатомісячний план навчання для переходу від веб-розробника (самоука,
|
||||
без ступеня з комп'ютерних наук) до інженера програмного забезпечення для
|
||||
великої компанії.
|
||||
|
||||
|
||||
|
||||
Цей довгий список був видобутий і розширений з **тренувальних нотаток Google**, отже це речі, які ви повинні знати.
|
||||
Тут є додаткові пункти, які я додав знизу — вони можуть зустрітися в інтерв’ю або бути корисними у вирішенні завдань.
|
||||
Багато пунктів взято з «[Get that job at Google](http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html)» Steve Yegge,
|
||||
вони іноді дослівно відображаються в тренувальних нотатках Google.
|
||||
Цей список призначено
|
||||
**для піонерів у сфері розробки програмного забезпечення** або
|
||||
тих, хто переходить від кодування/веб-розробки до більш архітектурних,
|
||||
інженерних рішень (де потрібні знання комп'ютерних наук). Якщо у вас
|
||||
багаторічний досвід і ви стверджуєте, що він таким є, очікуйте більш важкого
|
||||
інтерв’ю.
|
||||
|
||||
Я обрав, що вам потрібно знати, базуючись на рекомендаціях Yegge. Я вніс зміни до вимог Yegge на основі інформації,
|
||||
отриманої від мого контакту у Google. Це призначено для **нових розробників програмного забезпечення** або тих,
|
||||
що переходять з веб-розробки на розробку програмного забезпечення (де потрібне знання CS). Якщо у вас багаторічний
|
||||
досвід, і ви заявляєте про багаторічний досвід розробки програмного забезпечення, очікуйте на більш жорстке інтерв’ю.
|
||||
[Прочитайте більше](https://googleyasheck.com/what-you-need-to-know-for-your-google-interview-and-what-you-dont/).
|
||||
Також якщо у вас є багаторічний досвід кодування/веб-розробки, зверніть увагу,
|
||||
що великі компанії-розробники програмного забезпечення, такі як Google, Amazon,
|
||||
Facebook та Microsoft, відрізняють розробку програмного забезпечення
|
||||
від веб-розробки, і вони потребують знання комп'ютерних наук.
|
||||
|
||||
Якщо у вас багато років досвіду веб-розробки, майте на увазі, що Google відрізняє розробку програмного забезпечення
|
||||
від веб-розробки, і вони потребують знання Computer Science.
|
||||
|
||||
Якщо ви хочете бути інженером з надійності або системним інженером, вчіть більше за опціональним списком (мережі,
|
||||
безпека).
|
||||
Якщо ви хочете бути інженером з надійності або системним інженером, вчіть
|
||||
більше за опціональним списком (мережі, безпека).
|
||||
|
||||
---
|
||||
|
||||
## Таблиця контенту
|
||||
## Зміст
|
||||
|
||||
- [Що це?](#Що-це)
|
||||
- [Чому це використовувати?](#Чому-це-використовувати)
|
||||
|
|
@ -134,7 +195,6 @@ Original: [англійською](README.md)
|
|||
- [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)
|
||||
|
|
@ -181,7 +241,7 @@ Original: [англійською](README.md)
|
|||
|
||||
`git commit -m "Marked x" `
|
||||
|
||||
`git rebase jwasham/master `
|
||||
`git rebase jwasham/main `
|
||||
|
||||
`git push --force `
|
||||
|
||||
|
|
@ -205,7 +265,6 @@ Sometimes the classes are not in session so you have to wait a couple of months,
|
|||
|
||||
- [ ] [ABC: Always Be Coding](https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.4heg8zvm4)
|
||||
- [ ] [Whiteboarding](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1)
|
||||
- [ ] [Effective Whiteboarding during Programming Interviews](http://www.coderust.com/blog/2014/04/10/effective-whiteboarding-during-programming-interviews/)
|
||||
- [ ] [Demystifying Tech Recruiting](https://www.youtube.com/watch?v=N233T0epWTs)
|
||||
- [ ] Cracking The Coding Interview Set 1:
|
||||
- [ ] [Gayle L McDowell - Cracking The Coding Interview (video)](https://www.youtube.com/watch?v=rEJzOhC5ZtQ)
|
||||
|
|
@ -390,8 +449,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.
|
||||
|
||||
|
|
@ -484,6 +543,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/)
|
||||
- [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
|
||||
If some of the lectures are too mathy, you can jump down to the bottom and
|
||||
|
|
@ -496,12 +556,8 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] Description:
|
||||
- [Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays)
|
||||
- [UCBerkley CS61B - Linear and Multi-Dim Arrays (video)](https://youtu.be/Wp8oiO_CZZE?t=15m32s)
|
||||
- [Basic Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_04-basicArrays.mp4)
|
||||
- [Multi-dim (video)](https://archive.org/details/0102WhatYouShouldKnow/02_05-multidimensionalArrays.mp4)
|
||||
- [Dynamic Arrays (video)](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays)
|
||||
- [Jagged Arrays (video)](https://www.youtube.com/watch?v=1jtrQqYpt7g)
|
||||
- [Jagged Arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/02_06-jaggedArrays.mp4)
|
||||
- [Resizing arrays (video)](https://archive.org/details/0102WhatYouShouldKnow/03_01-resizableArrays.mp4)
|
||||
- [ ] Implement a vector (mutable array with automatic resizing):
|
||||
- [ ] Practice coding using arrays and pointers, and pointer math to jump to an index instead of using indexing.
|
||||
- [ ] new raw data array with allocated memory
|
||||
|
|
@ -532,6 +588,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] Description:
|
||||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists)
|
||||
- [ ] [CS 61B - Linked Lists (video)](https://www.youtube.com/watch?v=sJtJOtXCW_M&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=5)
|
||||
- [ ] [[Review] Linked lists in 4 minutes (video)](https://youtu.be/F8AbOfQwl1c)
|
||||
- [ ] [C Code (video)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
|
||||
- not the whole video, just portions about Node struct and memory allocation.
|
||||
- [ ] Linked List vs Arrays:
|
||||
|
|
@ -563,14 +620,13 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
|
||||
- ### Stack
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [Using Stacks Last-In First-Out (video)](https://archive.org/details/0102WhatYouShouldKnow/05_01-usingStacksForLast-inFirst-out.mp4)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Will not implement. Implementing with array is trivial.
|
||||
|
||||
- ### Queue
|
||||
- [ ] [Using Queues First-In First-Out(video)](https://archive.org/details/0102WhatYouShouldKnow/05_03-usingQueuesForFirst-inFirst-out.mp4)
|
||||
- [ ] [Queue (video)](https://www.coursera.org/learn/data-structures/lecture/EShpq/queue)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [Priority Queues (video)](https://archive.org/details/0102WhatYouShouldKnow/05_04-priorityQueuesAndDeques.mp4)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] Implement using linked-list, with tail pointer:
|
||||
- enqueue(value) - adds value at position at tail
|
||||
- dequeue() - returns value and removes least recently added element (front)
|
||||
|
|
@ -595,12 +651,9 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [PyCon 2010: The Mighty Dictionary (video)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
|
||||
- [ ] [(Advanced) Randomization: Universal & Perfect Hashing (video)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(Advanced) Perfect hashing (video)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4)
|
||||
- [ ] [[Review] Hash tables in 4 minutes (video)](https://youtu.be/knV86FlSXJ8)
|
||||
|
||||
- [ ] Online Courses:
|
||||
- [ ] [Understanding Hash Functions (video)](https://archive.org/details/0102WhatYouShouldKnow/06_02-understandingHashFunctions.mp4)
|
||||
- [ ] [Using Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_03-usingHashTables.mp4)
|
||||
- [ ] [Supporting Hashing (video)](https://archive.org/details/0102WhatYouShouldKnow/06_04-supportingHashing.mp4)
|
||||
- [ ] [Language Support Hash Tables (video)](https://archive.org/details/0102WhatYouShouldKnow/06_05-languageSupportForHashTables.mp4)
|
||||
- [ ] [Core Hash Tables (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables)
|
||||
- [ ] [Data Structures (video)](https://www.coursera.org/learn/data-structures/home/week/3)
|
||||
- [ ] [Phone Book Problem (video)](https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem)
|
||||
|
|
@ -621,12 +674,13 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [Binary Search (video)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [Binary Search (video)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [detail](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Implement:
|
||||
- binary search (on sorted array of integers)
|
||||
- binary search using recursion
|
||||
|
||||
- ### Bitwise operations
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.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:
|
||||
|
|
@ -655,7 +709,6 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
## Trees
|
||||
|
||||
- ### Trees - Notes & Background
|
||||
- [ ] [Series: Core Trees (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees)
|
||||
- [ ] [Series: Trees (video)](https://www.coursera.org/learn/data-structures/lecture/95qda/trees)
|
||||
- basic tree construction
|
||||
- traversal
|
||||
|
|
@ -675,6 +728,9 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- inorder (DFS: left, self, right)
|
||||
- postorder (DFS: left, right, self)
|
||||
- preorder (DFS: self, left, right)
|
||||
- [ ] [[Review] Breadth-first search in 4 minutes (video)](https://youtu.be/HZ5YTanv5QE)
|
||||
- [ ] [[Review] Depth-first search in 4 minutes (video)](https://youtu.be/Urx87-NMm6c)
|
||||
- [ ] [[Review] Tree Traversal (playlist) in 11 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b)
|
||||
|
||||
- ### Binary search trees: BSTs
|
||||
- [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -722,6 +778,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [MIT: Heaps and Heap Sort (video)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B Lecture 24: Priority Queues (video)](https://www.youtube.com/watch?v=yIUFT6AKBGE&index=24&list=PL4BBB74C7D2A1049C)
|
||||
- [ ] [Linear Time BuildHeap (max-heap)](https://www.youtube.com/watch?v=MiyLo8adrWw)
|
||||
- [ ] [[Review] Heap (playlist) in 13 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNsyqgPW-DNwUeT8F8uhWc6)
|
||||
- [ ] Implement a max-heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - needed for insert
|
||||
|
|
@ -751,25 +808,6 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
|
||||
- For heapsort, see Heap data structure above. Heap sort is great, but not stable.
|
||||
|
||||
- [ ] [Sedgewick - Mergesort (5 videos)](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [1. Mergesort](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=1)
|
||||
- [ ] [2. Bottom up Mergesort](https://www.youtube.com/watch?v=HGOIGUYjeyk&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=2)
|
||||
- [ ] [3. Sorting Complexity](https://www.youtube.com/watch?v=WvU_mIWo0Ac&index=3&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [4. Comparators](https://www.youtube.com/watch?v=7MvC1kmBza0&index=4&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [5. Stability](https://www.youtube.com/watch?v=XD_5iINB5GI&index=5&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
|
||||
- [ ] [Sedgewick - Quicksort (4 videos)](https://www.youtube.com/playlist?list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [1. Quicksort](https://www.youtube.com/watch?v=5M5A7qPWk84&index=1&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [2. Selection](https://www.youtube.com/watch?v=CgVYfSyct_M&index=2&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [3. Duplicate Keys](https://www.youtube.com/watch?v=WBFzOYJ5ybM&index=3&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [4. System Sorts](https://www.youtube.com/watch?v=rejpZ2htBjE&index=4&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
|
||||
- [ ] UC Berkeley:
|
||||
- [ ] [CS 61B Lecture 29: Sorting I (video)](https://www.youtube.com/watch?v=EiUvYS2DT6I&list=PL4BBB74C7D2A1049C&index=29)
|
||||
- [ ] [CS 61B Lecture 30: Sorting II (video)](https://www.youtube.com/watch?v=2hTY3t80Qsk&list=PL4BBB74C7D2A1049C&index=30)
|
||||
- [ ] [CS 61B Lecture 32: Sorting III (video)](https://www.youtube.com/watch?v=Y6LOLpxg6Dc&index=32&list=PL4BBB74C7D2A1049C)
|
||||
- [ ] [CS 61B Lecture 33: Sorting V (video)](https://www.youtube.com/watch?v=qNMQ4ly43p4&index=33&list=PL4BBB74C7D2A1049C)
|
||||
|
||||
- [ ] [Bubble Sort (video)](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB)
|
||||
- [ ] [Analyzing Bubble Sort (video)](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB)
|
||||
- [ ] [Insertion Sort, Merge Sort (video)](https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
|
|
@ -787,6 +825,14 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [Implementation (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c)
|
||||
- [ ] [Implementation (Python)](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py)
|
||||
|
||||
- [ ] [[Review] Sorting (playlist) in 18 minutes](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOZSbGAXAPIq1BeUf4j20pl)
|
||||
- [ ] [Quick sort in 4 minutes (video)](https://youtu.be/Hoixgm4-P4M)
|
||||
- [ ] [Heap sort in 4 minutes (video)](https://youtu.be/2DmK_H7IdTo)
|
||||
- [ ] [Merge sort in 3 minutes (video)](https://youtu.be/4VqmGXwpLqc)
|
||||
- [ ] [Bubble sort in 2 minutes (video)](https://youtu.be/xli_FI7CuzA)
|
||||
- [ ] [Selection sort in 3 minutes (video)](https://youtu.be/g-PGLbMth_g)
|
||||
- [ ] [Insertion sort in 2 minutes (video)](https://youtu.be/JU767SDMDvA)
|
||||
|
||||
- [ ] Implement:
|
||||
- [ ] Mergesort: O(n log n) average and worst case
|
||||
- [ ] Quicksort O(n log n) average case
|
||||
|
|
@ -846,6 +892,8 @@ Graphs can be used to represent many problems in computer science, so this secti
|
|||
- [ ] [CS 61B 2014: Weighted graphs (video)](https://www.youtube.com/watch?v=aJjlQCFwylA&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=19)
|
||||
- [ ] [Greedy Algorithms: Minimum Spanning Tree (video)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||
- [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (video)](https://www.youtube.com/watch?v=RpgcYiky7uw)
|
||||
- [ ] [[Review] Shortest Path Algorithms (playlist) in 16 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO-Y-H3xIC9DGSfVYJng9Yw)
|
||||
- [ ] [[Review] Minimum Spanning Trees (playlist) in 4 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZObEi3Hf6lmyW-CBfs7nkOV)
|
||||
|
||||
- Full Coursera Course:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -879,7 +927,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
- when it is appropriate to use it
|
||||
- how is tail recursion better than not?
|
||||
- [ ] [What Is Tail Recursion Why Is It So Bad?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad)
|
||||
- [ ] [Tail Recursion (video)](https://www.youtube.com/watch?v=L1jjXGfxozc)
|
||||
- [ ] [Tail Recursion (video)](https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1)
|
||||
|
||||
- ### Dynamic Programming
|
||||
- This subject can be pretty difficult, as each DP soluble problem must be defined as a recursion relation, and coming up with it can be tricky.
|
||||
|
|
@ -1249,7 +1297,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
|
||||
|
|
@ -1288,34 +1336,9 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
|
|||
|
||||
- [ ] Series of 2-3 minutes short subject videos (23 videos)
|
||||
- [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (18 videos):
|
||||
- [Videos](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] [Sedgewick Videos - Algorithms I](https://www.youtube.com/user/algorithmscourses/playlists?shelf_id=2&view=50&sort=dd)
|
||||
- [ ] [01. Union-Find](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
||||
- [ ] [02. Analysis of Algorithms](https://www.youtube.com/watch?v=ZN-nFW0mEpg&list=PLe-ggMe31CTf0_bkOhh7sa5uqeppp3Sr0)
|
||||
- [ ] [03. Stacks and Queues](https://www.youtube.com/watch?v=TIC1gappbP8&list=PLe-ggMe31CTe-9jhnj3P_3mmrCh0A7iHh)
|
||||
- [ ] [04. Elementary Sorts](https://www.youtube.com/watch?v=CD2AL6VO0ak&list=PLe-ggMe31CTe_5WhGV0F--7CK8MoRUqBd)
|
||||
- [ ] [05. Mergesort](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [06. Quicksort](https://www.youtube.com/watch?v=5M5A7qPWk84&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [07. Priority Queues](https://www.youtube.com/watch?v=G9TMe0KC0w0&list=PLe-ggMe31CTducy9LDiGVkdSv0NfiRwn5)
|
||||
- [ ] [08. Elementary Symbol Tables](https://www.youtube.com/watch?v=up_nlilw3ac&list=PLe-ggMe31CTc3a8nKRDxFZZrWrBvkc9SG)
|
||||
- [ ] [09. Balanced Search Trees](https://www.youtube.com/watch?v=qC1BLLPK_5w&list=PLe-ggMe31CTf7jHH_mFT50kayjCEA6Rhu)
|
||||
- [ ] [10. Geometric Applications of BST](https://www.youtube.com/watch?v=Wl30aGAp6TY&list=PLe-ggMe31CTdBsRIw0hXln0hilRs-DqAx)
|
||||
- [ ] [11. Hash Tables](https://www.youtube.com/watch?v=QA8fJGO-i9o&list=PLe-ggMe31CTcKxIRGqqThMts2eHtSrf11)
|
||||
- [ ] [Sedgewick Videos - Algorithms II](https://www.youtube.com/user/algorithmscourses/playlists?flow=list&shelf_id=3&view=50)
|
||||
- [ ] [01. Undirected Graphs](https://www.youtube.com/watch?v=GmVhD-mmMBg&list=PLe-ggMe31CTc0zDzANxl4I2MhMoRVlbRM)
|
||||
- [ ] [02. Directed Graphs](https://www.youtube.com/watch?v=_z-JsVaUS40&list=PLe-ggMe31CTcEwaU8a1P1Gd95A77HV85K)
|
||||
- [ ] [03. Minimum Spanning Trees](https://www.youtube.com/watch?v=t8fNk9tfVYY&list=PLe-ggMe31CTceUZxDesGfHGLE7kcSafqj)
|
||||
- [ ] [04. Shortest Paths](https://www.youtube.com/watch?v=HoGSiB7tSeI&list=PLe-ggMe31CTePpG3jbeOTsnGUGZDKxgZD)
|
||||
- [ ] [05. Maximum Flow](https://www.youtube.com/watch?v=rYIKlFstBqE&list=PLe-ggMe31CTduQ68XQ-sVj32wYJIspTma)
|
||||
- [ ] [06. Radix Sorts](https://www.youtube.com/watch?v=HKPrVm5FWvg&list=PLe-ggMe31CTcNvUX9E3tQeM6ntrdR8e53)
|
||||
- [ ] [07. Tries](https://www.youtube.com/watch?v=00YaFPcC65g&list=PLe-ggMe31CTe9IyG9MB8vt5xUJeYgOYRQ)
|
||||
- [ ] [08. Substring Search](https://www.youtube.com/watch?v=QzI0p6zDjK4&list=PLe-ggMe31CTdAdjXB3lIuf2maubzo9t66)
|
||||
- [ ] [09. Regular Expressions](https://www.youtube.com/watch?v=TQWNQsJSPnk&list=PLe-ggMe31CTetTlJWouM42fyttyKPgSDh)
|
||||
- [ ] [10. Data Compression](https://www.youtube.com/watch?v=at9tjpxcBh8&list=PLe-ggMe31CTciifRRo6yY0Yt0mzgIXXVZ)
|
||||
- [ ] [11. Reductions](https://www.youtube.com/watch?v=Ow5x-ooMGv8&list=PLe-ggMe31CTe_yliW5vc3yO-dj1LSSDyF)
|
||||
- [ ] [12. Linear Programming](https://www.youtube.com/watch?v=rWhcLyiLZLA&list=PLe-ggMe31CTdy6dKzMgkWFuTTN1H8B-E1)
|
||||
- [ ] [13. Intractability](https://www.youtube.com/watch?v=6qcaaDp4cdQ&list=PLe-ggMe31CTcZCjluBHw53e_ek2k9Kn-S)
|
||||
- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos):
|
||||
- [Videos](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1348,7 +1371,6 @@ Supplemental:
|
|||
- [Mathematics for Topcoders](https://www.topcoder.com/community/data-science/data-science-tutorials/mathematics-for-topcoders/)
|
||||
- [Dynamic Programming – From Novice to Advanced](https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/)
|
||||
- [MIT Interview Materials](https://web.archive.org/web/20160906124824/http://courses.csail.mit.edu/iap/interview/materials.php)
|
||||
- [Exercises for getting better at a given language](http://exercism.io/languages)
|
||||
|
||||
**Read and Do Programming Problems (in this order):**
|
||||
|
||||
|
|
@ -1380,11 +1402,11 @@ Challenge sites:
|
|||
- [Codility](https://codility.com/programmers/)
|
||||
- [InterviewCake](https://www.interviewcake.com/)
|
||||
- [Geeks for Geeks](http://www.geeksforgeeks.org/)
|
||||
- [InterviewBit](https://www.interviewbit.com/invite/icjf)
|
||||
- [InterviewBit](https://www.interviewbit.com)
|
||||
- [Sphere Online Judge (spoj)](http://www.spoj.com/)
|
||||
|
||||
Mock Interviews:
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/)
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/)
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/)
|
||||
|
||||
## Once you're closer to the interview
|
||||
|
|
@ -1443,11 +1465,11 @@ You're never really done.
|
|||
|
||||
*****************************************************************************************************
|
||||
*****************************************************************************************************
|
||||
|
||||
|
||||
Everything below this point is optional.
|
||||
By studying these, you'll get greater exposure to more CS concepts, and will be better prepared for
|
||||
any software engineering job. You'll be a much more well-rounded software engineer.
|
||||
|
||||
|
||||
*****************************************************************************************************
|
||||
*****************************************************************************************************
|
||||
|
||||
|
|
@ -1497,7 +1519,6 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [Emacs Tutorial (Beginners) -Part 3- Expressions, Statements, ~/.emacs file and packages](https://www.youtube.com/watch?v=paSgzPso-yc)
|
||||
- [Evil Mode: Or, How I Learned to Stop Worrying and Love Emacs (video)](https://www.youtube.com/watch?v=JWD1Fpdd4Pc)
|
||||
- [Writing C Programs With Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs)
|
||||
- [(maybe) Org Mode In Depth: Managing Structure (video)](https://www.youtube.com/watch?v=nsGYet02bEk)
|
||||
|
||||
- ### Unix command line tools
|
||||
- I filled in the list below from good tools.
|
||||
|
|
@ -1659,6 +1680,7 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [ ] [AVL Trees (video)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
||||
- [ ] [AVL Tree Implementation (video)](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation)
|
||||
- [ ] [Split And Merge](https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge)
|
||||
- [ ] [[Review] AVL Trees (playlist) in 19 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOUFgdIeOPuH6cfSnNRMau-)
|
||||
|
||||
- [ ] **Splay trees**
|
||||
- In practice:
|
||||
|
|
@ -1684,6 +1706,7 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [ ] [Aduni - Algorithms - Lecture 5 (video)](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5)
|
||||
- [ ] [Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree)
|
||||
- [ ] [An Introduction To Binary Search And Red Black Tree](https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-binary-search-and-red-black-trees/)
|
||||
- [[Review] Red-Black Trees (playlist) in 30 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNqDI8qfOZgzbqahCUmUEin)
|
||||
|
||||
- [ ] **2-3 search trees**
|
||||
- In practice:
|
||||
|
|
@ -1723,6 +1746,7 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [ ] [MIT 6.851 - Memory Hierarchy Models (video)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
- covers cache-oblivious B-Trees, very interesting data structures
|
||||
- the first 37 minutes are very technical, may be skipped (B is block size, cache line size)
|
||||
- [[Review] B-Trees (playlist) in 26 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz)
|
||||
|
||||
|
||||
- ### k-D Trees
|
||||
|
|
@ -1741,10 +1765,6 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [ ] [Ford-Fulkerson Algorithm (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0)
|
||||
- [ ] [Network Flows (video)](https://www.youtube.com/watch?v=2vhN4Ice5jI)
|
||||
|
||||
- ### Disjoint Sets & Union Find
|
||||
- [ ] [UCB 61B - Disjoint Sets; Sorting & selection (video)](https://www.youtube.com/watch?v=MAEGXTwmUsI&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=21)
|
||||
- [ ] [Sedgewick Algorithms - Union-Find (6 videos)](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
||||
|
||||
- ### Math for Fast Processing
|
||||
- [ ] [Integer Arithmetic, Karatsuba Multiplication (video)](https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [The Chinese Remainder Theorem (used in cryptography) (video)](https://www.youtube.com/watch?v=ru7mWZJlRQg)
|
||||
|
|
@ -1787,7 +1807,6 @@ software engineer, and to be aware of certain technologies and algorithms, so yo
|
|||
- [Google's Deep Learning Nanodegree](https://www.udacity.com/course/deep-learning--ud730)
|
||||
- [Google/Kaggle Machine Learning Engineer Nanodegree](https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009)
|
||||
- [Self-Driving Car Engineer Nanodegree](https://www.udacity.com/drive)
|
||||
- [Metis Online Course ($99 for 2 months)](http://www.thisismetis.com/explore-data-science)
|
||||
- Resources:
|
||||
- Books:
|
||||
- [Python Machine Learning](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/)
|
||||
|
|
@ -1882,7 +1901,7 @@ Sit back and enjoy. "Netflix and skill" :P
|
|||
|
||||
- [ ] [Computer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory](https://www.youtube.com/playlist?list=PL-XXv-cvA_iD8wQm8U0gG_Z1uHjImKXFy)
|
||||
|
||||
- [ ] [Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PL3o9D4Dl2FJ9q0_gtFXPh_H4POI5dK0yG)
|
||||
- [ ] [Discrete Mathematics by Shai Simonson (19 videos)](https://www.youtube.com/playlist?list=PLWX710qNZo_sNlSWRMVIh6kfTjolNaZ8t)
|
||||
|
||||
- [ ] [Discrete Mathematics Part 1 by Sarada Herke (5 videos)](https://www.youtube.com/playlist?list=PLGxuz-nmYlQPOc4w1Kp2MZrdqOOm4Jxeo)
|
||||
|
||||
|
|
@ -1923,7 +1942,7 @@ Sit back and enjoy. "Netflix and skill" :P
|
|||
|
||||
- [ ] [MIT 6.858 Computer Systems Security, Fall 2014](https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh)
|
||||
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/view_play_list?p=9D558D49CA734A02)
|
||||
- [ ] [Stanford: Programming Paradigms (27 videos)](https://www.youtube.com/playlist?list=PL9D558D49CA734A02)
|
||||
|
||||
- [ ] [Introduction to Cryptography by Christof Paar](https://www.youtube.com/playlist?list=PL6N5qY2nvvJE8X75VkXglSrVhLv1tVcfy)
|
||||
- [Course Website along with Slides and Problem Sets](http://www.crypto-textbook.com/)
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
Loading…
Reference in New Issue