Merge branch 'main' into progress
This commit is contained in:
Ulric Kouassi
GitHub
commit
84e99e7383
|
|
@ -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 }}
|
||||
Binary file not shown.
Binary file not shown.
|
|
@ -2,13 +2,17 @@
|
|||
|
||||
- C
|
||||
- [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)
|
||||
- [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/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)
|
||||
|
|
@ -31,6 +35,8 @@
|
|||
- [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/main/extras/cheat%20sheets/python-cheat-sheet-v1.pdf)
|
||||
- [Python in One Video](https://www.youtube.com/watch?v=N4mEzFDjqtA)
|
||||
|
|
@ -41,15 +47,20 @@
|
|||
- [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/ajinkyal121/coding-interview-university/blob/master/extras/cheat%20sheets/Coding%20Interview%20Python%20Language%20Essentials.pdf)
|
||||
- [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)
|
||||
- [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/)
|
||||
|
|
@ -61,20 +72,27 @@
|
|||
- [Go Proverbs - Rob Pike (video)](https://www.youtube.com/watch?v=PAAkCSZUG1c)
|
||||
- [Gophercises - Free course on Coding Exercises in Go](https://gophercises.com)
|
||||
- HTML
|
||||
- [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)
|
||||
- [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
|
||||
- [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/)
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,106 +1,98 @@
|
|||
# الإعداد لمقابلة البرمجة
|
||||
|
||||
> أنشأتها في المقام الأول كلائحة قصيرة من المواضيع الدراسية لكيف يصبح المرء مهندس برمجيات، ولكن سرعان ما كبرت هذه القائمة إلى ما تراه أمامك اليوم. بعد خوض هذه الخطة الدراسية,
|
||||
[تم توظيفي كمهندس تطوير برمجيات لدى أمازون](https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)! على الأغلب لن تحتاج إلى ان تدرس بالقدر الذي درسته أنا. لكن على كل حال كل ما تحتاج إليه موجود
|
||||
هنا
|
||||
>
|
||||
> درست لمدة ٨-١٢ ساعة في اليوم, لعدة أشهر. هذه هي قصتي: [لماذا درست دواما كاملا لمدة ثمانية أشهر من أجل مقابلة لدا قوقل](https://medium.freecodecamp.org/why-i-studied-full-time-for-8-months-for-a-google-interview-cc662ce9bb13)
|
||||
>
|
||||
> العناصر المذكورة في هذه اللائحة ستجهزك جيدا لمقابلة تقنية مع تقريبا أي شركة برمجية, حتى الشركات العملاقة: أمازون، فيسبوك، قوقل، وميكروسوفت
|
||||
>
|
||||
> بالتوفيق
|
||||
<div align="right">
|
||||
|
||||
> لقد قمت بأنشاء هذا في الأصل كلائحة صغيرة تحتوي على مواضيع دراسية الغرض من دراستها ان أصبح مهندس برامجيات،
|
||||
> لكنها توسعت الى قائمة كبيرة التي تراها اليوم. بعد ان قمتُ بدراسة لائحة المواضيع هذه وحسب الخطة، [حصلت على عمل كمهندس برامجيات في شركة امازون](https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)
|
||||
>! على الأغلب لن تحتاج إلى ان تدرس بالقدر الذي درسته أنا. لكن على كل حال كل ما تحتاج إليه موجود هنا.
|
||||
>
|
||||
>درستُ لمدة ٨-١٢ ساعة في اليوم, لعدة أشهر. هذه هي قصتي: [لماذا كرستُ كل وقتي لمدة ثمانية أشهر من أجل مقابلة لدا قوقل](https://medium.freecodecamp.org/why-i-studied-full-time-for-8-months-for-a-google-interview-cc662ce9bb13)
|
||||
>
|
||||
> **ملاحظة:** لن تحتاج للدراسة بقدر ما فعلت انا، لقد اهدرت المزيد من الوقت والجهد على مواضيع لم اكن بحاجة الى معرفتها، مزيد حول ذلك ادناه، سوف اساعدك بالوصول الى هناك دون اضاعة وقتك الثمين.
|
||||
>
|
||||
> المواضيع المدرجة في هذه اللائحة ستجهزك جيدا لاجراء مقابلة تقنية مع اي شركة برمجية تقريبا، حتى الشركات العملاقة: أمازون، فيسبوك، قوقل، وميكروسوفت.
|
||||
>
|
||||
>بالتوفيق.
|
||||
>
|
||||
|
||||
<details>
|
||||
</div>
|
||||
|
||||
|
||||
|
||||
<details dir="rtl">
|
||||
<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)
|
||||
- [Tiếng Việt - الفيتنامبة](translations/README-vi.md)
|
||||
- [الإسبانية](translations/README-es.md)
|
||||
- [(البرتغالية (البرازيلية](translations/README-ptbr.md)
|
||||
- [البولندية](translations/README-pl.md)
|
||||
- [繁體中文](translations/README-tw.md)
|
||||
- [اليابانية (日本語)](translations/README-ja.md)
|
||||
- [الروسية](translations/README-ru.md)
|
||||
|
||||
</details>
|
||||
|
||||
<details>
|
||||
<details dir="rtl">
|
||||
<summary>ترجمات تحت الإعداد:</summary>
|
||||
|
||||
- [हिन्दी](https://github.com/jwasham/coding-interview-university/issues/81)
|
||||
- [עברית](https://github.com/jwasham/coding-interview-university/issues/82)
|
||||
- [الإندونيسية](https://github.com/jwasham/coding-interview-university/issues/101)
|
||||
- [العربية](https://github.com/jwasham/coding-interview-university/issues/98)
|
||||
- [التركية](https://github.com/jwasham/coding-interview-university/issues/90)
|
||||
- [الفرنسية](https://github.com/jwasham/coding-interview-university/issues/89)
|
||||
- [الأكرانية](https://github.com/jwasham/coding-interview-university/issues/106)
|
||||
- [الكورية(한국어)](https://github.com/jwasham/coding-interview-university/issues/118)
|
||||
- [Telugu](https://github.com/jwasham/coding-interview-university/issues/117)
|
||||
- [أردو](https://github.com/jwasham/coding-interview-university/issues/140)
|
||||
- [التايلندية](https://github.com/jwasham/coding-interview-university/issues/156)
|
||||
- [اليونانية](https://github.com/jwasham/coding-interview-university/issues/166)
|
||||
- [الإيطالية](https://github.com/jwasham/coding-interview-university/issues/170)
|
||||
- [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>
|
||||
|
||||
<hr />
|
||||
|
||||
<div align="center">
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
## ما هذا؟
|
||||
هي خطتي متعددة الأشهر للوصول من مطور ويب (تعليم ذاتي، بدون درجة علمية في علوم الحاسب) لمنصب مهندس برمجيات لشركة عملاقة
|
||||
## ما هذا!
|
||||
<p align="center">
|
||||
<img alt="Coding at the whiteboard - from HBO's Silicon Valley" src="https://d3j2pkmjtin6ou.cloudfront.net/coding-at-the-whiteboard-silicon-valley.png">
|
||||
</p>
|
||||
|
||||
هذه خطتي الدراسية التي تستغرق عدة اشهر من اجل ان اصبح مهندس برامجيات في شركة عملاقة.
|
||||
|
||||
|
||||
**المتطلبات:**
|
||||
* خبرة قليلة في البرمجة (المتغيرات، التكرارات، الدوال، الخ).
|
||||
* صبر.
|
||||
* وقت.
|
||||
|
||||
تم إعدادها لمهنسي البرمجيات الجدد أو أولئك المنتقلين من تطوير الويب إلى هندسة البرمجيات (حيث المعرفة بعلوم الحاسب ضرورية) إذا كان لديك العديد من سنوات الخبرة في بناء تطبيقات الويب أو البرمجيات، خذ في عين الإعتبار ان المقابلة ستكون اصعب
|
||||
ملاحظة: هذه الخطة الدراسية هي من اجل ان تصبح مهندس برامجيات وليس من اجل ان تصبح مطور تطبيقات للويب. كبرى الشركات التقنية مثل كوكل، امازون، مايكروسوفت، فيسبوك ينظرون الى مهندس البرامجيات بنظرة مختلفة عن مطور البرامجيات/الويب، على سبيل المثال شركة امازون لديها مهندس الواجهات (Frontend Engineers) ولديها مهندس تطوير برامجيات (Software Development Engineers) ولكل منها دور مختلف والمقابلة التقنية لكل منها مختلفة تماما، لكن بصورة عام تتطلب هذه الشركات معرفة بعلوم الحاسوب للمتقدمين لشغل ادوار تخص تطوير البرامجيات او هندسة البرامجيات.
|
||||
|
||||
إذا كانت لديك العديد من سنوات الخبرة في تطوير الويب, خذ في عين الإعتبار أن الشركات االبرمجية الضخمة مثل قوقل, فيسبوك, و ميكروسوفت ينظرون إلى هندسة البرمجيات بشكل مختلف عن تطوير البرمجيات/ويب, و تحتاج إلى معرفة علوم الحاسب
|
||||
|
||||
إذا اردت ان تصبح مهندس موثوقية أو مهندس عمليات, ادرس اكثر من القائمة الإختيارية (شبكات, امن)
|
||||
|
||||
---
|
||||
<hr />
|
||||
|
||||
## الفهرس
|
||||
|
||||
- [ما هذا؟](#ما-هذا؟)
|
||||
- [لماذا استخدمه؟](#لماذا-استخدمه؟)
|
||||
|
||||
<div dir='rtl' align='right'>
|
||||
|
||||
|
||||
- [ما هذا؟](#ما-هذا)
|
||||
- [لماذا استخدم هذه الخطة الدراسية؟](#لماذا-استخدم-هذه-الخطة-الدراسية)
|
||||
- [كيفية استخدامها](#كيفية-استخدامها)
|
||||
- [عن مصادر مقاطع الفديو](#عن-مصادر-مقاطع-الفديو)
|
||||
- [عن مصادر مقاطع الفيديو](#عن-مصادر-مقاطع-الفديو)
|
||||
- [مراحل المقابلة الشخصية & الإستعداد العام للمقابلة](#مراحل-المقابلة-الشخصية-و-الإستعداد-العام-للمقابلة)
|
||||
- [اختر لغة برمجية واحدة للمقابلة البرمجية](#اختر-لغة-برمجية-واحدة-للمقابلة-البرمجية)
|
||||
- [لائحة الكتب](#لائحة-الكتب)
|
||||
|
|
@ -108,112 +100,112 @@
|
|||
- [ما لن تجده هنا](#ما-لن-تجده-هنا)
|
||||
- [الخطة اليومية](#الخطة-اليومية)
|
||||
- [معرفة مسبقة](#المعرفة-المسبقة)
|
||||
- [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
|
||||
- [Data Structures](#data-structures)
|
||||
- [Arrays](#arrays)
|
||||
- [Linked Lists](#linked-lists)
|
||||
- [Stack](#stack)
|
||||
- [Queue](#queue)
|
||||
- [Hash table](#hash-table)
|
||||
- [More Knowledge](#more-knowledge)
|
||||
- [Binary search](#binary-search)
|
||||
- [Bitwise operations](#bitwise-operations)
|
||||
- [Trees](#trees)
|
||||
- [Trees - Notes & Background](#trees---notes--background)
|
||||
- [Binary search trees: BSTs](#binary-search-trees-bsts)
|
||||
- [Heap / Priority Queue / Binary Heap](#heap--priority-queue--binary-heap)
|
||||
- balanced search trees (general concept, not details)
|
||||
- traversals: preorder, inorder, postorder, BFS, DFS
|
||||
- [Sorting](#sorting)
|
||||
- selection
|
||||
- insertion
|
||||
- heapsort
|
||||
- quicksort
|
||||
- merge sort
|
||||
- [Graphs](#graphs)
|
||||
- directed
|
||||
- undirected
|
||||
- adjacency matrix
|
||||
- adjacency list
|
||||
- traversals: BFS, DFS
|
||||
- [Even More Knowledge](#even-more-knowledge)
|
||||
- [Recursion](#recursion)
|
||||
- [Dynamic Programming](#dynamic-programming)
|
||||
- [Object-Oriented Programming](#object-oriented-programming)
|
||||
- [Design Patterns](#design-patterns)
|
||||
- [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
|
||||
- [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
|
||||
- [Caches](#caches)
|
||||
- [Processes and Threads](#processes-and-threads)
|
||||
- [Testing](#testing)
|
||||
- [Scheduling](#scheduling)
|
||||
- [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)
|
||||
- [تقدير وتحليل أداء الخوارزميات (Algorithmic complexity / Big-O / Asymptotic analysis)](#algorithmic-complexity--big-o--asymptotic-analysis)
|
||||
- [هياكل البيانات (Data Structures)](#data-structures)
|
||||
- [المصفوفات (Arrays)](#arrays)
|
||||
- [العقد المترابطة (Linked Lists)](#linked-lists)
|
||||
- [المكدس (Stack)](#stack)
|
||||
- [الطابور (Queue)](#queue)
|
||||
- [جداول التجزئة (Hash table)](#hash-table)
|
||||
- [معرفة اضافية](#more-knowledge)
|
||||
- [الـ 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)
|
||||
- [الـ Testing](#testing)
|
||||
- [الـ Scheduling](#scheduling)
|
||||
- [الـ 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 Resources
|
||||
## مصادر اضافية
|
||||
- [الـ 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-videos)
|
||||
- [الـ Parity & Hamming Code](#parity--hamming-code-videos)
|
||||
- [الـ 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)
|
||||
- [الـ 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-videos)
|
||||
- [الـ Geometry, Convex hull](#geometry-convex-hull-videos)
|
||||
- [الـ 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)
|
||||
- [الـ Papers](#papers)
|
||||
|
||||
- [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-videos)
|
||||
- [Parity & Hamming Code](#parity--hamming-code-videos)
|
||||
- [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)
|
||||
- [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-videos)
|
||||
- [Geometry, Convex hull](#geometry-convex-hull-videos)
|
||||
- [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)
|
||||
- [Papers](#papers)
|
||||
|
||||
---
|
||||
|
||||
## لماذا استخدمه؟
|
||||
|
||||
</div>
|
||||
|
||||
## لماذا استخدم هذه الخطة الدراسية؟
|
||||
|
||||
أقوم بمتابعة هذه الخطة لتحضير إلى المقابلة الشخصية بجوجل. لقد قمت بناء مواقع ويب، وتقديم خدمات ذات صلة، وبناء شركات ناشئة منذ 1997. لدي درجة علمية في الاقتصاد، وليس في علوم الحاسب. أنا شخص ناجح في مجال عملي، ولكنني أريد أن أعمل بجوجل. أريد أن أعمل على أنظمة كبيرة والحصول على فهم كبير في أنظمة الحاسوب، كفاءة الخوارزميات، كقاءة الهياكل البيانية، اللغات الأقرب إلى الآلة وكيفية عملها. وإذ لم تعرف أين منها لن تعينك جوجل.
|
||||
|
||||
|
|
@ -230,40 +222,43 @@
|
|||
|
||||
|
||||
**اصنع مسار جديد يمكن من خلاله أن تضع علامة [x]**
|
||||
|
||||
احصل على نسخة خاصة "fork" بك واتبع هذه الأوامر
|
||||
|
||||
Clone to your local repo
|
||||
|
||||
`git clone git@github.com:<your_github_username>/coding-interview-university.git`
|
||||
|
||||
`git checkout -b progress`
|
||||
|
||||
`git remote add jwasham https://github.com/jwasham/coding-interview-university`
|
||||
|
||||
`git fetch --all`
|
||||
احصل على نسخة خاصة "fork" بك واتبع هذه الأوامر
|
||||
1- Clone to your local repo
|
||||
```
|
||||
git clone git@github.com:<your_github_username>/coding-interview-university.git
|
||||
cd coding-interview-university
|
||||
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/main`
|
||||
|
||||
`git push --set-upstream origin progress`
|
||||
|
||||
`git push --force`
|
||||
```
|
||||
git add .
|
||||
git commit -m "Marked x"
|
||||
git rebase jwasham/main
|
||||
git push --set-upstream origin progress
|
||||
git push --force
|
||||
```
|
||||
|
||||
[More about Github-flavored markdown](https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown)
|
||||
|
||||
|
||||
## هل تشعر أنك لست بالذكاء الكافي
|
||||
|
||||
|
||||
<div dir='rtl' align='right'>
|
||||
|
||||
|
||||
- مهندسوا جوجل أذكياء، وربما لديهم عدم الأمان لأنهم ليسوا بالذكاء الكافي، حتى وهي في جوجل
|
||||
|
||||
- [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)
|
||||
- شاهد هذا الفيديو عبر اليوتيوب [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)
|
||||
|
||||
|
||||
|
||||
</div>
|
||||
|
||||
|
||||
## عن مصادر مقاطع الفديو
|
||||
|
|
@ -536,6 +531,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/competitive-programming/tutorials/computational-complexity-section-1/)
|
||||
- [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/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)
|
||||
|
||||
## Data Structures
|
||||
|
||||
|
|
@ -577,6 +573,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/lecture/data-structures/singly-linked-lists-kHhgK)
|
||||
- [ ] [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)
|
||||
- not the whole video, just portions about Node struct and memory allocation
|
||||
- [ ] Linked List vs Arrays:
|
||||
|
|
@ -608,11 +605,13 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input
|
|||
|
||||
- ### Stack
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/lecture/data-structures/stacks-UdKzQ)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Will not implement. Implementing with array is trivial
|
||||
|
||||
- ### Queue
|
||||
- [ ] [Queue (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [[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)
|
||||
|
|
@ -637,6 +636,7 @@ 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:
|
||||
- [ ] [Core Hash Tables (video)](https://www.coursera.org/lecture/data-structures-optimizing-performance/core-hash-tables-m7UuP)
|
||||
|
|
@ -659,6 +659,7 @@ 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/competitive-programming/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
|
||||
|
|
@ -710,6 +711,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)
|
||||
|
|
@ -755,6 +759,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://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)
|
||||
- [ ] Implement a max-heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - needed for insert
|
||||
|
|
@ -819,6 +824,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
|
||||
|
|
@ -882,6 +895,8 @@ Graphs can be used to represent many problems in computer science, so this secti
|
|||
- [ ] [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)
|
||||
|
||||
- Full Coursera Course:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -1268,8 +1283,9 @@ Graphs can be used to represent many problems in computer science, so this secti
|
|||
|
||||
- [ ] 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)
|
||||
- [ ] 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)
|
||||
- [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1)
|
||||
- [ ] [Sedgewick Videos - Algorithms II](https://www.coursera.org/learn/algorithms-part2)
|
||||
|
||||
|
|
@ -1305,7 +1321,6 @@ Supplemental:
|
|||
- [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)
|
||||
|
||||
**Read and Do Programming Problems (in this order):**
|
||||
|
||||
|
|
@ -1359,7 +1374,7 @@ Challenge repos:
|
|||
- [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/) - I used this and it helped me relax for the phone screen and on-site interview
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/) - I used this and it helped me relax for the phone screen and on-site interview
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/) - peer-to-peer model of practice interviews
|
||||
- [Refdash: Mock interviews and expedited interviews](https://refdash.com/) - also help candidates fast track by skipping multiple interviews with tech companies
|
||||
- [interviewing.io: Practice mock interview with senior engineers](https://interviewing.io) - anonymous algorithmic/systems design interviews with senior engineers from FAANG anonymously.
|
||||
|
|
@ -1522,7 +1537,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
|
||||
- I filled in the list below from good tools.
|
||||
|
|
@ -1683,6 +1697,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:
|
||||
|
|
@ -1707,7 +1722,8 @@ You're never really done.
|
|||
- [Aduni - Algorithms - Lecture 4 (link jumps to starting point) (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 search trees**
|
||||
- In practice:
|
||||
|
|
@ -1748,6 +1764,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
|
||||
|
|
@ -1812,7 +1829,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/)
|
||||
|
|
|
|||
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
|
|
@ -15,34 +15,40 @@
|
|||
<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">
|
||||
|
|
@ -50,35 +56,6 @@
|
|||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -294,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)
|
||||
|
|
@ -580,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>
|
||||
|
|
@ -594,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
|
||||
|
|
@ -631,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:
|
||||
|
|
@ -662,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
|
||||
|
|
@ -694,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)
|
||||
|
|
@ -725,6 +695,7 @@ 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
|
||||
|
|
@ -781,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)
|
||||
|
|
@ -828,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
|
||||
|
|
@ -898,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
|
||||
|
|
@ -966,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)
|
||||
|
|
@ -1389,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)
|
||||
|
||||
|
|
@ -1431,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):**
|
||||
|
||||
|
|
@ -1477,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.
|
||||
|
||||
|
|
@ -1636,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.
|
||||
|
|
@ -1797,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:
|
||||
|
|
@ -1821,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:
|
||||
|
|
@ -1862,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
|
||||
|
|
@ -1926,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/)
|
||||
|
|
|
|||
|
|
@ -186,7 +186,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)
|
||||
- [ ] [Αποτελεσματικό Whiteboarding κατά τη διάρκεια των 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)
|
||||
|
|
@ -457,6 +456,7 @@
|
|||
- [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)
|
||||
|
||||
|
||||
Εάν μερικές διαλέξεις είναι πολύ μαθηματικές, μπορείς να μεταβείς προς τα κάτω και να παρακολουθήσεις μερικά βίντεο σχετικά με τα διακριτά μαθηματικά για να πάρεις όλες τις γνώσεις που απαιτούνται.
|
||||
|
|
@ -504,6 +504,7 @@
|
|||
- [ ] Περιγραφή:
|
||||
- [ ] [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:
|
||||
|
|
@ -539,6 +540,7 @@
|
|||
- ### 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
|
||||
|
|
@ -546,6 +548,7 @@
|
|||
- [ ] [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)
|
||||
|
|
@ -570,6 +573,7 @@
|
|||
- [ ] [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)
|
||||
|
|
@ -596,6 +600,7 @@
|
|||
- [ ] [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
|
||||
|
|
@ -649,4 +654,7 @@
|
|||
worst: O(n)
|
||||
- inorder (DFS: left, self, right)
|
||||
- postorder (DFS: left, right, self)
|
||||
- preorder (DFS: self, left, right)
|
||||
- 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
|
|
@ -17,38 +17,40 @@
|
|||
<details>
|
||||
<summary>ترجمه ها:</summary>
|
||||
|
||||
- [中文版本](translations/README-cn.md)
|
||||
- [Tiếng Việt - Vietnamese](translations/README-vi.md)
|
||||
- [Español](translations/README-es.md)
|
||||
- [Português Brasileiro](translations/README-ptbr.md)
|
||||
- [Polish](translations/README-pl.md)
|
||||
- [繁體中文](translations/README-tw.md)
|
||||
- [Japanese (日本語)](translations/README-ja.md)
|
||||
- [Russian](translations/README-ru.md)
|
||||
- [German](translations/README-de.md)
|
||||
- [Bahasa Indonesia](translations/README-id.md)
|
||||
- [ខ្មែរ - Khmer](translations/README-kh.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>
|
||||
|
||||
- [हिन्दी](https://github.com/jwasham/coding-interview-university/issues/81)
|
||||
- [עברית](https://github.com/jwasham/coding-interview-university/issues/82)
|
||||
- [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)
|
||||
- [Українська](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)
|
||||
- [Urdu](https://github.com/jwasham/coding-interview-university/issues/519)
|
||||
- [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)
|
||||
</details>
|
||||
|
||||
<div align="center">
|
||||
|
|
@ -56,35 +58,6 @@
|
|||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -582,6 +555,7 @@ Choose one:
|
|||
- [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/)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
بسیارخب، فکر کنم در همین حد کافی باشه.
|
||||
|
||||
|
|
@ -627,6 +601,7 @@ Choose one:
|
|||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/lecture/data-structures/singly-linked-lists-kHhgK)
|
||||
- [ ] [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)
|
||||
- not the whole video, just portions about Node struct and memory allocation
|
||||
- [ ] Linked List vs Arrays:
|
||||
|
|
@ -658,11 +633,13 @@ Choose one:
|
|||
|
||||
- ### پشته
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/lecture/data-structures/stacks-UdKzQ)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Will not implement. Implementing with array is trivial
|
||||
|
||||
- ### صف
|
||||
- [ ] [Queue (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [[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)
|
||||
|
|
@ -688,6 +665,7 @@ Choose one:
|
|||
- [ ] [PyCon 2017: The Dictionary Even Mightier (video)](https://www.youtube.com/watch?v=66P5FMkWoVU)
|
||||
- [ ] [(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:
|
||||
- [ ] [Core Hash Tables (video)](https://www.coursera.org/lecture/data-structures-optimizing-performance/core-hash-tables-m7UuP)
|
||||
|
|
@ -710,6 +688,7 @@ Choose one:
|
|||
- [ ] [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/competitive-programming/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
|
||||
|
|
@ -761,6 +740,9 @@ Choose one:
|
|||
- 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)
|
||||
|
||||
- ### درخت جستجوی دودویی: BSTs
|
||||
- [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -806,6 +788,7 @@ Choose one:
|
|||
- [ ] [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)
|
||||
- [ ] Implement a max-heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - needed for insert
|
||||
|
|
@ -870,6 +853,14 @@ Choose one:
|
|||
- [ ] [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
|
||||
|
|
@ -933,6 +924,8 @@ Choose one:
|
|||
- [ ] [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)
|
||||
|
||||
- Full Coursera Course:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -1191,8 +1184,9 @@ Choose one:
|
|||
|
||||
- [ ] 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)
|
||||
- [ ] 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)
|
||||
- [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1)
|
||||
- [ ] [Sedgewick Videos - Algorithms II](https://www.coursera.org/learn/algorithms-part2)
|
||||
|
||||
|
|
@ -1237,7 +1231,7 @@ Choose one:
|
|||
- Many times, it’s not your technical competency that holds you back from landing your dream job, it’s how you perform on the behavioral interview.
|
||||
|
||||
Mock Interviews:
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/) - I used this and it helped me relax for the phone screen and on-site interview
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/) - I used this and it helped me relax for the phone screen and on-site interview
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/) - peer-to-peer model of practice interviews
|
||||
- [interviewing.io: Practice mock interview with senior engineers](https://interviewing.io) - anonymous algorithmic/systems design interviews with senior engineers from FAANG anonymously
|
||||
|
||||
|
|
@ -1492,7 +1486,6 @@ Mock Interviews:
|
|||
- [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.
|
||||
|
|
@ -1653,6 +1646,7 @@ Mock Interviews:
|
|||
- [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:
|
||||
|
|
@ -1677,7 +1671,8 @@ Mock Interviews:
|
|||
- [Aduni - Algorithms - Lecture 4 (link jumps to starting point) (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 search trees**
|
||||
- In practice:
|
||||
|
|
@ -1718,6 +1713,7 @@ Mock Interviews:
|
|||
- [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
|
||||
|
|
@ -1784,7 +1780,6 @@ Mock Interviews:
|
|||
- [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/)
|
||||
|
|
@ -1980,4 +1975,4 @@ Sit back and enjoy.
|
|||
|
||||
## LICENSE
|
||||
|
||||
[CC-BY-SA-4.0](./LICENSE.txt)
|
||||
[CC-BY-SA-4.0](./LICENSE.txt)
|
||||
|
|
|
|||
|
|
@ -10,35 +10,6 @@ Traductions:
|
|||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -52,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
|
||||
|
|
@ -89,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
|
||||
|
|
@ -128,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 ----------------
|
||||
|
||||
|
|
@ -170,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)
|
||||
|
|
@ -226,13 +196,13 @@ Print out a "[future Googler](https://github.com/jwasham/coding-interview-univer
|
|||
|
||||
[](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)
|
||||
|
||||
|
|
@ -277,168 +247,171 @@ Parfois, les cours ne sont pas en session, alors vous devez attendre quelques mo
|
|||
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.
|
||||
|
|
@ -587,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.
|
||||
|
|
@ -599,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
|
||||
|
|
@ -635,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:
|
||||
|
|
@ -666,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)
|
||||
|
|
@ -698,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)
|
||||
|
|
@ -724,6 +690,7 @@ 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
|
||||
|
|
@ -777,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)
|
||||
|
|
@ -824,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
|
||||
|
|
@ -853,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)
|
||||
|
|
@ -889,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
|
||||
|
|
@ -946,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)
|
||||
|
|
@ -1313,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)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1375,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):**
|
||||
|
||||
|
|
@ -1406,7 +1342,7 @@ Challenge sites:
|
|||
- [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
|
||||
|
||||
|
|
@ -1560,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.
|
||||
|
|
@ -1749,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:
|
||||
|
|
@ -1774,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:
|
||||
|
|
@ -1813,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
|
||||
|
|
@ -1831,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)
|
||||
|
|
@ -1877,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/)
|
||||
|
|
|
|||
|
|
@ -1,4 +1,4 @@
|
|||
# Coding Interview University
|
||||
# Coding Interview University אוניברסיטיה של ראיונות קוד
|
||||
<div dir='rtl'>
|
||||
<h2> על מה מדובר כאן?</h2>
|
||||
<p>
|
||||
|
|
@ -22,35 +22,6 @@
|
|||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -60,7 +31,7 @@
|
|||
ערכתי וקיצרתי עבורכם את מה שלדעתי נדרש עבור מהנדס תוכנה מתחיל עם מעט ניסיון מתוך המקורות הנ"ל.
|
||||
עבור אלו מכם הרוצים הסבת מקצוע מפיתוח אתרים או פיתוח תוכנה בתפקידים כאלו ואחרים שאינם הנדסת תוכנה.
|
||||
עבור אלו מכם בעלי הניסיון כמהנדסי תוכנה, בייחוד אם ישנן שנות ניסיון רבות כמהנדס תוכנה בתחום, המשימות הנ"ל עלולות להיות קלות מדי והציפיות מהם בראיון לגוגל יהיו הרבה יותר גבוהות.
|
||||
במידה ואתם בעלי מספר שנות ניסיון כמפתחים, גוגל רואה בהנדסת תוכנה משהו שונה מתכנות נטו ולכן הדרישות הן שונות ודבוהות יותר.
|
||||
במידה ואתם בעלי מספר שנות ניסיון כמפתחים, גוגל רואה בהנדסת תוכנה משהו שונה מתכנות נטו ולכן הדרישות הן שונות וגבוהות יותר.
|
||||
עבור מהנדסי המערכת ומהנדסי האמינות שביניכם, השקיעו יותר בחומר המופיע ב"רשימת הרשות" זוהי רשימת משימות המכילה נושאי רשות עבור מהנדס תוכנה.
|
||||
---
|
||||
## תוכן העניינים Table of Contents
|
||||
|
|
@ -172,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)
|
||||
|
|
@ -190,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
|
||||
|
|
@ -317,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)
|
||||
|
|
@ -351,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.
|
||||
|
||||
|
|
@ -373,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:
|
||||
|
||||
|
|
@ -466,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)
|
||||
|
|
@ -485,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.
|
||||
|
||||
|
|
@ -589,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)
|
||||
|
|
@ -602,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
|
||||
|
|
@ -650,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:
|
||||
|
|
@ -679,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)
|
||||
|
|
@ -713,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)
|
||||
|
|
@ -733,12 +695,13 @@ 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
|
||||
|
|
@ -770,9 +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
|
||||
- ### עצים - Notes & Background
|
||||
- [ ] [Series: Trees (video)](https://www.coursera.org/learn/data-structures/lecture/95qda/trees)
|
||||
- basic tree construction
|
||||
- traversal
|
||||
|
|
@ -792,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)
|
||||
|
|
@ -839,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
|
||||
|
|
@ -852,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:
|
||||
|
|
@ -868,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)
|
||||
|
|
@ -904,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
|
||||
|
|
@ -961,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)
|
||||
|
|
@ -992,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)
|
||||
|
|
@ -1084,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-)
|
||||
|
||||
|
|
@ -1153,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
|
||||
|
|
@ -1308,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)
|
||||
|
|
@ -1321,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)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1390,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):**
|
||||
|
||||
|
|
@ -1422,7 +1354,7 @@ See [Book List above](#book-list)
|
|||
|
||||
ראיונות דמה:
|
||||
- [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
|
||||
|
||||
|
|
@ -1431,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
|
||||
|
|
@ -1493,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
|
||||
|
|
@ -1509,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.
|
||||
|
|
@ -1536,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)
|
||||
|
|
@ -1576,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.
|
||||
|
|
@ -1632,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)
|
||||
|
|
@ -1754,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
|
||||
|
|
@ -1765,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:
|
||||
|
|
@ -1790,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:
|
||||
|
|
@ -1829,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
|
||||
|
|
@ -1847,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)
|
||||
|
|
@ -1872,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?
|
||||
|
|
@ -1893,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/)
|
||||
|
|
@ -1903,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)
|
||||
|
|
@ -1970,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)
|
||||
|
|
@ -2048,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
|
|
@ -7,35 +7,6 @@ Versi asli: [Bahasa Inggris](../README.md)
|
|||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -471,6 +442,7 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s
|
|||
- [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/)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
## Struktur Data
|
||||
|
||||
|
|
@ -493,8 +465,8 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s
|
|||
- [ ] push(item)
|
||||
- [ ] insert(index, item) - menyisipkan item pada indeks, menggeser nilai indeks dan elemen tambahan ke kanan
|
||||
- [ ] prepend(item) - dapat menggunakan sisipan di atas pada indeks 0
|
||||
- [ ] pop() - hapus dari akhir, nilai kembali
|
||||
- [ ] delete(index) - hapus item pada indeks, menggeser semua elemen tertinggal ke kiri
|
||||
- [ ] pop() - menghapus item dari akhir, nilai kembali
|
||||
- [ ] delete(index) - menghapus item pada indeks, menggeser semua elemen tertinggal ke kiri
|
||||
- [ ] remove(item) - mencari nilai dan menghapus indeks yang menahannya (meskipun di banyak tempat)
|
||||
- [ ] find(item) - mencari nilai dan mengembalikan indeks pertama dengan nilai itu, -1 jika tidak ditemukan
|
||||
- [ ] resize(new_capacity) // fungsi pribadi
|
||||
|
|
@ -512,6 +484,7 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s
|
|||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/lecture/data-structures/singly-linked-lists-kHhgK)
|
||||
- [ ] [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)
|
||||
- [ ] [Kode C (video)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
|
||||
- bukan keseluruhan video, hanya bagian tentang struct Node dan alokasi memori
|
||||
- [ ] Linked List vs Array:
|
||||
|
|
@ -543,12 +516,14 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s
|
|||
|
||||
- ### Stack
|
||||
- [ ] [Stack (video)](https://www.coursera.org/lecture/data-structures/stacks-UdKzQ)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Tidak akan diterapkan. Implementasi dengan array itu sepele
|
||||
|
||||
- ### Queue
|
||||
- Queue (Antrean)
|
||||
- [ ] [Queue (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] Implementasikan menggunakan linked-list, dengan tail pointer:
|
||||
- enqueue(value) - menambah nilai pada posisi di ekor
|
||||
- dequeue() - mengembalikan nilai dan menghapus elemen yang paling baru ditambahkan (depan)
|
||||
|
|
@ -574,6 +549,7 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s
|
|||
- [ ] [PyCon 2010: The Mighty Dictionary (video)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
|
||||
- [ ] [(Lanjutan) Pengacakan: Universal & Hashing Sempurna (video)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(Lanjutan) Hash sempurna (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)
|
||||
|
||||
- [ ] Kursus Online:
|
||||
- [ ] [Tabel Hash Inti (video)](https://www.coursera.org/lecture/data-structures-optimizing-performance/core-hash-tables-m7UuP)
|
||||
|
|
@ -596,6 +572,7 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s
|
|||
- [ ] [Pencarian Biner (video)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [Pencarian Biner (video)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [detail](https://www.topcoder.com/community/competitive-programming/tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Implementkan:
|
||||
- pencarian biner (pada susunan bilangan bulat yang diurutkan)
|
||||
- pencarian biner menggunakan rekursi
|
||||
|
|
@ -649,6 +626,9 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s
|
|||
- dalam urutan (DFS: kiri, sendiri/self, kanan)
|
||||
- pasca urutan (DFS: kiri, kanan, sendiri/self)
|
||||
- pra urutan (DFS: sendiri/self, kiri, kanan)
|
||||
- [ ] [[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
|
||||
- [ ] [Ulasan Binary Search Tree (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -699,9 +679,10 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s
|
|||
- [ ] [MIT: Heaps dan Heap Sort (video)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B Kuliah 24: Antrian Prioritas (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)
|
||||
- [ ] Menerapkan sebuah max-heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - dibutuhkan untuk memasukkan
|
||||
- [ ] sift_up - digunakan untuk memasukkan
|
||||
- [ ] get_max - mengembalikan item maksimal, tanpa menghapusnya
|
||||
- [ ] get_size() - mengembalikan jumlah elemen yang disimpan
|
||||
- [ ] is_empty() - mengembalikan nilai true jika heap tidak berisi elemen
|
||||
|
|
@ -763,6 +744,14 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s
|
|||
- [ ] [Implementasi (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c)
|
||||
- [ ] [Implementasi (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)
|
||||
|
||||
- [ ] Implementasi:
|
||||
- [ ] Mergesort: O(n log n) rata-rata dan kasus terburuk
|
||||
- [ ] Quicksort: O(n log n) kasus rata-rata
|
||||
|
|
@ -826,6 +815,8 @@ Graf (Graphs) dapat digunakan untuk merepresentasikan banyak masalah dalam ilmu
|
|||
- [ ] [CS 61B 2014: Graphs berbobot (video)](https://archive.org/details/ucberkeley_webcast_zFbq8vOZ_0k)
|
||||
- [ ] [Algoritma Serakah: Minimum Spanning Tree (video)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||
- [ ] [Komponen yang Sangat Terhubung Algoritma Graphs Algoritma Kosaraju (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)
|
||||
|
||||
- Kursus Coursera Penuh:
|
||||
- [ ] [Algoritma pada Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -1209,8 +1200,9 @@ Graf (Graphs) dapat digunakan untuk merepresentasikan banyak masalah dalam ilmu
|
|||
|
||||
- [ ] Seri video subjek pendek berdurasi 2-3 menit (23 video)
|
||||
- [Video](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Seri video subjek pendek berdurasi 2-5 menit - Michael Sambol (18 video):
|
||||
- [Video](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] Seri video subjek pendek berdurasi 2-5 menit - Michael Sambol (48 video):
|
||||
- [Video](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
- [ ] [Video Sedgewick - Algoritma I](https://www.coursera.org/learn/algorithms-part1)
|
||||
- [ ] [Video Sedgewick - Algoritma II](https://www.coursera.org/learn/algorithms-part2)
|
||||
|
||||
|
|
@ -1244,7 +1236,6 @@ Tambahan:
|
|||
- [Matematika untuk Topcoders](https://www.topcoder.com/community/competitive-programming/tutorials/mathematics-for-topcoders/)
|
||||
- [Pemrograman Dinamis - Dari Pemula hingga Mahir](https://www.topcoder.com/community/competitive-programming/tutorials/dynamic-programming-from-novice-to-advanced/)
|
||||
- [Materi Wawancara MIT](https://web.archive.org/web/20160906124824/http://courses.csail.mit.edu/iap/interview/materials.php)
|
||||
- [Latihan untuk menjadi lebih baik pada bahasa tertentu](http://exercism.io/languages)
|
||||
|
||||
**Baca dan Lakukan Masalah Pemrograman (dalam urutan ini):**
|
||||
|
||||
|
|
@ -1296,7 +1287,7 @@ Repo tantangan:
|
|||
- [Tantangan Interview Coding Interaktif dengan Python](https://github.com/donnemartin/interactive-coding-challenges)
|
||||
|
||||
Wawancara Mock:
|
||||
- [Gainlo.co: Mock pewawancara dari perusahaan besar](http://www.gainlo.co/) - Saya menggunakan ini dan itu membantu saya bersantai untuk layar ponsel dan wawancara di tempat
|
||||
- [Gainlo.co: Mock pewawancara dari perusahaan besar](http://www.gainlo.co/#!/) - Saya menggunakan ini dan itu membantu saya bersantai untuk layar ponsel dan wawancara di tempat
|
||||
- [Pramp: Wawancara mengejek dari / dengan teman sebaya](https://www.pramp.com/) - model wawancara praktik peer-to-peer
|
||||
- [Refdash: Wawancara tiruan dan wawancara yang dipercepat](https://refdash.com/) - juga membantu kandidat mempercepat dengan melewatkan beberapa wawancara dengan perusahaan teknologi
|
||||
- [interviewing.io: Berlatih wawancara tiruan dengan insinyur senior](https://interviewing.io) - wawancara desain algoritme / sistem tanpa nama dengan insinyur senior dari FAANG secara anonim.
|
||||
|
|
@ -1615,6 +1606,7 @@ Anda tidak pernah benar-benar selesai.
|
|||
- [AVL Trees (video)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
||||
- [Implementasi AVL Tree (video)](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation)
|
||||
- [Split Dan 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**
|
||||
- Dalam praktek:
|
||||
|
|
@ -1634,7 +1626,8 @@ Anda tidak pernah benar-benar selesai.
|
|||
- [Aduni - Algoritma - Kuliah 4 (link lompat ke titik awal) (video)](https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871)
|
||||
- [Aduni - Algoritma - Kuliah 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)
|
||||
- [Pengantar Pencarian Biner Dan Red-Black Tree](https://www.topcoder.com/community/competitive-programming/tutorials/an-introduction-to-binary-search-and-red-black-trees/)
|
||||
- [Pengantar Pencarian Biner Dan 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 search trees**
|
||||
- Dalam praktek:
|
||||
|
|
@ -1674,6 +1667,7 @@ Anda tidak pernah benar-benar selesai.
|
|||
- [MIT 6.851 - Model Hirarki Memori (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
|
||||
|
|
@ -1718,7 +1712,10 @@ Anda tidak pernah benar-benar selesai.
|
|||
- [Bagilah & Taklukkan: Convex Hull, Median Finding](https://www.youtube.com/watch?v=EzeYI7p9MjU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=2)
|
||||
|
||||
- ### Matematika diskrit
|
||||
- lihat video di bawah ini
|
||||
- Apa itu Matematika Diskrit?
|
||||
- [Perkenalan Matematika Diskrit](https://www.youtube.com/watch?v=p2b2Vb-cYCs)
|
||||
- Kuliah Gratis Matematika Diskrit
|
||||
- [Kuliah Gratis Matematika Diskrit *CS 70: Discrete Mathematics and Probability Theory (Spring 2015, UC Berkeley)*()](http://www.infocobuild.com/education/audio-video-courses/computer-science/CS70-Spring2015-Berkeley/lecture-01.html)
|
||||
|
||||
- ### Pembelajaran Mesin (Machine Learning)
|
||||
- Kenapa ML?
|
||||
|
|
@ -1952,3 +1949,4 @@ Terjemahan Bahasa Indonesia dipersembahkan oleh
|
|||
- @[hwhung0111](https://github.com/hwhung0111)
|
||||
- @[fahminlb33](https://github.com/fahminlb33)
|
||||
- @[davidsetyanugraha](https://github.com/davidsetyanugraha)
|
||||
- @[afrizal0](https://github.com/afrizal0)
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
|
|
@ -17,34 +17,40 @@
|
|||
<details>
|
||||
<summary>ការបកប្រែ៖</summary>
|
||||
|
||||
- [ភាសារចិន - 中文版本](translations/README-cn.md)
|
||||
- [ភាសារវៀតណាម - Tiếng Việt - Vietnamese](translations/README-vi.md)
|
||||
- [ភាសារអេស្ប៉ាញ - Español](translations/README-es.md)
|
||||
- [ភាសារព័រទុយហ្កាល់ - Português Brasileiro](translations/README-ptbr.md)
|
||||
- [ភាសារប៉ូឡូញ - Polish](translations/README-pl.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>ភាសារដែលកំពុងបកប្រែ:</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)
|
||||
- [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">
|
||||
|
|
@ -52,35 +58,6 @@
|
|||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -245,7 +222,6 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
|
||||
- [ ] [ABC: តែងតែសរសេរកូដ](https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.4heg8zvm4)
|
||||
- [ ] [ការប្រេីប្រាស់ក្តារខៀន](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1)
|
||||
- [ ] [ការប្រេីប្រាស់ក្តារខៀនមានប្រសិទ្ធិភាពក្នុងពេលសម្ភាសន៍កម្មវិធី](http://www.coderust.com/blog/2014/04/10/effective-whiteboarding-during-programming-interviews/)
|
||||
- [ ] [ជ្រើសរើសបុគ្គលិកជំនាញបច្ចេកវិទ្យា](https://www.youtube.com/watch?v=N233T0epWTs)
|
||||
- [ ] វិធីរកការងារនៅក្រុមហ៊ុនធំ ៤៖
|
||||
- [ ] [របៀបរកការងារធ្វើនៅក្រុមហ៊ុនធំ ៤ - Amazon, Facebook, Google និង Microsoft (មានវីដេអូ)](https://www.youtube.com/watch?v=YJZCUhxNCv8)
|
||||
|
|
@ -527,6 +503,7 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
- [ភាពស្មុគស្មាញនៃការគណនា៖ ផ្នែកទី ១](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/)
|
||||
- [ភាពស្មុគស្មាញនៃការគណនា៖ ផ្នែកទី ២](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/)
|
||||
- [ ] [សន្លឹកជំនួយ](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -537,13 +514,9 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
- អនុវត្តវ៉ិចទ័រប្តូរទំហំដោយស្វ័យប្រវត្តិ។
|
||||
- [ ] ការពិពណ៌នា៖
|
||||
- [Arrays (វីដេអូ)](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays)
|
||||
-[UC Berkeley CS61B - អារេ លីនែអ៊ែរ និង ពហុវិមាត្រ (វីដេអូ)](https://archive.org/details/ucberkeley_webcast_Wp8oiO_CZZE) (ចាប់ផ្តើមមើលចាប់ពី ១៥នាទី ៣២វិនាទី)
|
||||
- [Arrays មូលដ្ឋាន (វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/02_04-basicArrays.mp4)
|
||||
- [ពហុវិមាត្រ (វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/02_05-multidimensionalArrays.mp4)
|
||||
- [UC Berkeley CS61B - អារេ លីនែអ៊ែរ និង ពហុវិមាត្រ (វីដេអូ)](https://archive.org/details/ucberkeley_webcast_Wp8oiO_CZZE) (ចាប់ផ្តើមមើលចាប់ពី ១៥នាទី ៣២វិនាទី)
|
||||
- [Arrays ឌីណាមិចេ (វីដេអូ)](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays)
|
||||
- [Jagged Arrays (វីដេអូ)](https://www.youtube.com/watch?v=1jtrQqYpt7g)
|
||||
- [Jagged Arrays (វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/02_06-jaggedArrays.mp4)
|
||||
- [ការប្តូរទំហំ Arrays (វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/03_01-resizableArrays.mp4)
|
||||
- [ ] អនុវត្តវ៉ិចទ័រ (បំលែង Arrays ដោយប្តូរទំហំស្វ័យប្រវត្តិ)៖
|
||||
- [ ] អនុវត្តការសរសេរកូដដោយប្រើArrays និង ទ្រនិចចង្អុល និង គណិតទ្រនិចដើម្បីលោតទៅសន្ទស្សន៍មួយ។
|
||||
- [ ] Arrays ទិន្នន័យថ្មីដែលមានអង្គចងចាំបម្រុងទុក
|
||||
|
|
@ -577,6 +550,7 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
- [ ] [Singly Linked Lists (វីដេអូ)](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists)
|
||||
- [ ] [CS 61B - Linked Lists ១ (វីដេអូ)](https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0)
|
||||
- [ ] [CS 61B - Linked Lists ២ (វីដេអូ)](https://archive.org/details/ucberkeley_webcast_-c4I3gFYe3w)
|
||||
- [ ] [[Review] Linked lists in 4 minutes (video)](https://youtu.be/F8AbOfQwl1c)
|
||||
- [ ] [កូដ C (វីដេអូ)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
|
||||
- មិនមែនវីដេអូទាំងមូលទេគឺគ្រាន់តែជាផ្នែកអំពីរចនាសម្ព័ន្ធ (Data Structure) និងការបែងចែក Memory ។
|
||||
- [ ] Linked List vs Arrays:
|
||||
|
|
@ -610,14 +584,13 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
|
||||
- ### Stack
|
||||
- [ ] [Stack (វីដេអូ)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [ការប្រើ Stack ចូលមុនចេញក្រោយ (វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/05_01-usingStacksForLast-inFirst-out.mp4)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] នឹងមិនអនុវត្តទេ។ ការអនុវត្តជាមួយ Array គឺមិនសំខាន់។
|
||||
|
||||
- ### Queue
|
||||
- [ ] [ការប្រើ Queue ចូលមុនចេញមុន(វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/05_03-usingQueuesForFirst-inFirst-out.mp4)
|
||||
- [ ] [Queue (វីដេអូ)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [Queue អាទិភាព (វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/05_04-priorityQueuesAndDeques.mp4)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] ប្រើ linked-list ដែលមានភ្ជាប់ជាមួយទ្រនិចនៅកន្ទុយ៖
|
||||
- enqueue(តម្លៃ) - បន្ថែមតម្លៃនៅទីតាំងនៅកន្ទុយ
|
||||
- dequeue() - ត្រឡប់តម្លៃនិងយកធាតុដែលបានបន្ថែមថ្មីៗចេញ (ផ្នែកខាងមុខ)
|
||||
|
|
@ -642,12 +615,9 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
- [ ] [PyCon 2010: វចនានុក្រមដ៏អស្ចារ្យ (វីដេអូ)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
|
||||
- [ ] [(កម្រិតខ្ពស់) Randomization: Universal & Perfect Hashing (វីដេអូ)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(ជឿនលឿន) Perfect hashing (វីដេអូ)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4)
|
||||
- [ ] [[Review] Hash tables in 4 minutes (video)](https://youtu.be/knV86FlSXJ8)
|
||||
|
||||
- [ ] វគ្គសិក្សាអនឡាញ៖
|
||||
- [ ] [ស្វែងយល់អំពីមុខងារ Hash (វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/06_02-understandingHashFunctions.mp4)
|
||||
- [ ] [ការប្រើតារាងHash (វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/06_03-usingHashTables.mp4)
|
||||
- [ ] [គាំទ្រ Hash (វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/06_04- ឧបត្ថម្ភគាំទ្រហាន់ឌ្រី)
|
||||
- [ ] [តារាងជំនួយភាសា Hash(វីដេអូ)](https://archive.org/details/0102WhatYouShouldKnow/06_05-languageSupportForHashTables.mp4)
|
||||
- [ ] [Core Hash Tables (វីដេអូ)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables)
|
||||
- [ ] [រចនាសម្ព័ន្ធទិន្នន័យ (វីដេអូ)](https://www.coursera.org/learn/data-structures/home/week/4)
|
||||
- [ ] [បញ្ហាសៀវភៅទូរស័ព្ទ (វីដេអូ)](https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem)
|
||||
|
|
@ -671,6 +641,7 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
- [ ] [Binary search (វីដេអូ)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [Binary search (វីដេអូ)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [លម្អិត](https://www.topcoder.com/community/competitive-programming/tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] អនុវត្ត៖
|
||||
- Binary search (នៅលើជួរអារេនៃចំនួនគត់)
|
||||
- Binary search ដោយប្រើការហៅខ្លួនឯង
|
||||
|
|
@ -725,6 +696,9 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
- inorder (DFS: ឆ្វេង, ខ្លួនឯង, ស្តាំ)
|
||||
- postorder (DFS: ឆ្វេង, ស្តាំ, ខ្លួនឯង)
|
||||
- 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 (វីដេអូ)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -772,6 +746,7 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
- [ ] [MIT: Heaps និង Heap Sort (វីដេអូ)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B មេរៀន 24: Priority Queues (វីដេអូ)](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)
|
||||
- [ ] ការអនុវត្ត max-heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - ត្រូវការសំរាប់បញ្ចូល
|
||||
|
|
@ -839,6 +814,14 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់
|
|||
- [ ] [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)
|
||||
|
||||
- [ ] អនុវត្ត:
|
||||
- [ ] Mergesort: O(n log n) ករណីមធ្យម និង អាក្រក់បំផុត
|
||||
- [ ] Quicksort O(n log n) ករណីមធ្យម
|
||||
|
|
@ -904,6 +887,8 @@ Graphs អាចត្រូវបានប្រើដើម្បីបង្
|
|||
- [ ] [CS 61B 2014: Weighted graphs (វីដេអូ)](https://archive.org/details/ucberkeley_webcast_zFbq8vOZ_0k)
|
||||
- [ ] [Greedy Algorithms: Minimum Spanning Tree (វីដេអូ)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||
- [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (វីដេអូ)](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)
|
||||
|
||||
- វគ្គសិក្សា Coursera:
|
||||
- [ ] [Algorithms on Graphs (វីដេអូ)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -1288,8 +1273,9 @@ Graphs អាចត្រូវបានប្រើដើម្បីបង្
|
|||
|
||||
- [ ] Series of 2-3 minutes short subject videos (23 វីដេអូ)
|
||||
- [វីដេអូ](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (18 វីដេអូ):
|
||||
- [វីដេអូ](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 វីដេអូ):
|
||||
- [វីដេអូ](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
- [ ] [វីដេអូ Sedgewick - Algorithms I](https://www.coursera.org/learn/algorithms-part1)
|
||||
- [ ] [វីដេអូ Sedgewick - Algorithms II](https://www.coursera.org/learn/algorithms-part2)
|
||||
|
||||
|
|
@ -1322,7 +1308,6 @@ Graphs អាចត្រូវបានប្រើដើម្បីបង្
|
|||
- [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)
|
||||
|
||||
**អាននិងធ្វើបញ្ហាកម្មវិធី (តាមលំដាប់លំដោយ):**
|
||||
|
||||
|
|
@ -1375,7 +1360,7 @@ Challenge repos:
|
|||
- [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/) - I used this and it helped me relax for the phone screen and on-site interview
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/) - I used this and it helped me relax for the phone screen and on-site interview
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/) - peer-to-peer model of practice interviews
|
||||
- [Refdash: Mock interviews and expedited interviews](https://refdash.com/) - also help candidates fast track by skipping multiple interviews with tech companies
|
||||
- [interviewing.io: Practice mock interview with senior engineers](https://interviewing.io) - anonymous algorithmic/systems design interviews with senior engineers from FAANG anonymously.
|
||||
|
|
@ -1696,6 +1681,7 @@ Mock Interviews:
|
|||
- [AVL Trees (វីដេអូ)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
||||
- [AVL Tree Implementation (វីដេអូ)](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**
|
||||
- ក្នុងការអនុវត្ត ៖
|
||||
|
|
@ -1718,7 +1704,8 @@ Mock Interviews:
|
|||
- [Aduni - Algorithms - Lecture 4 (តំណភ្ជាប់លោតទៅចំណុចចាប់ផ្តើម) (វីដេអូ)](https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871)
|
||||
- [Aduni - Algorithms - Lecture 5 (វីដេអូ)](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 search trees**
|
||||
- ក្នុងការអនុវត្ត ៖
|
||||
|
|
@ -1758,6 +1745,7 @@ Mock Interviews:
|
|||
- [MIT 6.851 - Memory Hierarchy Models (វីដេអូ)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
- រៀនពី cache-oblivious B-Trees, data structures
|
||||
- ៣៧ នាទីដំបូងគឺបច្ចេកទេសហើយប្រហែលជាអាចរំលងចោល (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
|
||||
|
|
@ -1822,7 +1810,6 @@ Mock Interviews:
|
|||
- [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 សំរាប់ 2 ខែ)](http://www.thisismetis.com/explore-data-science)
|
||||
- ធនធាន:
|
||||
- សៀវភៅ:
|
||||
- [Python Machine Learning](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/)
|
||||
|
|
|
|||
|
|
@ -47,45 +47,15 @@
|
|||
- [우르두어](https://github.com/jwasham/coding-interview-university/issues/140)
|
||||
- [태국어](https://github.com/jwasham/coding-interview-university/issues/156)
|
||||
- [그리스어](https://github.com/jwasham/coding-interview-university/issues/166)
|
||||
- [이탈리아어](https://github.com/jwasham/coding-interview-university/issues/170)
|
||||
- [말라얄람어](https://github.com/jwasham/coding-interview-university/issues/239)
|
||||
|
||||
</details>
|
||||
|
||||
<div align="center">
|
||||
<hr />
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -111,7 +81,7 @@
|
|||
- [이건 대체 뭐하는 건가요?](#이건-대체-뭐하는-건가요)
|
||||
- [이걸 왜 해야하죠?](#이걸-왜-해야하죠)
|
||||
- [어떻게 하면 되나요?](#어떻게-하면-되나요)
|
||||
- [머리가 나쁘다고 자책하지 마세요](#-머리가-나쁘다고-자책하지-마세요)
|
||||
- [머리가 나쁘다고 자책하지 마세요](#머리가-나쁘다고-자책하지-마세요)
|
||||
- [영상 자료에 관하여](#영상-자료에-관하여)
|
||||
- [프로그래밍 언어 선택하기](#프로그래밍-언어-선택하기)
|
||||
- [자료구조와 알고리즘에 대한 도서](#자료구조와-알고리즘에-대한-도서)
|
||||
|
|
@ -132,12 +102,12 @@
|
|||
- [큐](#큐)
|
||||
- [해시 테이블](#해시-테이블)
|
||||
- [추가 지식](#추가-지식)
|
||||
- [이진 탐색/이진 검색](#binary-search)
|
||||
- [비트 연산](#bitwise-operations)
|
||||
- [이진 탐색/이진 검색](#이진-탐색)
|
||||
- [비트 연산](#비트-연산)
|
||||
- [트리](#트리)
|
||||
- [트리 - 배경지식](#trees---notes--background)
|
||||
- [이진 탐색 트리(BST)](#binary-search-trees-bsts)
|
||||
- [힙 / 우선순위 큐 / 이진 힙](#heap--priority-queue--binary-heap)
|
||||
- [트리 - 배경 지식](#트리---배경-지식)
|
||||
- [이진 탐색 트리 (BST)](#이진-탐색-트리-BST)
|
||||
- [힙 / 우선순위 큐 / 이진 힙](#힙--우선순위-큐--이진-힙)
|
||||
- 균형 탐색 트리 (간단한 개념)
|
||||
- 트리 순회: 전위 순회, 중위 순회, 후위 순회, 너비 우선 탐색(BFS), 깊이 우선 탐색(DFS)
|
||||
- [정렬](#정렬)
|
||||
|
|
@ -152,27 +122,25 @@
|
|||
- 인접 행렬
|
||||
- 인접 리스트
|
||||
- 그래프 순회: 너비 우선 탐색(BFS), 깊이 우선 탐색(DFS)
|
||||
- [더 많은 지식](#even-more-knowledge)
|
||||
- [재귀](#recursion)
|
||||
- [동적 프로그래밍](#dynamic-programming)
|
||||
- [객체 지향 프로그래밍](#object-oriented-programming)
|
||||
- [디자인 패턴](#design-patterns)
|
||||
- [조합 & 확률](#combinatorics-n-choose-k--probability)
|
||||
- [NP와 NP-완전, 그리고 근사 알고리즘](#np-np-complete-and-approximation-algorithms)
|
||||
- [캐시](#caches)
|
||||
- [프로세스와 쓰레드](#processes-and-threads)
|
||||
- [더 많은 지식](#더-많은-지식)
|
||||
- [재귀 (recursion)](#재귀-recursion)
|
||||
- [동적 프로그래밍 (Dynamic Programming)](#동적-프로그래밍-Dynamic-Programming)
|
||||
- [디자인-패턴](#디자인-패턴)
|
||||
- [조합과 확률](#조합과-확률)
|
||||
- [NP, NP-완전, 근사 알고리즘](#NP-NP-완전-근사-알고리즘)
|
||||
- [컴퓨터가 프로그램을 처리하는 방식](#컴퓨터가-프로그램을-처리하는-방식)
|
||||
- [캐시](#캐시)
|
||||
- [프로세스와 쓰레드](#프로세스와-쓰레드)
|
||||
- [테스트](#테스트)
|
||||
- [스케줄링](#scheduling)
|
||||
- [시스템 루틴의 구현](#implement-system-routines)
|
||||
- [문자열 검색 & 조작](#string-searching--manipulations)
|
||||
- [트라이](#tries)
|
||||
- [부동 소수점](#floating-point-numbers)
|
||||
- [유니코드](#unicode)
|
||||
- [문자열 검색 & 조작](#문자열-검색--조작)
|
||||
- [트라이](#트라이)
|
||||
- [부동 소수점](#부동-소수점)
|
||||
- [유니코드](#유니코드)
|
||||
- [엔디언(Endianness)](#endianness)
|
||||
- [네트워크](#networking)
|
||||
- [네트워크](#네트워크)
|
||||
- [최종 검토](#최종-검토)
|
||||
|
||||
### 직업 구하기
|
||||
### 구직 & 취업하기
|
||||
|
||||
- [면접이 얼마 남지 않았을 때](#면접이-얼마-남지-않았을-때)
|
||||
- [이력서](#이력서)
|
||||
|
|
@ -563,6 +531,7 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
- [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/)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
## 자료구조
|
||||
|
||||
|
|
@ -571,12 +540,8 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
- [ ] 설명:
|
||||
- [배열 (영상)](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays)
|
||||
- [UCBerkley CS61B - 선형과 다차원 배열 (영상)](https://youtu.be/Wp8oiO_CZZE?t=15m32s)
|
||||
- [배열 기본 (영상)](https://archive.org/details/0102WhatYouShouldKnow/02_04-basicArrays.mp4)
|
||||
- [다차원 배열 (영상)](https://archive.org/details/0102WhatYouShouldKnow/02_05-multidimensionalArrays.mp4)
|
||||
- [동적 배열 (영상)](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays)
|
||||
- [가변 배열 (영상)](https://www.youtube.com/watch?v=1jtrQqYpt7g)
|
||||
- [가변 배열 (영상)](https://archive.org/details/0102WhatYouShouldKnow/02_06-jaggedArrays.mp4)
|
||||
- [배열 리사이징 (영상)](https://archive.org/details/0102WhatYouShouldKnow/03_01-resizableArrays.mp4)
|
||||
- [ ] 벡터 구현하기 (자동 리사이징을 포함한 동적 배열):
|
||||
- [ ] 배열, 포인터 및 인덱싱 대신하여 특정 인덱스에 접근하는 포인터 연산을 통한 코딩 연습
|
||||
- [ ] 메모리 할당을 포함한 새 배열
|
||||
|
|
@ -608,6 +573,7 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
- [ ] [단일 연결 리스트 (영상)](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists)
|
||||
- [ ] [CS 61B - 연결 리스트 1 (영상)](https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0)
|
||||
- [ ] [CS 61B - 연결 리스트 2 (영상)](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)
|
||||
- 전체 영상은 아니고, 노드 구조와 메모리 할당에 대한 부분입니다.
|
||||
- [ ] 연결 리스트 vs 배열:
|
||||
|
|
@ -619,34 +585,33 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
이 페이지는 포인터가 포인터를 가리키는 것을 파악하는 정도입니다. 저는 아래 목록을 순서대로 읽지 않기를 권장합니다. 가독성과 유지 보수성이 더 좋기 때문입니다.
|
||||
- [Pointers to Pointers](https://www.eskimo.com/~scs/cclass/int/sx8.html)
|
||||
- [ ] 구현 (저는 tail 포인터가 있는 것과 없는 것 모두 구현했었습니다.):
|
||||
- [ ] 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
|
||||
- [ ] size() - 리스트 안의 데이터 개수를 반환한다.
|
||||
- [ ] empty() - 리스트가 비어있다면 true를 반환한다.
|
||||
- [ ] value_at(index) - index번째 위치의 value을 반환한다. (가장 앞은 0부터 시작한다.)
|
||||
- [ ] push_front(value) - 가장 앞에 value를 추가한다.
|
||||
- [ ] pop_front() - 가장 앞에 있는 것을 제거하고, 그 value를 반환한다.
|
||||
- [ ] push_back(value) - 가장 끝에 value을 추가한다.
|
||||
- [ ] pop_back() - 가장 끝에 있는 것을 제거하고, 그 value를 반환한다.
|
||||
- [ ] front() - 가장 앞에 있는 것의 value를 가져온다.
|
||||
- [ ] back() - 가장 끝에 있는 것의 value를 가져온다.
|
||||
- [ ] insert(index, value) - index번째 위치에 value를 추가한다. 즉, index번째에 새로 추가된 것이 기존의 index번째에 있던 것을 가리킨다.
|
||||
- [ ] erase(index) - index번째에 있는 노드를 삭제한다.
|
||||
- [ ] value_n_from_end(n) - 뒤에서부터 n번째에 있는 노드의 value를 반환한다.
|
||||
- [ ] reverse() - 리스트를 뒤집는다.
|
||||
- [ ] remove_value(value) - value와 같은 값을 가지는 첫 번째 노드를 제거한다.
|
||||
- [ ] 이중 연결 리스트
|
||||
- [설명 (영상)](https://www.coursera.org/learn/data-structures/lecture/jpGKD/doubly-linked-lists)
|
||||
- 구현할 필요는 없습니다.
|
||||
|
||||
- ### 스택
|
||||
- [ ] [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.
|
||||
|
||||
- ### 큐
|
||||
- [ ] [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)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)05_04-priorityQueuesAndDeques.mp4)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] tail 포인터가 있는 연결 리스트를 사용하여 구현하기:
|
||||
- enqueue(value) - tail이 가리키는 곳에 value를 추가한다
|
||||
- dequeue() - value를 반환하고 가장 최근에 추가된 원소(front)를 제거한다.
|
||||
|
|
@ -671,12 +636,9 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
- [ ] [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)
|
||||
|
||||
- [ ] 온라인 강의들:
|
||||
- [ ] [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)
|
||||
|
|
@ -693,15 +655,16 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
|
||||
## 추가 지식
|
||||
|
||||
- ### 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)
|
||||
- [ ] [자세한 내용](https://www.topcoder.com/community/competitive-programming/tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] 구현:
|
||||
- (정수가 정렬된 배열에서) 이진 탐색
|
||||
- 재귀를 사용한 이진 탐색
|
||||
|
||||
- ### Bitwise operations
|
||||
- ### 비트 연산
|
||||
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
|
||||
- [ ] 비트 연산자(&, |, ^, ~, >>, <<) 제대로 이해하기
|
||||
- [ ] [워드](https://en.wikipedia.org/wiki/Word_(computer_architecture))
|
||||
|
|
@ -729,7 +692,7 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
|
||||
## 트리
|
||||
|
||||
- ### Trees - Notes & Background
|
||||
- ### 트리 - 배경 지식
|
||||
- [ ] [Series: Trees (video)](https://www.coursera.org/learn/data-structures/lecture/95qda/trees)
|
||||
- 트리 기초 형태 만들기
|
||||
- 순회
|
||||
|
|
@ -749,11 +712,12 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
- 중위(inorder) (DFS: 왼쪽, 자신, 오른쪽)
|
||||
- 후위(postorder) (DFS: 왼쪽, 오른쪽, 자신)
|
||||
- 전위(preorder) (DFS: 자신, 왼쪽, 오른쪽)
|
||||
- [ ] [[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
|
||||
- ### 이진 탐색 트리 (BST)
|
||||
- [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
- [ ] [Series (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/p82sw/core-introduction-to-binary-search-trees)
|
||||
- starts with symbol table and goes through BST applications
|
||||
- [ ] [Introduction (video)](https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction)
|
||||
- [ ] [MIT (video)](https://www.youtube.com/watch?v=9Jry5-82I68)
|
||||
- C/C++:
|
||||
|
|
@ -780,7 +744,7 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
- [ ] delete_value
|
||||
- [ ] get_successor // 값이 주어지면, 다음으로 가장 큰 값을, 없으면 -1을 반환
|
||||
|
||||
- ### Heap / Priority Queue / Binary Heap
|
||||
- ### 힙 / 우선순위 큐 / 이진 힙
|
||||
- 트리처럼 보여지지만, 보통은 선형으로 저장됩니다. (배열, 링크드리스트처럼)
|
||||
- [ ] [힙(Heap)](https://en.wikipedia.org/wiki/Heap_(data_structure))
|
||||
- [ ] [소개 (영상)](https://www.coursera.org/learn/data-structures/lecture/2OpTs/introduction)
|
||||
|
|
@ -796,6 +760,7 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
- [ ] [MIT: 힙과 힙 정렬 (영상)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B Lecture 24: 우선순위 큐 (영상)](https://archive.org/details/ucberkeley_webcast_yIUFT6AKBGE)
|
||||
- [ ] [선형 시간에 힙 만들기 (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)
|
||||
- [ ] max-heap 구현하기:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - `insert` 하려면 필요
|
||||
|
|
@ -861,6 +826,14 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
- [ ] [구현 (C언어)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c)
|
||||
- [ ] [구현 (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)
|
||||
|
||||
- [ ] 구현:
|
||||
- [ ] 병합 정렬: 평균과 최악의 경우 O(n log n)
|
||||
- [ ] 퀵 정렬: 평균적인 경우 O(n log n)
|
||||
|
|
@ -924,6 +897,8 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/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)
|
||||
|
||||
- Full Coursera Course:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -946,9 +921,9 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info
|
|||
|
||||
Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그래프 실습을 할 수 있습니다.
|
||||
|
||||
## Even More Knowledge
|
||||
## 더 많은 지식
|
||||
|
||||
- ### Recursion
|
||||
- ### 재귀 (recursion)
|
||||
- [ ] 재귀와 백트래킹에 대한 스탠포드 대학 강의:
|
||||
- [ ] [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)
|
||||
|
|
@ -959,7 +934,7 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- [ ] [꼬리 재귀가 무엇이고 왜 그게 좋지 않은지에 대하여](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad)
|
||||
- [ ] [꼬리 재귀 (영상)](https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1)
|
||||
|
||||
- ### Dynamic Programming
|
||||
- ### 동적 프로그래밍 (Dynamic Programming)
|
||||
- 인터뷰에서 DP 문제를 접하지 않을 수도 있습니다. 하지만 알고 있는게 미뤄두는 것 보다 낫습니다.
|
||||
- 이 주제는 아주 어렵습니다. DP로 풀리는 각 문제마다 어떤 점화식을 정의해야 하는데 그게 까다롭습니다.
|
||||
- 얽혀있는 패턴들을 확실히 이해할 때까지, 많은 DP 예시 문제들을 찾아보기를 권합니다.
|
||||
|
|
@ -985,14 +960,9 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- [ ] [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)
|
||||
|
||||
- ### Object-Oriented Programming
|
||||
- [ ] [Optional: UML 2.0 Series (video)](https://www.youtube.com/watch?v=OkC7HKtiZC0&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc)
|
||||
- [ ] SOLID OOP Principles:
|
||||
- [ ] [SOLID Principles (video)](https://www.youtube.com/playlist?list=PL4CE9F710017EA77A)
|
||||
|
||||
- ### Design patterns
|
||||
- ### 디자인 패턴
|
||||
- [ ] [Quick UML review (video)](https://www.youtube.com/watch?v=3cmzqZzwNDM&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc&index=3)
|
||||
- [ ] Learn these patterns:
|
||||
- [ ] 아래 패턴들을 배워봅시다:
|
||||
- [ ] strategy
|
||||
- [ ] singleton
|
||||
- [ ] adapter
|
||||
|
|
@ -1019,7 +989,7 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- [ ] [Handy reference: 101 Design Patterns & Tips for Developers](https://sourcemaking.com/design-patterns-and-tips)
|
||||
- [ ] [Design patterns for humans](https://github.com/kamranahmedse/design-patterns-for-humans#structural-design-patterns)
|
||||
|
||||
- ### Combinatorics (n choose k) & Probability
|
||||
- ### 조합과 확률
|
||||
- [ ] [Math Skills: How to find Factorial, Permutation and Combination (Choose) (video)](https://www.youtube.com/watch?v=8RRo6Ti9d0U)
|
||||
- [ ] [Make School: Probability (video)](https://www.youtube.com/watch?v=sZkAAk9Wwa4)
|
||||
- [ ] [Make School: More Probability and Markov Chains (video)](https://www.youtube.com/watch?v=dNaJg-mLobQ)
|
||||
|
|
@ -1029,7 +999,7 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- Just the videos - 41 (each are simple and each are short):
|
||||
- [ ] [Probability Explained (video)](https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19)
|
||||
|
||||
- ### NP, NP-Complete and Approximation Algorithms
|
||||
- ### NP, NP-완전, 근사 알고리즘
|
||||
- Know about the most famous classes of NP-complete problems, such as traveling salesman and the knapsack problem,
|
||||
and be able to recognize them when an interviewer asks you them in disguise.
|
||||
- Know what NP-complete means.
|
||||
|
|
@ -1050,7 +1020,15 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- [Jupyter Notebook](http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb)
|
||||
- Pages 1048 - 1140 in CLRS if you have it.
|
||||
|
||||
- ### Caches
|
||||
- ### 컴퓨터가 프로그램을 처리하는 방식
|
||||
|
||||
- [ ] [How CPU executes a program (video)](https://www.youtube.com/watch?v=XM4lGflQFvA)
|
||||
- [ ] [How computers calculate - ALU (video)](https://youtu.be/1I5ZMmrOfnA)
|
||||
- [ ] [Registers and RAM (video)](https://youtu.be/fpnE6UAfbtU)
|
||||
- [ ] [The Central Processing Unit (CPU) (video)](https://youtu.be/FZGugFqdr60)
|
||||
- [ ] [Instructions and Programs (video)](https://youtu.be/zltgXvg6r3k)
|
||||
|
||||
- ### 캐시
|
||||
- [ ] LRU cache:
|
||||
- [ ] [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)
|
||||
|
|
@ -1059,24 +1037,24 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- [ ] [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-)
|
||||
|
||||
- ### Processes and Threads
|
||||
- ### 프로세스와 쓰레드
|
||||
- [ ] Computer Science 162 - Operating Systems (25 videos):
|
||||
- for processes and threads see videos 1-11
|
||||
- [Operating Systems and System Programming (video)](https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iBDyz-ba4yDskqMDY6A1w_c)
|
||||
- [What Is The Difference Between A Process And A Thread?](https://www.quora.com/What-is-the-difference-between-a-process-and-a-thread)
|
||||
- Covers:
|
||||
- Processes, Threads, Concurrency issues
|
||||
- difference between processes and threads
|
||||
- processes
|
||||
- threads
|
||||
- locks
|
||||
- mutexes
|
||||
- semaphores
|
||||
- monitors
|
||||
- how they work
|
||||
- deadlock
|
||||
- livelock
|
||||
- CPU activity, interrupts, context switching
|
||||
- 알아 두어야 할 것:
|
||||
- 프로세스, 쓰레드, 동시성 문제들
|
||||
- 프로세스와 쓰레드의 차이점
|
||||
- 프로세스
|
||||
- 쓰레드
|
||||
- 락(Locks)
|
||||
- 뮤텍스(Mutexes)
|
||||
- 세마포어(Semaphores)
|
||||
- Monitors
|
||||
- 각각이 어떻게 동작하는지?
|
||||
- 데드락(Deadlock)
|
||||
- 라이브락(Livelock)
|
||||
- CPU activity, 인터럽트(interrupts), 문맥 교환(context switching)
|
||||
- Modern concurrency constructs with multicore processors
|
||||
- [Paging, segmentation and virtual memory (video)](https://www.youtube.com/watch?v=LKe7xK0bF7o&list=PLCiOXwirraUCBE9i_ukL8_Kfg6XNv7Se8&index=2)
|
||||
- [Interrupts (video)](https://www.youtube.com/watch?v=uFKi2-J-6II&list=PLCiOXwirraUCBE9i_ukL8_Kfg6XNv7Se8&index=3)
|
||||
|
|
@ -1084,8 +1062,9 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- Thread resource needs (shares above (minus stack) with other threads in the same process but each has its own pc, stack counter, registers, and stack)
|
||||
- Forking is really copy on write (read-only) until the new process writes to memory, then it does a full copy.
|
||||
- Context switching
|
||||
- How context switching is initiated by the operating system and underlying hardware
|
||||
- How context switching is initiated by the operating system and underlying hardware?
|
||||
- [ ] [threads in C++ (series - 10 videos)](https://www.youtube.com/playlist?list=PL5jc9xFGsL8E12so1wlMS0r0hTQoJL74M)
|
||||
- [ ] [CS 377 Spring '14: Operating Systems from University of Massachusetts](https://www.youtube.com/playlist?list=PLacuG5pysFbDQU8kKxbUh4K5c1iL5_k7k)
|
||||
- [ ] concurrency in Python (videos):
|
||||
- [ ] [Short series on threads](https://www.youtube.com/playlist?list=PL1H1sBF1VAKVMONJWJkmUh6_p8g4F2oy1)
|
||||
- [ ] [Python Threads](https://www.youtube.com/watch?v=Bs7vPNbB9JM)
|
||||
|
|
@ -1110,11 +1089,7 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- [ ] [Tao Of Testing](http://jasonpolites.github.io/tao-of-testing/ch3-1.1.html)
|
||||
- [ ] [테스트 어떻게 작성하는지](http://jasonpolites.github.io/tao-of-testing/ch4-1.1.html)
|
||||
|
||||
- ### Scheduling
|
||||
- 운영체제(OS)에서 어떻게 동작하는지
|
||||
- 운영 체제 관련 영상들에서 알아보실 수 있습니다.
|
||||
|
||||
- ### String searching & manipulations
|
||||
- ### 문자열 검색 & 조작
|
||||
- [ ] [Sedgewick - Suffix Arrays (video)](https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays)
|
||||
- [ ] [Sedgewick - Substring Search (videos)](https://www.coursera.org/learn/algorithms-part2/home/week/4)
|
||||
- [ ] [1. Introduction to Substring Search](https://www.coursera.org/learn/algorithms-part2/lecture/n3ZpG/introduction-to-substring-search)
|
||||
|
|
@ -1126,7 +1101,7 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
|
||||
이 주제를 더 자세히 알고 싶으시다면, [몇몇 주제에 대한 세부사항](#몇몇-주제에-대한-세부사항)에서 "문자열 매칭" 섹션을 읽어보세요.
|
||||
|
||||
- ### Tries
|
||||
- ### 트라이
|
||||
- 트라이에는 여러 종류가 있다는 것을 유의하라. 어떤 건 접두사가 있는 데, 어떤 건 그렇지 않고 또 어떤 것은 경로 추적을 위해 비트 대신에 문자열을 사용한다.
|
||||
- 나는 코드만 읽었고, 구현은 안 했다.
|
||||
- [ ] [Sedgewick - Tries (3 videos)](https://www.coursera.org/learn/algorithms-part2/home/week/4)
|
||||
|
|
@ -1143,11 +1118,11 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- [ ] [Stanford Lecture (real world use case) (video)](https://www.youtube.com/watch?v=TJ8SkcUSdbU)
|
||||
- [ ] [MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through)](https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
|
||||
- ### Floating Point Numbers
|
||||
- ### 부동 소수점
|
||||
- [ ] simple 8-bit: [Representation of Floating Point Numbers - 1 (video - there is an error in calculations - see video description)](https://www.youtube.com/watch?v=ji3SfClm8TU)
|
||||
- [ ] 32 bit: [IEEE754 32-bit floating point binary (video)](https://www.youtube.com/watch?v=50ZYcZebIec)
|
||||
|
||||
- ### Unicode
|
||||
- ### 유니코드
|
||||
- [ ] [The Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets]( http://www.joelonsoftware.com/articles/Unicode.html)
|
||||
- [ ] [What Every Programmer Absolutely, Positively Needs To Know About Encodings And Character Sets To Work With Text](http://kunststube.net/encoding/)
|
||||
|
||||
|
|
@ -1158,7 +1133,7 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- Very technical talk for kernel devs. Don't worry if most is over your head.
|
||||
- The first half is enough.
|
||||
|
||||
- ### Networking
|
||||
- ### 네트워크
|
||||
- **만약 당신이 네트워크에 대한 경험이 있거나 operations engineer 또는 믿음직한 엔지니어가 되고 싶다면 받을 수 있는 질문들**
|
||||
- 즉, 알면 좋은 것들이다.
|
||||
- [ ] [Khan Academy](https://www.khanacademy.org/computing/computer-science/internet-intro)
|
||||
|
|
@ -1310,8 +1285,9 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
|
||||
- [ ] 2-3분 분량의 주제별 짧은 영상 시리즈 (23 videos)
|
||||
- [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] 2-5분 분량의 주제별 짧은 영상 시리즈 - Michael Sambol (18 videos):
|
||||
- [Videos](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] 2-5분 분량의 주제별 짧은 영상 시리즈 - 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)
|
||||
|
||||
|
|
@ -1345,7 +1321,6 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그
|
|||
- [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)
|
||||
|
||||
**읽고 프로그래밍 문제 풀기 (순서대로):**
|
||||
|
||||
|
|
@ -1401,7 +1376,7 @@ Challenge repos:
|
|||
|
||||
모의 면접:
|
||||
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/) - I used this and it helped me relax for the phone screen and on-site interview.
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/) - I used this and it helped me relax for the phone screen and on-site interview.
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/) - peer-to-peer model of practice interviews
|
||||
- [Refdash: Mock interviews and expedited interviews](https://refdash.com/) - also help candidates fast track by skipping multiple interviews with tech companies.
|
||||
- [interviewing.io: Practice mock interview with senior engineers](https://interviewing.io) - anonymous algorithmic/systems design interviews with senior engineers from FAANG anonymously.
|
||||
|
|
@ -1560,7 +1535,6 @@ Challenge repos:
|
|||
- [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.
|
||||
|
|
@ -1721,6 +1695,7 @@ Challenge repos:
|
|||
- [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:
|
||||
|
|
@ -1745,7 +1720,8 @@ Challenge repos:
|
|||
- [Aduni - Algorithms - Lecture 4 (link jumps to starting point) (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 search trees**
|
||||
- In practice:
|
||||
|
|
@ -1784,6 +1760,7 @@ Challenge repos:
|
|||
- [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
|
||||
- great for finding number of points in a rectangle or higher dimension object
|
||||
|
|
@ -1847,7 +1824,6 @@ Challenge repos:
|
|||
- [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)
|
||||
- 자료들:
|
||||
- Books:
|
||||
- [Python Machine Learning](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/)
|
||||
|
|
|
|||
|
|
@ -13,35 +13,40 @@
|
|||
|
||||
<details>
|
||||
<summary>Tłumaczenia:</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)
|
||||
- [Polish](https://github.com/mbiesiad/coding-interview-university/blob/master/translations/README-pl.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>Tłumaczenia w trakcie:</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)
|
||||
- [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">
|
||||
|
|
@ -49,38 +54,8 @@
|
|||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
## Co to jest?
|
||||
|
||||
To jest mój wielomiesięczny plan nauki od przejścia od programisty (samouka, bez dyplomu CS - informatyki) do inżyniera oprogramowania dla dużej firmy.
|
||||
|
|
@ -271,7 +246,6 @@ Czasami zajęcia nie są w sesji, więc musisz poczekać kilka miesięcy, więc
|
|||
|
||||
- [ ] [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)
|
||||
- [ ] 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)
|
||||
|
|
@ -515,6 +489,7 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr
|
|||
- [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/)
|
||||
- [ ] [Ściągawka](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
## Struktury danych
|
||||
|
||||
|
|
@ -523,12 +498,8 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr
|
|||
- [ ] Opis:
|
||||
- [Arrays (wideo)](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays)
|
||||
- [UC Berkeley CS61B - Linear and Multi-Dim Arrays (wideo)](https://archive.org/details/ucberkeley_webcast_Wp8oiO_CZZE) (Start watching from 15m 32s)
|
||||
- [Basic Arrays (wideo)](https://archive.org/details/0102WhatYouShouldKnow/02_04-basicArrays.mp4)
|
||||
- [Multi-dim (wideo)](https://archive.org/details/0102WhatYouShouldKnow/02_05-multidimensionalArrays.mp4)
|
||||
- [Dynamic Arrays (wideo)](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays)
|
||||
- [Jagged Arrays (wideo)](https://www.youtube.com/watch?v=1jtrQqYpt7g)
|
||||
- [Jagged Arrays (wideo)](https://archive.org/details/0102WhatYouShouldKnow/02_06-jaggedArrays.mp4)
|
||||
- [Resizing arrays (wideo)](https://archive.org/details/0102WhatYouShouldKnow/03_01-resizableArrays.mp4)
|
||||
- [ ] Zaimplementuj vector (mutable array z automatycznym zmienianiem rozmiaru):
|
||||
- [ ] 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
|
||||
|
|
@ -560,6 +531,7 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr
|
|||
- [ ] [Singly Linked Lists (wideo)](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists)
|
||||
- [ ] [CS 61B - Linked Lists 1 (wideo)](https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0)
|
||||
- [ ] [CS 61B - Linked Lists 2 (wideo)](https://archive.org/details/ucberkeley_webcast_-c4I3gFYe3w)
|
||||
- [ ] [[Review] Linked lists in 4 minutes (video)](https://youtu.be/F8AbOfQwl1c)
|
||||
- [ ] [C Code (wideo)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
|
||||
- not the whole video, just portions about Node struct and memory allocation.
|
||||
- [ ] Linked List vs Arrays:
|
||||
|
|
@ -591,14 +563,13 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr
|
|||
|
||||
- ### Stos
|
||||
- [ ] [Stacks (wideo)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [Using Stacks Last-In First-Out (wideo)](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.
|
||||
|
||||
- ### Kolejka
|
||||
- [ ] [Using Queues First-In First-Out(wideo)](https://archive.org/details/0102WhatYouShouldKnow/05_03-usingQueuesForFirst-inFirst-out.mp4)
|
||||
- [ ] [Queue (wideo)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [Priority Queues (wideo)](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)
|
||||
|
|
@ -623,12 +594,9 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr
|
|||
- [ ] [PyCon 2010: The Mighty Dictionary (wideo)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
|
||||
- [ ] [(Zaawansowane) Randomization: Universal & Perfect Hashing (wideo)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(Zaawansowane) Perfect hashing (wideo)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4)
|
||||
- [ ] [[Review] Hash tables in 4 minutes (video)](https://youtu.be/knV86FlSXJ8)
|
||||
|
||||
- [ ] Kursy online:
|
||||
- [ ] [Understanding Hash Functions (wideo)](https://archive.org/details/0102WhatYouShouldKnow/06_02-understandingHashFunctions.mp4)
|
||||
- [ ] [Using Hash Tables (wideo)](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 (wideo)](https://archive.org/details/0102WhatYouShouldKnow/06_05-languageSupportForHashTables.mp4)
|
||||
- [ ] [Core Hash Tables (wideo)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables)
|
||||
- [ ] [Data Structures (wideo)](https://www.coursera.org/learn/data-structures/home/week/4)
|
||||
- [ ] [Phone Book Problem (wideo)](https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem)
|
||||
|
|
@ -649,6 +617,7 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr
|
|||
- [ ] [Binary Search (wideo)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [Binary Search (wideo)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [detail](https://www.topcoder.com/community/competitive-programming/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
|
||||
|
|
@ -698,6 +667,9 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr
|
|||
- 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 - drzewa binarne
|
||||
- [ ] [Binary Search Tree Review (wideo)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -745,6 +717,7 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr
|
|||
- [ ] [MIT: Heaps and Heap Sort (wideo)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B Lecture 24: Priority Queues (wideo)](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)
|
||||
- [ ] Implement a max-heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - needed for insert
|
||||
|
|
@ -810,6 +783,14 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr
|
|||
- [ ] [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
|
||||
|
|
@ -873,7 +854,9 @@ Grafy mogą być wykorzystane do przedstawienia wielu problemów w informatyce,
|
|||
- [ ] [CS 61B 2014: Weighted graphs (wideo)](https://archive.org/details/ucberkeley_webcast_zFbq8vOZ_0k)
|
||||
- [ ] [Greedy Algorithms: Minimum Spanning Tree (wideo)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||
- [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (wideo)](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)
|
||||
|
||||
- Pełny kurs Coursera:
|
||||
- [ ] [Algorithms on Graphs (wideo)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
||||
|
|
@ -1262,8 +1245,9 @@ Trie to drzewo węzłów, które obsługuje operacje Znajdź i Wstaw [etc (...)]
|
|||
|
||||
- [ ] Seria 2-3 minutowych, krótkich filmów tematycznych (23 wideo)
|
||||
- [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Seria 2–5 minutowych, krótkich filmów tematycznych - Michael Sambol (18 wideo):
|
||||
- [Wideo](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] Seria 2–5 minutowych, krótkich filmów tematycznych - Michael Sambol (48 wideo):
|
||||
- [Wideo](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
- [ ] [Sedgewick Videos - Algorytmy I](https://www.coursera.org/learn/algorithms-part1)
|
||||
- [ ] [Sedgewick Videos - Algorytmy II](https://www.coursera.org/learn/algorithms-part2)
|
||||
|
||||
|
|
@ -1297,7 +1281,6 @@ Uzupełniające:
|
|||
- [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)
|
||||
|
||||
**Przeczytaj i wykonaj zadania z programowania (w tej kolejności):**
|
||||
|
||||
|
|
@ -1349,7 +1332,7 @@ Challenge repos:
|
|||
- [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/) - I used this and it helped me relax for the phone screen and on-site interview.
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/) - I used this and it helped me relax for the phone screen and on-site interview.
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/) - peer-to-peer model of practice interviews
|
||||
- [Refdash: Mock interviews and expedited interviews](https://refdash.com/) - also help candidates fast track by skipping multiple interviews with tech companies.
|
||||
|
||||
|
|
@ -1671,6 +1654,7 @@ Tak na prawdę nigdy nie skończyłeś.
|
|||
- [AVL Trees (wideo)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
||||
- [AVL Tree Implementation (wideo)](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:
|
||||
|
|
@ -1695,7 +1679,8 @@ Tak na prawdę nigdy nie skończyłeś.
|
|||
- [Aduni - Algorithms - Lecture 4 (link jumps to starting point) (wideo)](https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871)
|
||||
- [Aduni - Algorithms - Lecture 5 (wideo)](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 search trees**
|
||||
- In practice:
|
||||
|
|
@ -1736,6 +1721,7 @@ Tak na prawdę nigdy nie skończyłeś.
|
|||
- [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
|
||||
|
|
@ -1800,7 +1786,6 @@ Tak na prawdę nigdy nie skończyłeś.
|
|||
- [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/)
|
||||
|
|
|
|||
|
|
@ -17,63 +17,43 @@
|
|||
**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>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -199,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)
|
||||
|
|
@ -266,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)
|
||||
|
|
@ -544,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
|
||||
|
|
@ -556,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
|
||||
|
|
@ -593,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:
|
||||
|
|
@ -624,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))
|
||||
|
|
@ -656,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) )
|
||||
|
|
@ -682,6 +654,7 @@ 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
|
||||
|
|
@ -735,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)
|
||||
|
|
@ -782,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
|
||||
|
|
@ -811,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)
|
||||
|
|
@ -847,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
|
||||
|
|
@ -906,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)
|
||||
|
|
@ -973,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)
|
||||
|
|
@ -1350,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)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1410,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):**
|
||||
|
||||
|
|
@ -1450,7 +1392,7 @@ 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/)
|
||||
|
||||
|
|
@ -1562,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.
|
||||
|
|
@ -1724,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:
|
||||
|
|
@ -1749,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:
|
||||
|
|
@ -1788,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
|
||||
|
|
@ -1806,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)
|
||||
|
|
@ -1852,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)
|
||||
|
|
@ -2000,4 +1939,4 @@ Sente-se e aproveite. "Netflix e habilidade" :P
|
|||
## Cursos de Ciência da Computação
|
||||
|
||||
- [Diretório de Cursos Online de Ciência da Computação](https://github.com/open-source-society/computer-science)
|
||||
- [Diretório de Cursos Online de Ciência da Computação (muitos com aulas online)](https://github.com/prakhar1989/awesome-courses)
|
||||
- [Diretório de Cursos Online de Ciência da Computação (muitos com aulas online)](https://github.com/prakhar1989/awesome-courses)
|
||||
|
|
|
|||
|
|
@ -5,41 +5,7 @@
|
|||
<div align="center">
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Станьте спонсором</strong> и поддержите Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Особые благодарности:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Основанная в 2018, OSS Capital - первая и единственная венчурная платформа, ориентированная<br>исключительно для поддержки основателей стартапов на ранней стадии COSS (commercial open source - коммерческий открытый источник).</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Среды разработки, созданные для облачных сервисов</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>
|
||||
Изначально интегрированный с GitLab, GitHub и Bitbucket, Gitpod автоматически, продолжительно и предварительно собирает
|
||||
среды разработки всех ветвей (branches). В результате члены команды могут мгновенно приступить к написанию кода с новыми
|
||||
средами разработки для каждой новой задачи - независимо от того, создаете ли вы новую функцию (feature), хотите исправить ошибку
|
||||
или работаете над проверкой кода (code review).
|
||||
</sup>
|
||||
</div>
|
||||
</a>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
|
@ -313,7 +279,6 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [4 шага к Google без образования в CS](https://medium.com/always-be-coding/four-steps-to-google-without-a-degree-8f381aa6bd5e#.asalo1vfx)
|
||||
- [ ] [Кодирование на доске](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1)
|
||||
- [ ] [Что думает Google о найме, управлении и культуре](http://www.kpcb.com/blog/lessons-learned-how-google-thinks-about-hiring-management-and-culture)
|
||||
- [ ] [Эффективное кодирование на доске в процессе собеседования](http://www.coderust.com/blog/2014/04/10/effective-whiteboarding-during-programming-interviews/)
|
||||
- [ ] Прохождения собеседования по программированию набор 1:
|
||||
- [ ] [Gayle L McDowell - Прохождения собеседования по программированию (video)](https://www.youtube.com/watch?v=rEJzOhC5ZtQ)
|
||||
- [ ] [Прохождения собеседования по программированию с Gayle Laakmann McDowell (video)](https://www.youtube.com/watch?v=aClxtDcdpsQ)
|
||||
|
|
@ -600,6 +565,7 @@ Google не возьмёт тебя на работу.
|
|||
- [Вычислительная сложность: Часть 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/)
|
||||
- [Вычислительная сложность: Часть 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/)
|
||||
- [ ] [Шпаргалка](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
Если в некоторых лекциях слишком много математики, вы можете ниже найти и посмотреть
|
||||
лекции по дискретной математике для получения базовых знаний.
|
||||
|
|
@ -647,6 +613,7 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] Описание:
|
||||
- [ ] [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)
|
||||
- не все видео целиком, только кусочки об узлах и распределении памяти.
|
||||
- [ ] Связные списки vs Массивы:
|
||||
|
|
@ -681,6 +648,7 @@ Google не возьмёт тебя на работу.
|
|||
- ### Стек
|
||||
- [ ] [Стек (video)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/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)
|
||||
- [ ] Не будет реализован. Реализация с помощью массива очевидна.
|
||||
|
||||
- ### Очередь
|
||||
|
|
@ -688,6 +656,7 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [Очередь (video)](https://www.coursera.org/learn/data-structures/lecture/EShpq/queue)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [Очередь с приоритетом (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)
|
||||
- [ ] Реализация с использованием связанного списка и указателя на последний элемент(tail):
|
||||
- enqueue(value) - добавляет элемент в конец очереди
|
||||
- dequeue() - возвращает значение и удаляет из очереди последний добавленный элемент(front)
|
||||
|
|
@ -712,6 +681,7 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [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)
|
||||
|
||||
- [ ] Онлайн курсы:
|
||||
- [ ] [Understanding Hash Functions (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Understanding-hash-functions/149042/177126-4.html)
|
||||
|
|
@ -738,6 +708,7 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [Бинарный поиск (видео на ютубе)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [Бинарный поиск (видео на khanacademy)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [Длинная статья с деталями](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Реализация:
|
||||
- бинарный поиск (на отсортированном числовом массиве)
|
||||
- бинарный поиск с использованием рекурсии
|
||||
|
|
@ -792,6 +763,9 @@ Google не возьмёт тебя на работу.
|
|||
- in-order (DFS: левый, вершина, правый)
|
||||
- post-order (DFS: левый, правый, вершина)
|
||||
- pre-order (DFS: вершина, левый, правый)
|
||||
- [ ] [[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)
|
||||
|
||||
- ### Бинарное дерево поиска (BST: Binary search trees)
|
||||
- [ ] [Обзор бинарного дерева поиска (видео)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -839,6 +813,7 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [MIT: Кучи и пирамидальная сортировка (видео)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B Лекция 24: Приоритетные очереди (видео)](https://www.youtube.com/watch?v=yIUFT6AKBGE&index=24&list=PL4BBB74C7D2A1049C)
|
||||
- [ ] [Построение кучи за линейное время (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)
|
||||
- [ ] Реализация max-heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - необходима для вставки
|
||||
|
|
@ -868,25 +843,6 @@ Google не возьмёт тебя на работу.
|
|||
|
||||
- Для пирамидальной сортировки, см. структуру данных "Куча" выше. Пирамидальная сортировка эффективна, но не устойчива.
|
||||
|
||||
- [ ] [Седжвик (Sedgewick) - Сортировка слиянием (5 видео)](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [1. Сортировка слиянием](https://www.youtube.com/watch?v=4nKwesx_c8E&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=1)
|
||||
- [ ] [2. Сортировка слиянием наизнанку](https://www.youtube.com/watch?v=HGOIGUYjeyk&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9&index=2)
|
||||
- [ ] [3. Сложность сортировки](https://www.youtube.com/watch?v=WvU_mIWo0Ac&index=3&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [4. Компараторы](https://www.youtube.com/watch?v=7MvC1kmBza0&index=4&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
- [ ] [5. Устойчивость](https://www.youtube.com/watch?v=XD_5iINB5GI&index=5&list=PLe-ggMe31CTeunC6GZHFBmQx7EKtjbGf9)
|
||||
|
||||
- [ ] [Седжвик (Sedgewick) - Быстрая сортировка (4 видео)](https://www.youtube.com/playlist?list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [1. Быстрая сортировка](https://www.youtube.com/watch?v=5M5A7qPWk84&index=1&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [2. Выбор](https://www.youtube.com/watch?v=CgVYfSyct_M&index=2&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [3. Дублирование ключей](https://www.youtube.com/watch?v=WBFzOYJ5ybM&index=3&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
- [ ] [4. Системные сортировки](https://www.youtube.com/watch?v=rejpZ2htBjE&index=4&list=PLe-ggMe31CTeE3x2-nF1-toca1QpuXwE1)
|
||||
|
||||
- [ ] UC Berkeley:
|
||||
- [ ] [CS 61B Лекция 29: Сортировка I (видео)](https://www.youtube.com/watch?v=EiUvYS2DT6I&list=PL4BBB74C7D2A1049C&index=29)
|
||||
- [ ] [CS 61B Лекция 30: Сортировка II (видео)](https://www.youtube.com/watch?v=2hTY3t80Qsk&list=PL4BBB74C7D2A1049C&index=30)
|
||||
- [ ] [CS 61B Лекция 32: Сортировка III (видео)](https://www.youtube.com/watch?v=Y6LOLpxg6Dc&index=32&list=PL4BBB74C7D2A1049C)
|
||||
- [ ] [CS 61B Лекция 33: Сортировка V (видео)](https://www.youtube.com/watch?v=qNMQ4ly43p4&index=33&list=PL4BBB74C7D2A1049C)
|
||||
|
||||
- [ ] [Пузырькова сортировка (видео)](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB)
|
||||
- [ ] [Анализ пузырьковой сортировки (видео)](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB)
|
||||
- [ ] [Сортировка вставками, Сортировка слиянием (видео)](https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
|
|
@ -904,6 +860,14 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [Реализация (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c)
|
||||
- [ ] [Реализация (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)
|
||||
|
||||
- [ ] Реализация:
|
||||
- [ ] Сортировка слиянием: O(n log n) средний и худший случаи
|
||||
- [ ] Быстрая сортировка O(n log n) средний случай
|
||||
|
|
@ -960,6 +924,8 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [CS 61B 2014: Взвешенные графы (видео)](https://www.youtube.com/watch?v=aJjlQCFwylA&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=19)
|
||||
- [ ] [Жадные алгоритмы: Минимальное остовное дерево (видео)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||
- [ ] [Сильно связные компоненты, Алгоритм Косарайю, Алгоритмы на графах (видео)](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)
|
||||
|
||||
- Полный курс на Coursera:
|
||||
- [ ] [Алгоритмы на графах (видео)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -1322,34 +1288,9 @@ Google не возьмёт тебя на работу.
|
|||
|
||||
- [ ] Серия 2-3 минутных короткие видео по темам (23 видео)
|
||||
- [Видео](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] Серия коротких 2-5 минутных видео - Michael Sambol (18 видео):
|
||||
- [Видео](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] [Видео от Сэджвика - Алгоритмы 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. Анализ Алгоритмов](https://www.youtube.com/watch?v=ZN-nFW0mEpg&list=PLe-ggMe31CTf0_bkOhh7sa5uqeppp3Sr0)
|
||||
- [ ] [03. Стэки и Очереди](https://www.youtube.com/watch?v=TIC1gappbP8&list=PLe-ggMe31CTe-9jhnj3P_3mmrCh0A7iHh)
|
||||
- [ ] [04. Элементарные сортировки](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. Приоритетные очереди](https://www.youtube.com/watch?v=G9TMe0KC0w0&list=PLe-ggMe31CTducy9LDiGVkdSv0NfiRwn5)
|
||||
- [ ] [08. Элементарные таблицы символов](https://www.youtube.com/watch?v=up_nlilw3ac&list=PLe-ggMe31CTc3a8nKRDxFZZrWrBvkc9SG)
|
||||
- [ ] [09. Сбалансированные деревья поиска](https://www.youtube.com/watch?v=qC1BLLPK_5w&list=PLe-ggMe31CTf7jHH_mFT50kayjCEA6Rhu)
|
||||
- [ ] [10. Геометрические применениния BST](https://www.youtube.com/watch?v=Wl30aGAp6TY&list=PLe-ggMe31CTdBsRIw0hXln0hilRs-DqAx)
|
||||
- [ ] [11. Хэш таблицы](https://www.youtube.com/watch?v=QA8fJGO-i9o&list=PLe-ggMe31CTcKxIRGqqThMts2eHtSrf11)
|
||||
- [ ] [Видео от Сэджвика - Алгоритмы II](https://www.youtube.com/user/algorithmscourses/playlists?flow=list&shelf_id=3&view=50)
|
||||
- [ ] [01. Ненаправленные графы](https://www.youtube.com/watch?v=GmVhD-mmMBg&list=PLe-ggMe31CTc0zDzANxl4I2MhMoRVlbRM)
|
||||
- [ ] [02. Направленные графы](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. Кратчайшие пути](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. Поиск подстроки](https://www.youtube.com/watch?v=QzI0p6zDjK4&list=PLe-ggMe31CTdAdjXB3lIuf2maubzo9t66)
|
||||
- [ ] [09. Регулярные выражения](https://www.youtube.com/watch?v=TQWNQsJSPnk&list=PLe-ggMe31CTetTlJWouM42fyttyKPgSDh)
|
||||
- [ ] [10. Сжатие данных](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. Линейное программирование](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)
|
||||
- [ ] Серия коротких 2-5 минутных видео - Michael Sambol (48 видео):
|
||||
- [Видео](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1381,7 +1322,6 @@ Google не возьмёт тебя на работу.
|
|||
- [Математика для Топ-кодеров](https://www.topcoder.com/community/data-science/data-science-tutorials/mathematics-for-topcoders/)
|
||||
- [Динамическое программирование - От новичка до продвинутого](https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/)
|
||||
- [Материалы для интервью от MIT](https://web.archive.org/web/20160906124824/http://courses.csail.mit.edu/iap/interview/materials.php)
|
||||
- [Упражнения по улучшению навыков для определенного языка](http://exercism.io/languages)
|
||||
|
||||
**Прочитайте и выполните упражнения (именно в этом порядке):**
|
||||
|
||||
|
|
@ -1412,7 +1352,7 @@ Google не возьмёт тебя на работу.
|
|||
- [InterviewBit](https://www.interviewbit.com)
|
||||
|
||||
Возможно:
|
||||
- [Тестовые интервьюверы из больших компаний](http://www.gainlo.co/)
|
||||
- [Тестовые интервьюверы из больших компаний](http://www.gainlo.co/#!/)
|
||||
|
||||
## Перед собеседованием
|
||||
|
||||
|
|
@ -1748,6 +1688,7 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [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:
|
||||
|
|
@ -1773,6 +1714,7 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [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:
|
||||
|
|
@ -1808,6 +1750,7 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [MIT 6.851 - Модели Иерархии Памяти (видео)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
- включает кэш-агностические B-Деревья, крайне интересные структуры данных
|
||||
- первые 37 минут очень технические, можно пропустить (B это размер блока, размер кэша)
|
||||
- [[Review] B-Trees (playlist) in 26 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz)
|
||||
|
||||
- ### k-D Деревья
|
||||
- прекрасны для нахождения всех точек в прямоугольнике или более многомерном объекте
|
||||
|
|
@ -1825,10 +1768,6 @@ Google не возьмёт тебя на работу.
|
|||
- [ ] [Алгоритм Форд — Фалкерсона (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0)
|
||||
- [ ] [Транспортные сети (видео)](https://www.youtube.com/watch?v=2vhN4Ice5jI)
|
||||
|
||||
- ### Непересекающиеся Множества и Система Непересекающихся Множеств
|
||||
- [ ] [UCB 61B - Непересекающиеся Множества; Сортировка и выборка (видео)](https://www.youtube.com/watch?v=MAEGXTwmUsI&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=21)
|
||||
- [ ] [Алгоритмы Седжвика - Система непересекающихся множеств (6 видео)](https://www.youtube.com/watch?v=8mYfZeHtdNc&list=PLe-ggMe31CTexoNYnMhbHaWhQ0dvcy43t)
|
||||
|
||||
- ### Математика для Быстрой Обработки
|
||||
- [ ] [Арифметика целых чисел, Умножение Карацубы (видео)](https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [Китайская теорема об остатках (используется в криптографии) (видео)](https://www.youtube.com/watch?v=ru7mWZJlRQg)
|
||||
|
|
@ -1871,7 +1810,6 @@ Google не возьмёт тебя на работу.
|
|||
- [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/)
|
||||
|
|
|
|||
|
|
@ -31,35 +31,6 @@
|
|||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -177,7 +148,6 @@
|
|||
- [ต้นไม้แบบ k-D](#k-d-trees)
|
||||
- [การข้ามรายการ](#skip-lists)
|
||||
- [กระแสเครือข่าย](#network-flows)
|
||||
- [โครงสร้างข้อมูลไม่มีส่วนร่วม และ ยูเนียนและค้นหา](#disjoint-sets--union-find)
|
||||
- [คณิตศาสต์สำหรับการประมวณผลอย่างรวดเร็ว](#math-for-fast-processing)
|
||||
- [ทรีพ](#treap)
|
||||
- [การโปรแกรมเชิงเส้น](#linear-programming)
|
||||
|
|
@ -247,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)
|
||||
|
|
@ -523,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
|
||||
|
|
@ -535,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
|
||||
|
|
@ -571,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:
|
||||
|
|
@ -602,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)
|
||||
|
|
@ -634,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)
|
||||
|
|
@ -660,6 +623,7 @@ 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
|
||||
|
|
@ -713,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)
|
||||
|
|
@ -760,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
|
||||
|
|
@ -789,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)
|
||||
|
|
@ -825,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
|
||||
|
|
@ -883,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)
|
||||
|
|
@ -1323,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)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1383,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):**
|
||||
|
||||
|
|
@ -1419,7 +1352,7 @@ Challenge sites:
|
|||
- [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
|
||||
|
|
@ -1532,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.
|
||||
|
|
@ -1694,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:
|
||||
|
|
@ -1719,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:
|
||||
|
|
@ -1758,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
|
||||
|
|
@ -1776,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)
|
||||
|
|
@ -1822,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/)
|
||||
|
|
|
|||
|
|
@ -1,6 +1,6 @@
|
|||
# Kodlama Mülakatı Üniversitesi
|
||||
|
||||
> Aslında bunu yazılım mühendisi olabilmek için kısa bir yapılacaklar listesi olarak hazırladım,
|
||||
> Başlangıçta bunu yazılım mühendisi olabilmek için kısa bir yapılacaklar listesi olarak hazırladım,
|
||||
> ama bugün gördüğünüz büyük listeye dönüştü. Bu çalışma planını tamamladıktan sonra, [Amazon tarafından
|
||||
> Yazılım Geliştirme Mühendisi olarak işe alındım.](https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)!
|
||||
> Muhtemelen yaptığım kadar çok çalışmanıza gerek kalmayacaktır. Her neyse, ihtiyaç duyabileceğiniz her şey burada.
|
||||
|
|
@ -16,73 +16,46 @@
|
|||
<details>
|
||||
<summary>Translations:</summary>
|
||||
|
||||
- [中文版本](translations/README-cn.md)
|
||||
- [Tiếng Việt - Vietnamca](translations/README-vi.md)
|
||||
- [İspanyolca](translations/README-es.md)
|
||||
- [Brezilya Portekizcesi](translations/README-ptbr.md)
|
||||
- [Lehçe](translations/README-pl.md)
|
||||
- [繁體中文](translations/README-tw.md)
|
||||
- [Japonca (日本語)](translations/README-ja.md)
|
||||
- [Rusça](translations/README-ru.md)
|
||||
- [Almanca](translations/README-de.md)
|
||||
- [Bahasa Indonesia](translations/README-id.md)
|
||||
- [ខ្មែរ - Kmer](translations/README-kh.md)
|
||||
- [Özbekçe](translations/README-uz.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>Translations in progress:</summary>
|
||||
|
||||
- [हिन्दी](https://github.com/jwasham/coding-interview-university/issues/81)
|
||||
- [עברית](https://github.com/jwasham/coding-interview-university/issues/82)
|
||||
- [Arapça](https://github.com/jwasham/coding-interview-university/issues/98)
|
||||
- [Türkçe](https://github.com/jwasham/coding-interview-university/issues/90)
|
||||
- [Fransızca](https://github.com/jwasham/coding-interview-university/issues/89)
|
||||
- [Українська](https://github.com/jwasham/coding-interview-university/issues/106)
|
||||
- [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)
|
||||
- [Telugu](https://github.com/jwasham/coding-interview-university/issues/117)
|
||||
- [Urdu](https://github.com/jwasham/coding-interview-university/issues/519)
|
||||
- [Thai](https://github.com/jwasham/coding-interview-university/issues/156)
|
||||
- [Yunanca](https://github.com/jwasham/coding-interview-university/issues/166)
|
||||
- [İtalyanca](https://github.com/jwasham/coding-interview-university/issues/170)
|
||||
- [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>Sponsor olun</strong> ve Kodlama Mülakatı Üniversitesi'ni destekleyin!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Özellikte teşekkürler:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>2018'de kurulan OSS Capital, yalnızca erken aşamadaki COSS (ticari açık kaynak) start-up<br> kurucularını desteklemeye odaklanan ilk ve tek risk sermayesi platformudur.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Bulut için oluşturulmuş geliştirme ortamları</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>GitLab, GitHub ve Bitbucket ile yerel olarak entegre olan Gitpod, tüm branchlarınız için otomatik olarak ve sürekli olarak geliştirme ortamları oluşturur. Sonuç olarak, ekip üyeleri her yeni görev için anında yeni geliştirme ortamlarıyla kodlamaya başlayabilir - ister yeni bir özellik oluşturuyor olun, ister bir hatayı düzeltmek istiyor olun, ister bir kod incelemesi üzerinde çalışıyor olun.</sup>
|
||||
</div>
|
||||
</a>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
|
@ -540,6 +513,7 @@ Kodları beyaz tahtaya ya da kağıda yazın, bilgisayara değil. Örnek girdile
|
|||
- [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/)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
## Veri Yapıları
|
||||
|
||||
|
|
@ -581,6 +555,7 @@ Kodları beyaz tahtaya ya da kağıda yazın, bilgisayara değil. Örnek girdile
|
|||
- [ ] [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)
|
||||
- tüm video değil, Node yapısı ve bellek ayırma için olan bölümler.
|
||||
- [ ] Bağlı Listeler vs Diziler:
|
||||
|
|
@ -612,11 +587,13 @@ Kodları beyaz tahtaya ya da kağıda yazın, bilgisayara değil. Örnek girdile
|
|||
|
||||
- ### Yığın
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Uygulamayın. Diziyle gerçekleştirmek önemsiz.
|
||||
|
||||
- ### Kuyruk
|
||||
- [ ] [Kuyruk (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] Bağlı listeyle birlikte kuyruk işaretçisi kullanarak uygulayın:
|
||||
- enqueue(value) - kuyruktaki pozisyona değer ekler
|
||||
- dequeue() - değeri döndürür ve en son eklenen elemanı kaldırır (ön)
|
||||
|
|
@ -642,6 +619,7 @@ Kodları beyaz tahtaya ya da kağıda yazın, bilgisayara değil. Örnek girdile
|
|||
- [ ] [PyCon 2017: The Dictionary Even Mightier (video)](https://www.youtube.com/watch?v=66P5FMkWoVU)
|
||||
- [ ] [(İleri Seviye) Randomization: Universal & Perfect Hashing (video)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(İleri Seviye) 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 Kurslar:
|
||||
- [ ] [Hash Fonksiyonlarını Anlama (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Understanding-hash-functions/149042/177126-4.html)
|
||||
|
|
@ -668,6 +646,7 @@ Kodları beyaz tahtaya ya da kağıda yazın, bilgisayara değil. Örnek girdile
|
|||
- [ ] [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/competitive-programming/tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Uygulama:
|
||||
- binary search (sıralanmış tam sayı dizisine)
|
||||
- binary search (rekürsif kullanarak)
|
||||
|
|
@ -719,6 +698,10 @@ Kodları beyaz tahtaya ya da kağıda yazın, bilgisayara değil. Örnek girdile
|
|||
- inorder (DFS: sol, kendisi, sağ)
|
||||
- postorder (DFS: sol, sağ, kendisi)
|
||||
- preorder (DFS: kendisi, sol, sağ)
|
||||
- [ ] [[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)
|
||||
|
||||
|
||||
- ### İkili arama ağaçları: BSTs
|
||||
- [ ] [İkili Arama Ağacı İncelemesi (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -764,6 +747,7 @@ Kodları beyaz tahtaya ya da kağıda yazın, bilgisayara değil. Örnek girdile
|
|||
- [ ] [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)
|
||||
- [ ] Max-heap uygulaması:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - eklemek için gerekli
|
||||
|
|
@ -828,6 +812,14 @@ Kodları beyaz tahtaya ya da kağıda yazın, bilgisayara değil. Örnek girdile
|
|||
- [ ] [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)
|
||||
|
||||
- [ ] Uygulama:
|
||||
- [ ] Mergesort: O(n log n) ortalama ve en kötü durum
|
||||
- [ ] Quicksort O(n log n) ortalama durum
|
||||
|
|
@ -891,6 +883,8 @@ Graflar, bilgisayar bilimlerinde birçok sorunu temsil etmek için kullanılabil
|
|||
- [ ] [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)
|
||||
|
||||
- Full Coursera Kursu:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -1263,8 +1257,9 @@ Graflar, bilgisayar bilimlerinde birçok sorunu temsil etmek için kullanılabil
|
|||
|
||||
- [ ] 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)
|
||||
- [ ] 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)
|
||||
- [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1)
|
||||
- [ ] [Sedgewick Videos - Algorithms II](https://www.coursera.org/learn/algorithms-part2)
|
||||
|
||||
|
|
@ -1300,7 +1295,6 @@ Supplemental:
|
|||
- [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)
|
||||
|
||||
**Read and Do Programming Problems (in this order):**
|
||||
|
||||
|
|
@ -1354,7 +1348,7 @@ Challenge repos:
|
|||
- [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/) - I used this and it helped me relax for the phone screen and on-site interview
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/) - I used this and it helped me relax for the phone screen and on-site interview
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/) - peer-to-peer model of practice interviews
|
||||
- [Refdash: Mock interviews and expedited interviews](https://refdash.com/) - also help candidates fast track by skipping multiple interviews with tech companies
|
||||
- [interviewing.io: Practice mock interview with senior engineers](https://interviewing.io) - anonymous algorithmic/systems design interviews with senior engineers from FAANG anonymously.
|
||||
|
|
@ -1399,20 +1393,20 @@ Have a story, not just data, about something you accomplished.
|
|||
- [General Interview Questions and their Answers](https://ayedot.com/119/MiniBlog/General-Interview-Questions-and-their-Answers-for-Tech-Jobs)
|
||||
|
||||
|
||||
## Have questions for the interviewer
|
||||
## Mülakatı yapan kişiye muhakkak sorularınız olsun
|
||||
|
||||
Some of mine (I already may know answer to but want their opinion or team perspective):
|
||||
Benim bazı sorularım (cevabını bilsem de onların görüşünü veya takımın bakış açısını isteyebilirim):
|
||||
|
||||
- How large is your team?
|
||||
- What does your dev cycle look like? Do you do waterfall/sprints/agile?
|
||||
- Are rushes to deadlines common? Or is there flexibility?
|
||||
- How are decisions made in your team?
|
||||
- How many meetings do you have per week?
|
||||
- Do you feel your work environment helps you concentrate?
|
||||
- What are you working on?
|
||||
- What do you like about it?
|
||||
- What is the work life like?
|
||||
- How is work/life balance?
|
||||
- Takımınız kaç kişi?
|
||||
- Geliştirici döngüsü nasıl? Waterfall/sprints/agile olarak mı çalışıyorsunuz?
|
||||
- Teslim tarihlerine yetişmeye çalışma yaygın mıdır? Yoksa esneklik mevcut mu?
|
||||
- Takımınızda kararlar nasıl verilir?
|
||||
- Haftada kaç toplantınız oluyor?
|
||||
- İş ortamınız odaklanmanıza yardımcı oluyor mu?
|
||||
- Neyin üzerinde çalışıyorsunuz?
|
||||
- İşinizle ilgili neyi seviyorsunuz?
|
||||
- İş hayatı nasıldır?
|
||||
- İş yaşam dengesi nasıldır?
|
||||
|
||||
|
||||
## Once You've Got The Job
|
||||
|
|
@ -1527,7 +1521,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
|
||||
- I filled in the list below from good tools.
|
||||
|
|
@ -1688,6 +1681,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:
|
||||
|
|
@ -1712,7 +1706,8 @@ You're never really done.
|
|||
- [Aduni - Algorithms - Lecture 4 (link jumps to starting point) (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 search trees**
|
||||
- In practice:
|
||||
|
|
@ -1753,6 +1748,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
|
||||
|
|
@ -1819,7 +1815,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/)
|
||||
|
|
|
|||
|
|
@ -14,35 +14,40 @@
|
|||
<details>
|
||||
<summary>翻譯:</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>正在翻譯的項目:</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">
|
||||
|
|
@ -50,35 +55,6 @@
|
|||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -270,7 +246,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/)
|
||||
- [ ] [Demystifying Tech Recruiting](https://www.youtube.com/watch?v=N233T0epWTs)
|
||||
- [ ] 如何錄取Big Tech(Google, Amazon, Facebook, Apple):
|
||||
- [ ] [How to Get a Job at the Big 4 - Amazon, Facebook, Google & Microsoft (video)](https://www.youtube.com/watch?v=YJZCUhxNCv8)
|
||||
|
|
@ -506,6 +481,7 @@
|
|||
- [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/)
|
||||
- [ ] [Cheat sheet](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
## 資料結構
|
||||
- ### 陣列
|
||||
|
|
@ -548,6 +524,7 @@
|
|||
- [ ] [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)
|
||||
- 沒有完整的code，裡面只包含了用struct實作節點的方式以及其記憶體配置。
|
||||
- [ ] Linked List vs 陣列:
|
||||
|
|
@ -580,6 +557,7 @@
|
|||
- ### Stack(堆疊)
|
||||
- [ ] [Stacks(影片)](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks)
|
||||
- [ ] [使用Stacks先進後出(Last-In First-Out)(影片)]()
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] 無須實作，可以用陣列實作，但這樣太過簡單了。
|
||||
|
||||
- ### Queue(佇列)
|
||||
|
|
@ -587,6 +565,7 @@
|
|||
- [ ] [Queue(影片)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [Priority Queues(影片)]()
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] 使用linked list實作，包含末端指標(tail pointer):
|
||||
- enqueue(value) - 在queue末端加入元素
|
||||
- dequeue() - 刪除當時queue中最早進入的元素(意即queue中第一個元素)，並且回傳該元素的值。
|
||||
|
|
@ -606,6 +585,7 @@
|
|||
- [ ] [PyCon 2010: The Mighty Dictionary (影片)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
|
||||
- [ ] [(Advanced) Randomization: Universal & Perfect Hashing (影片)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
|
||||
- [ ] [(Advanced) Perfect hashing (影片)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4)
|
||||
- [ ] [[Review] Hash tables in 4 minutes (video)](https://youtu.be/knV86FlSXJ8)
|
||||
- [ ] 線上開放式課程:
|
||||
- [ ] [Understanding Hash Functions (影片)]()
|
||||
- [ ] [Using Hash Tables (影片)]()
|
||||
|
|
@ -631,6 +611,7 @@
|
|||
- [ ] [二分搜尋法(影片)](https://www.youtube.com/watch?v=D5SrAga1pno)
|
||||
- [ ] [二分搜尋法(影片)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
|
||||
- [ ] [細節](https://www.topcoder.com/community/competitive-programming/tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] 實作:
|
||||
- 二分搜尋法 (對已經排列好的數列)
|
||||
- 用遞迴(recursion)的方法實作二分搜尋法
|
||||
|
|
@ -680,6 +661,9 @@
|
|||
- 中序 (DFS: 左子樹、根、右子樹)
|
||||
- 後序 (DFS: 左子樹、右子樹、根)
|
||||
- 前序 (DFS: 根、左子樹、右子樹)
|
||||
- [ ] [[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 (影片)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -727,6 +711,7 @@
|
|||
- [ ] [MIT: Heaps and Heap Sort (影片)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
|
||||
- [ ] [CS 61B Lecture 24: Priority Queues (影片)](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)
|
||||
- [ ] 實作max heap:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - needed for insert
|
||||
|
|
@ -792,6 +777,14 @@
|
|||
- [ ] [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)
|
||||
|
||||
- [ ] 實作:
|
||||
- [ ] 合併排序: 平均與最糟都是O(n log n)
|
||||
- [ ] 快速排序: 平均O(n log n)
|
||||
|
|
@ -854,6 +847,8 @@
|
|||
- [ ] [CS 61B 2014: Weighted graphs (影片)](https://archive.org/details/ucberkeley_webcast_zFbq8vOZ_0k)
|
||||
- [ ] [Greedy Algorithms: Minimum Spanning Tree (影片)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
|
||||
- [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (影片)](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)
|
||||
|
||||
- 完整Coursera課程:
|
||||
- [ ] [Algorithms on Graphs (影片)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -1236,8 +1231,9 @@
|
|||
|
||||
- [ ] 2-3分鐘快速複習影片系列(23個影片)
|
||||
- [影片](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] 2-5分鐘快速複習影片系列-Michael Sambol (18個影片)
|
||||
- [影片](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] 2-5分鐘快速複習影片系列-Michael Sambol (48個影片)
|
||||
- [影片](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)
|
||||
|
||||
|
|
@ -1268,7 +1264,6 @@
|
|||
- [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)
|
||||
|
||||
|
||||
**閱讀並解題(按照以下順序):**
|
||||
|
|
@ -1313,7 +1308,7 @@ Coding面試題目影片:
|
|||
- [Python互動式coding面試解題](https://github.com/donnemartin/interactive-coding-challenges)
|
||||
|
||||
更多面試:
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/) - I used this and it helped me relax for the phone screen and on-site interview.
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/) - I used this and it helped me relax for the phone screen and on-site interview.
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/) - 點對點面試練習
|
||||
- [Refdash: Mock interviews and expedited interviews](https://refdash.com/) - 同樣能藉由跳過跟多家科技公司的面試，幫助你快速步上軌道，
|
||||
|
||||
|
|
@ -1606,6 +1601,7 @@ Coding面試題目影片:
|
|||
- [AVL Trees (影片)](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees)
|
||||
- [AVL Tree Implementation (影片)](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 tree**
|
||||
- 實際上:
|
||||
|
|
@ -1625,7 +1621,8 @@ Coding面試題目影片:
|
|||
- [Aduni - Algorithms - Lecture 4 (link jumps to starting point) (影片)](https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871)
|
||||
- [Aduni - Algorithms - Lecture 5 (影片)](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搜尋樹**
|
||||
- 實際上:
|
||||
|
|
@ -1662,6 +1659,7 @@ Coding面試題目影片:
|
|||
- [MIT 6.851 - Memory Hierarchy Models (影片)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
- 涵蓋了cache-oblivious B樹，非常有趣的資料結構
|
||||
- 前37分鐘非常技術性，可以跳過(B代表block大小、cache line大小)
|
||||
- [[Review] B-Trees (playlist) in 26 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz)
|
||||
|
||||
|
||||
- ### k-D樹
|
||||
|
|
@ -1925,4 +1923,4 @@ Coding面試題目影片:
|
|||
|
||||
## LICENSE
|
||||
|
||||
[CC-BY-SA-4.0](./LICENSE.txt)
|
||||
[CC-BY-SA-4.0](./LICENSE.txt)
|
||||
|
|
|
|||
|
|
@ -20,37 +20,40 @@ Microsoft.
|
|||
<details>
|
||||
<summary>Переклади:</summary>
|
||||
|
||||
- [中文版本](translations/README-cn.md)
|
||||
- [Tiếng Việt - Vietnamese](translations/README-vi.md)
|
||||
- [Español](translations/README-es.md)
|
||||
- [Português Brasileiro](translations/README-ptbr.md)
|
||||
- [Polish](translations/README-pl.md)
|
||||
- [繁體中文](translations/README-tw.md)
|
||||
- [Japanese (日本語)](translations/README-ja.md)
|
||||
- [Russian](translations/README-ru.md)
|
||||
- [German](translations/README-de.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>Переклади в процесі:</summary>
|
||||
|
||||
- [हिन्दी](https://github.com/jwasham/coding-interview-university/issues/81)
|
||||
- [עברית](https://github.com/jwasham/coding-interview-university/issues/82)
|
||||
- [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)
|
||||
- [Українська](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)
|
||||
- [Urdu](https://github.com/jwasham/coding-interview-university/issues/519)
|
||||
- [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)
|
||||
</details>
|
||||
|
||||
<div align="center">
|
||||
|
|
@ -58,35 +61,6 @@ Microsoft.
|
|||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
|
|
@ -221,7 +195,6 @@ Facebook та Microsoft, відрізняють розробку програм
|
|||
- [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)
|
||||
|
|
@ -292,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)
|
||||
|
|
@ -571,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
|
||||
|
|
@ -583,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
|
||||
|
|
@ -619,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:
|
||||
|
|
@ -650,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)
|
||||
|
|
@ -682,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)
|
||||
|
|
@ -708,6 +674,7 @@ 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
|
||||
|
|
@ -761,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)
|
||||
|
|
@ -808,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
|
||||
|
|
@ -837,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)
|
||||
|
|
@ -873,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
|
||||
|
|
@ -932,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)
|
||||
|
|
@ -1374,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)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -1434,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):**
|
||||
|
||||
|
|
@ -1470,7 +1406,7 @@ Challenge sites:
|
|||
- [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
|
||||
|
|
@ -1583,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.
|
||||
|
|
@ -1745,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:
|
||||
|
|
@ -1770,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:
|
||||
|
|
@ -1809,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
|
||||
|
|
@ -1827,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)
|
||||
|
|
@ -1873,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/)
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
|
|
@ -13,41 +13,12 @@ Asl versiyasi: [Inglizcha](../README.md)
|
|||
> *Sizga omad tilayman!*
|
||||
|
||||
<div align="center">
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<p>
|
||||
<strong>Special thanks to:</strong>
|
||||
</p>
|
||||
<p>
|
||||
<a href="https://oss.capital/">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
|
||||
</div>
|
||||
<div>
|
||||
<sup><strong>Founded in 2018, OSS Capital is the first and only venture capital platform focused<br>exclusively on supporting early-stage COSS (commercial open source) startup founders.</strong></sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<br />
|
||||
<p>
|
||||
<a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
|
||||
<div>
|
||||
<img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
|
||||
</div>
|
||||
<div>
|
||||
<p>
|
||||
<strong>Dev environments built for the cloud</strong>
|
||||
</p>
|
||||
</div>
|
||||
<div>
|
||||
<sup>Natively integrated with GitLab, GitHub, and Bitbucket, Gitpod automatically and continuously prebuilds dev environments for all your branches. As a result team members can instantly start coding with fresh dev environments for each new task - no matter if you are building a new feature, want to fix a bug, or work on a code review.</sup>
|
||||
</div>
|
||||
</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
<hr />
|
||||
<p>
|
||||
<a href="https://github.com/sponsors/jwasham"><strong>Become a sponsor</strong> and support Coding Interview University!</a>
|
||||
</p>
|
||||
<hr />
|
||||
</div>
|
||||
|
||||
## Bu nima uchun kerak?
|
||||
|
||||
|
|
@ -515,6 +486,7 @@ Birinchi kodizni doskada yoki qog'ozda yozing, kompyuterda emas. Og'zaki test qi
|
|||
- [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/)
|
||||
- [ ] [Cheat varaq](http://bigocheatsheet.com/)
|
||||
- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv)
|
||||
|
||||
## Ma'lumotlar tuzilmasi (Data structures)
|
||||
|
||||
|
|
@ -557,6 +529,7 @@ Birinchi kodizni doskada yoki qog'ozda yozing, kompyuterda emas. Og'zaki test qi
|
|||
- [ ] [Singly Linked Lists (video)](https://www.coursera.org/lecture/data-structures/singly-linked-lists-kHhgK)
|
||||
- [ ] [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)
|
||||
- butun videoni ko'rmang, Node struct va xotira ajratish (memory allocation) qismlarini ko'ring
|
||||
- [ ] Linked List va Array(massiv)lar:
|
||||
|
|
@ -588,11 +561,13 @@ Birinchi kodizni doskada yoki qog'ozda yozing, kompyuterda emas. Og'zaki test qi
|
|||
|
||||
- ### Stack
|
||||
- [ ] [Stacks (video)](https://www.coursera.org/lecture/data-structures/stacks-UdKzQ)
|
||||
- [ ] [[Review] Stacks in 3 minutes (video)](https://youtu.be/KcT3aVgrrpU)
|
||||
- [ ] Kodda yozmayman. Massivda stackni yaratish juda oson.
|
||||
|
||||
- ### Queue
|
||||
- [ ] [Queue (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
|
||||
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
|
||||
- [ ] [[Review] Queues in 3 minutes (video)](https://youtu.be/D6gu-_tmEpQ)
|
||||
- [ ] linked-list dan foydalangan holda kodda yozaman (tail pointer bilan):
|
||||
- enqueue(value) - qiymatni queue-ni oxiriga qo'yadi
|
||||
- dequeue() - queue-ni boshidagi elementni o'chirib uni qiymatini qaytaradi
|
||||
|
|
@ -616,6 +591,7 @@ Birinchi kodizni doskada yoki qog'ozda yozing, kompyuterda emas. Og'zaki test qi
|
|||
- [ ] [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)
|
||||
|
||||
- [ ] Onlayn kurslar:
|
||||
- [ ] [Core Hash Tables (video)](https://www.coursera.org/lecture/data-structures-optimizing-performance/core-hash-tables-m7UuP)
|
||||
|
|
@ -631,6 +607,14 @@ Birinchi kodizni doskada yoki qog'ozda yozing, kompyuterda emas. Og'zaki test qi
|
|||
- exists(key)
|
||||
- get(key)
|
||||
- remove(key)
|
||||
|
||||
## Ma'lumotlar tuzilmasi vizualizatsiya (Data structure Visualizations)
|
||||
|
||||
Animatsiya orqali ma'lumotlar tuzilmalari va algoritmlarini vizualizatsiya qilish.
|
||||
Quyidagi havolada siz ma'lumotlar tuzilmasi aslida qanday ishlashini tushunib olasiz.
|
||||
|
||||
- [ ] [Visualizing Algorithms](https://www.cs.usfca.edu/~galles/visualization/Algorithms.html)
|
||||
- [ ] [Visualgo](https://visualgo.net/en)
|
||||
|
||||
## Qo'shimcha bilimlar
|
||||
|
||||
|
|
@ -638,6 +622,7 @@ Birinchi kodizni doskada yoki qog'ozda yozing, kompyuterda emas. Og'zaki test qi
|
|||
- [ ] [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)
|
||||
- [ ] [batafsil](https://www.topcoder.com/community/competitive-programming/tutorials/binary-search/)
|
||||
- [ ] [[Review] Binary search in 4 minutes (video)](https://youtu.be/fDKIpRe8GW4)
|
||||
- [ ] Kodda yozish:
|
||||
- binary search (tartiblangan integer massivlarida)
|
||||
- rekursiv binary search
|
||||
|
|
@ -689,6 +674,9 @@ Birinchi kodizni doskada yoki qog'ozda yozing, kompyuterda emas. Og'zaki test qi
|
|||
- 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 tree lar: BST lar
|
||||
- [ ] [Binary Search Tree Tahlili (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
||||
|
|
@ -734,6 +722,7 @@ Birinchi kodizni doskada yoki qog'ozda yozing, kompyuterda emas. Og'zaki test qi
|
|||
- [ ] [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)
|
||||
- [ ] max-heap ni kodda yozish:
|
||||
- [ ] insert
|
||||
- [ ] sift_up - insert operatsiyasi uchun kerak
|
||||
|
|
@ -798,6 +787,14 @@ Birinchi kodizni doskada yoki qog'ozda yozing, kompyuterda emas. Og'zaki test qi
|
|||
- [ ] [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)
|
||||
|
||||
- [ ] Kodda yozish:
|
||||
- [ ] Mergesort: O(n log n) o'rtacha va eng yomon holat
|
||||
- [ ] Quicksort O(n log n) o'rtacha
|
||||
|
|
@ -860,6 +857,8 @@ Computer science da graflar bir talay masalalarni tasvirlashda ishlatiladi. Shun
|
|||
- [ ] [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)
|
||||
|
||||
- To'liq Coursera kursi:
|
||||
- [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
|
||||
|
|
@ -1244,8 +1243,9 @@ Computer science da graflar bir talay masalalarni tasvirlashda ishlatiladi. Shun
|
|||
|
||||
- [ ] 2-3 minutlik qisqa mavzuga oid videolar seriyasi (23 video)
|
||||
- [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- [ ] 2-5 minutlik qisqa mavzuga oid videolar seriyasi - Michael Sambol (18 video):
|
||||
- [Videos](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
|
||||
- [ ] 2-5 minutlik qisqa mavzuga oid videolar seriyasi - Michael Sambol (48 video):
|
||||
- [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)
|
||||
|
||||
|
|
@ -1282,7 +1282,6 @@ Qo'shimcha:
|
|||
- [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)
|
||||
|
||||
**Dasturlash masalalarini o'qing va bajaring (ketma ketlikda):**
|
||||
|
||||
|
|
@ -1336,7 +1335,7 @@ Mashqlar repolari
|
|||
- [Interactive Coding Interview Challenges in Python](https://github.com/donnemartin/interactive-coding-challenges)
|
||||
|
||||
Mock intervyular
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/) - Men buni ishlatdim va u menga phone screen va on-site intervyularga ruhan tayyorladi
|
||||
- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/) - Men buni ishlatdim va u menga phone screen va on-site intervyularga ruhan tayyorladi
|
||||
- [Pramp: Mock interviews from/with peers](https://www.pramp.com/) - foydalanuvchilararo intervyuga tayyorlanish modeli
|
||||
- [Refdash: Mock interviews and expedited interviews](https://refdash.com/) - kandidatlarga tech kompaniyalar bilan bo'ladigan bir nechta intervyulardan sakrab o'tishga ham yordam beradi
|
||||
- [interviewing.io: Practice mock interview with senior engineers](https://interviewing.io) - FAANG-dan senior injinerlar bilan anonim algoritm/tizim dizayn intervyulari
|
||||
|
|
@ -1498,7 +1497,6 @@ Hech qachon tugatgan bo'lmaymiz.
|
|||
- [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 uchun buyruqlar ro'yxati
|
||||
- Quyidagi ro'yxatni yaxshi vositalardan to'ldirdim.
|
||||
|
|
@ -1659,6 +1657,7 @@ Hech qachon tugatgan bo'lmaymiz.
|
|||
- [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**
|
||||
- Amalda:
|
||||
|
|
@ -1682,7 +1681,8 @@ Hech qachon tugatgan bo'lmaymiz.
|
|||
- [Aduni - Algorithms - Lecture 4 (link videoni kerakli joyidan boshlaydi) (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 search tree-lar**
|
||||
- Amalda:
|
||||
|
|
@ -1721,6 +1721,7 @@ Hech qachon tugatgan bo'lmaymiz.
|
|||
- [MIT 6.851 - Memory Hierarchy Models (video)](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
|
||||
- keshga e'tiborsiz B-Tree-lar haqida, juda qiziq data strukturalari
|
||||
- birinchi 37 minuti juda texnik, o'tkazib yuborsangiz bo'ladi (B bu bo'lak hajmi, kesh qator hajmi)
|
||||
- [[Review] B-Trees (playlist) in 26 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz)
|
||||
|
||||
|
||||
- ### k-D Tree-lar
|
||||
|
|
@ -1785,7 +1786,6 @@ Hech qachon tugatgan bo'lmaymiz.
|
|||
- [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)
|
||||
- Manbalar:
|
||||
- Kitoblar:
|
||||
- [Python Machine Learning](https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/)
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load Diff
Loading…
Reference in New Issue