|
@@ -93,7 +93,7 @@ Translations:
|
|
- [스케쥴링](#scheduling)
|
|
- [스케쥴링](#scheduling)
|
|
- [시스템 루틴의 구현](#implement-system-routines)
|
|
- [시스템 루틴의 구현](#implement-system-routines)
|
|
- [문자열 검색 & 조작](#string-searching--manipulations)
|
|
- [문자열 검색 & 조작](#string-searching--manipulations)
|
|
-- [System Design, Scalability, Data Handling](#system-design-scalability-data-handling) (if you have 4+ years experience)
|
|
|
|
|
|
+- [시스템 디자인, 확장성, 데이터 핸들링](#system-design-scalability-data-handling) (4년 이상 경력자를 위한 주제)
|
|
- [최종 리뷰](#final-review)
|
|
- [최종 리뷰](#final-review)
|
|
- [코딩 문제 연습](#coding-question-practice)
|
|
- [코딩 문제 연습](#coding-question-practice)
|
|
- [코딩 연습 / 도전](#coding-exerciseschallenges)
|
|
- [코딩 연습 / 도전](#coding-exerciseschallenges)
|
|
@@ -105,54 +105,54 @@ Translations:
|
|
|
|
|
|
---------------- Everything below this point is optional ----------------
|
|
---------------- Everything below this point is optional ----------------
|
|
|
|
|
|
-- [Additional Books](#additional-books)
|
|
|
|
-- [Additional Learning](#additional-learning)
|
|
|
|
- - [Compilers](#compilers)
|
|
|
|
- - [Floating Point Numbers](#floating-point-numbers)
|
|
|
|
- - [Unicode](#unicode)
|
|
|
|
- - [Endianness](#endianness)
|
|
|
|
- - [Emacs and vi(m)](#emacs-and-vim)
|
|
|
|
- - [Unix command line tools](#unix-command-line-tools)
|
|
|
|
- - [Information theory](#information-theory)
|
|
|
|
- - [Parity & Hamming Code](#parity--hamming-code)
|
|
|
|
- - [Entropy](#entropy)
|
|
|
|
- - [Cryptography](#cryptography)
|
|
|
|
- - [Compression](#compression)
|
|
|
|
- - [Networking](#networking) (if you have networking experience or want to be a systems engineer, expect questions)
|
|
|
|
- - [Computer Security](#computer-security)
|
|
|
|
- - [Garbage collection](#garbage-collection)
|
|
|
|
- - [Parallel Programming](#parallel-programming)
|
|
|
|
- - [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
|
|
|
|
- - [Fast Fourier Transform](#fast-fourier-transform)
|
|
|
|
- - [Bloom Filter](#bloom-filter)
|
|
|
|
|
|
+- [추가 도서](#additional-books)
|
|
|
|
+- [추가 주제](#additional-learning)
|
|
|
|
+ - [컴파일러](#compilers)
|
|
|
|
+ - [부동 소수점 수](#floating-point-numbers)
|
|
|
|
+ - [유니코드](#unicode)
|
|
|
|
+ - [엔디언](#endianness)
|
|
|
|
+ - [Emacs 와 vi(m)](#emacs-and-vim)
|
|
|
|
+ - [유닉스 명령어 도구](#unix-command-line-tools)
|
|
|
|
+ - [정보 이론](#information-theory)
|
|
|
|
+ - [패리티 & 해밍코드](#parity--hamming-code)
|
|
|
|
+ - [엔트로피](#entropy)
|
|
|
|
+ - [암호기법](#cryptography)
|
|
|
|
+ - [압축](#compression)
|
|
|
|
+ - [네트워크](#networking) (if you have networking experience or want to be a systems engineer, expect questions)
|
|
|
|
+ - [컴퓨터 보안](#computer-security)
|
|
|
|
+ - [가비지 콜렉션](#garbage-collection)
|
|
|
|
+ - [병렬 프로그래밍](#parallel-programming)
|
|
|
|
+ - [메세징, 직렬화, 그리고 큐잉 시스템](#messaging-serialization-and-queueing-systems)
|
|
|
|
+ - [고속 푸리에 변환(FFT)](#fast-fourier-transform)
|
|
|
|
+ - [블룸 필터](#bloom-filter)
|
|
- [HyperLogLog](#hyperloglog)
|
|
- [HyperLogLog](#hyperloglog)
|
|
- [Locality-Sensitive Hashing](#locality-sensitive-hashing)
|
|
- [Locality-Sensitive Hashing](#locality-sensitive-hashing)
|
|
- - [van Emde Boas Trees](#van-emde-boas-trees)
|
|
|
|
|
|
+ - [van Emde Boas 트리](#van-emde-boas-trees)
|
|
- [Augmented Data Structures](#augmented-data-structures)
|
|
- [Augmented Data Structures](#augmented-data-structures)
|
|
- - [Tries](#tries)
|
|
|
|
|
|
+ - [트라이(Tries)](#tries)
|
|
- [N-ary (K-ary, M-ary) trees](#n-ary-k-ary-m-ary-trees)
|
|
- [N-ary (K-ary, M-ary) trees](#n-ary-k-ary-m-ary-trees)
|
|
- - [Balanced search trees](#balanced-search-trees)
|
|
|
|
- - AVL trees
|
|
|
|
- - Splay trees
|
|
|
|
- - Red/black trees
|
|
|
|
- - 2-3 search trees
|
|
|
|
- - 2-3-4 Trees (aka 2-4 trees)
|
|
|
|
- - N-ary (K-ary, M-ary) trees
|
|
|
|
- - B-Trees
|
|
|
|
- - [k-D Trees](#k-d-trees)
|
|
|
|
- - [Skip lists](#skip-lists)
|
|
|
|
- - [Network Flows](#network-flows)
|
|
|
|
- - [Disjoint Sets & Union Find](#disjoint-sets--union-find)
|
|
|
|
- - [Math for Fast Processing](#math-for-fast-processing)
|
|
|
|
- - [Treap](#treap)
|
|
|
|
- - [Linear Programming](#linear-programming)
|
|
|
|
- - [Geometry, Convex hull](#geometry-convex-hull)
|
|
|
|
- - [Discrete math](#discrete-math)
|
|
|
|
- - [Machine Learning](#machine-learning)
|
|
|
|
|
|
+ - [균형 탐색 트리](#balanced-search-trees)
|
|
|
|
+ - AVL 트리
|
|
|
|
+ - Splay 트리
|
|
|
|
+ - 레드블랙 트리(RBT)
|
|
|
|
+ - 2-3 탐색 트리
|
|
|
|
+ - 2-3-4 트리(aka 2-4 트리)
|
|
|
|
+ - N-ary (K-ary, M-ary) 트리
|
|
|
|
+ - B-트리
|
|
|
|
+ - [k-D 트리](#k-d-trees)
|
|
|
|
+ - [스킵 리스트](#skip-lists)
|
|
|
|
+ - [네트워크 플로우(유량)](#network-flows)
|
|
|
|
+ - [분리집합 & 유니온 파인드(Disjoint Sets & Union Find)](#disjoint-sets--union-find)
|
|
|
|
+ - [빠른 프로세싱을 위한 수학](#math-for-fast-processing)
|
|
|
|
+ - [트립](#treap)
|
|
|
|
+ - [선형 계획법](#linear-programming)
|
|
|
|
+ - [기하학, 볼록 껍질](#geometry-convex-hull)
|
|
|
|
+ - [이산수학](#discrete-math)
|
|
|
|
+ - [기계학습](#machine-learning)
|
|
- [Go](#go)
|
|
- [Go](#go)
|
|
-- [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
|
|
|
|
-- [Video Series](#video-series)
|
|
|
|
-- [Computer Science Courses](#computer-science-courses)
|
|
|
|
|
|
+- [몇몇 주제에 대한 세부사항](#additional-detail-on-some-subjects)
|
|
|
|
+- [영상 자료](#video-series)
|
|
|
|
+- [컴퓨터 과학 강좌](#computer-science-courses)
|
|
|
|
|
|
---
|
|
---
|
|
|
|
|