README-bn.md 279 KB

#
> - , > grew , [
> ] (https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)! > d , d
> > 8-12 d : [ 8 - ] (https://medium.freecodecamp.org/why-i-studied-full-time-for-8-months-for-a-google -cc662ce9bb13) > > , > : , , d
> > * ! * <details> <summary> : </summary> -[ -Ne Hr,g] ( / README-cn.md) -[ - ] ( / - . ) -[ ] ( / README-es.md) -[ ] ( / README-ptbr.md) </details> <details> <summary> : </summary> -[ 9 ? ( M & @ ] ( 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/87) -[ ] (https://github.com/jwasham/coding-interview-university/issues/106) -[ ( \m )] (https://github.com/jwasham/coding-interview-university/issues/118) -[ ] (https://github.com/jwasham/coding-interview-university/issues/117) -[ ] (https://github.com/jwasham/coding-interview-university/issues/122) -[ ] (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) -[ ( e,g)] (https://github.com/jwasham/coding-interview-university/issues/257) </details> ## ? ( - , ) d
! [ - ] (https://d3j2pkmjtin6ou.cloudfront.net/coding-at-the-whiteboard-silicon-valley.png) ** **
/ ( )d
, d
/ , , / d
list ( , ) d
--- ##
-[ ?] (# - ) -[ ?] (# - - - ) -[ ] (# - - - ) -[ ] (# - - - - - ) -[ ] (# - - ) -[ ] (# - - - - ) -[ ] (# - - - - ) -[ ] (# - ) -[ ] (# - - ) -[ ] (# - - - - ) -[ ] (# - ) -[ ] (# - ) -[ / - / ] (# - - - - - ) -[ ] (# - ) -[ ] (# ) -[ ] (# - ) -[ ] (# ) -[ ] (# ) -[ ] (# - ) -[ ] (# - ) -[ ] (# - ) -[ ] (# - ) -[ ] (# ) -[ - ] (# - - ) -[ : ] (# - - - ) -[ / / ] (# - - - - ) - ( , ) - : , , , ,
-[ ] (# - ) -
-
-
-quicksort -
-[ ] (# ) -
-
-
-
- : ,
-[ ] (# - - ) -[ ] (# ) -[ ] (# - ) -[ - ] (# - - ) -[ ] (# - ) -[ ( ) ] (# - - - - ) -[ , - ] (# - - - - - ) -[ ] (# ) -[ ] (# - - ) -[ ] (# ) -[ ] (# ) -[ ] (# - - ) -[ ] (# ) -[ ] (# - ) -[ ] (# ) -[ ] (# ) -[ ] (# ) -[ , , ] (# - - - - ) ( 4+ ) -[ ] (# - ) -[ ] (# - - ) -[ / ] (# - ) -[ ] (# - - - - ) -[ ] (# - ) -[ ] (# - - - - - - ) -[ ] (# - - - ) -[ ] (# - - - ) ---------------- al ---------------- <details> <summary> </summary> -[ ] (# - ) -[ ] (# - ) -[ ] (# ) -[ ( )] (# ) -[ ] (# - - - ) -[ ] (# - - ) -[ ] (# - - - ) -[ ] (# ) -[ ] (# ) -[ ] (# ) -[ ] (# - ) -[ ] (# - ) -[ ] (# - ) -[ , , ] (# - - - - ) -[ *] (# ) -[ ] (# - - ) -[ ] (# - ) -[ ] (# ) -[ - ] (# - - ) -[ ] (# - - - ) -[ ] (# - - ) -[ ] (# - - ) -
-
- /
-2-3
- - - ( - ) - - ( - , - )
- -
-[ ] (# - ) -[ ] (# - ) -[ ] (# - ) -[ ] (# - - - ) -[ ] (# - - - ) -[ ] (# ) -[ ] (# - - ) -[ , ] [# - - - ) -[ ] (# - ) -[ ] (# - ) -[ ] (# - - - - - ) -[ ] (# - ) -[ ] (# - - ) -[ ] (# ) </details> --- ## ? , , - ,
d , d

d
" , I've
, d
d d d
##
<details> <summary> </summary> d
d
** , : [x] **
git checkout-b progress git remote add jwasham https://github.com/jwasham/coding-interview-university git fetch--all
git add . git commit-m "Marked x" git rebase jwasham/master git push--force [ - ] (https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown) </details> ##
- , d
-[ ] (https://www.youtube.com/watch?v=0SARbwvhupQ) -[ : ] [https://www.youtube.com/watch?v=1i8ylq4j_EY) -[ ] (http://www.aaronsw.com/weblog/dweck) -[ ? , ] (https://www.youtube.com/watch?v=uPOJ1PR50ag) ##
d d
, d
d
d
##
<details> < > </summary> -[] [ : ] (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-Witeboarding-during-programming-interviews/) -[] [ ] (https://www.youtube.com/watch?v=N233T0epWTs) -[] 1: -[] [ - ( )] (https://www.youtube.com/watch?v=rEJzOhC5ZtQ) -[] [ ( ) ] [https://www.youtube.com/watch?v=aClxtDcdpsQ) -[] 4 ? -[] [ 4 - , , ( )] (https://www.youtube.com/watch?v=YJZCUhxNCv8) -[] : -[] [ ( )] (https://www.udemy.com/software-engineer-interview-unleashed): - d
-[] [ , ! ( )] (https://www.udemy.com/python-for-data-structures-algorithms-and-interviews/): - , , d
-[] [ ! ( )] (https://www.udacity.com/cH13/data-structures- -algorithms-in-python--ud513): - d
-[] [ ! ( )] (https://www.udacity.com/course/data-structures- -algorithms-nanodegree--nd256): -100 d
</details> ##
: - ++ -
-
d : -
-
: [ ] (https://startupnextdoor.com/important-pick-one-language-for-tod- - /) d
: -http://www.byte-by-byte.com/choose-the-right-language-for-your-coding-interview/ -http://blog.codingforinterviews.com/best-programming-language-jobs/ [ ] ( - - . ) , ++ , d , d
##
d d
###
-[] [ : , ] (https://www.amazon.com/Programming-Interviews- - - / / 111941847X/) - ++
-
- , ( ) -[] [ , 6th ] (http://www.amazon.com/Cracking-Coding-Interview-6th- / /0984782850/) -
<details> <summary> </ > : -[] [ ( ++ )] (https://www.amazon.com/ - - - - / / 1479274836) -[] ( ) -[ ] (https://www.amazon.com/ - - - - / / 1517435803/) -[ - ] (https://github.com/gardncl/eitions-of-programming-inviewview) </details> ###
-[] [ : : ] (https://www.amazon.com/Write-Great-Code-Unders - / / 1593270038) - 2004 d
- [ ] (https://en.wikedia.org/wiki/High_Level_As  6 @ 0 M 5 > & ), - d , d
- : <details> <summary>...... </summary> - -
- 3-
- 4- -
- 5-
- 6-
- 7-
- 9-
- 10-
- 11-
</details> ###
** ( ) * ** d d d
d
** ** d
[ - ]] ( - - . ) ### ++ <details> <summary> ++ </summary> , d d
-[] [ ++ , 1-4: , , , ] (https://www.amazon.com/Algorithms-Partts-1-4-Fundamentals- / dp/0201350882/) -[] [ ++ 5 : ] (https://www.amazon.com/Algorithms-Part-Graph-3rd-Pt-5/dp/0201361183/) ++ d d
</details> ###
<details> <summary> </summary> -[] [ ( )] (https://www.amazon.com/Algorithms-4th- - / dp/032157351X/) - ( !) : -[ ] (https://www.coursera.org/learn/algorithms-part1) -[ II] (https://www.coursera.org/learn/algorithms-part2) : -[] [ ] (https://www.amazon.com/Data-Structures-Algorithms-Michael- /dp/1118771338/) - , ,
- text
- d d
</details> ###
<details> <summary> </summary> -[] [ ] (https://www.amazon.com/Structures- - - - / / 1118290275/) - , ,
- d d
-
- : https://startupnextdoor.com/book-report-data-structures- -algorithms-in-python/ </details> ##
, , d
d
###1.
d 3
d
: [ ] (https://startupnextdoor.com/retaining-computer-s 5 ?  M  > ( - /) ###2.
, 2 : d
d
d
: -[ ] (https://github.com/jwasham/computer-science-flash-cards) -[ ( -1200 )] (https://github.com/jwasham/computer-s M  > ( -flash-cards/blob/master/cards-jwasham.db): -[ ( -1800 )] (https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham-extreme.db): d d
** : ** d
d
. ' [ ] (http://ankisrs.net/), d d
- , d 25 d
: https://ankiweb.net/shared/info/25173560 ( [@ ] (https://github.com/xiewenya)) ###3. , ,
ASCII, , - d d
d
###4.
d d
##
: -
-
- , -
##
, d d
, : - - * d
- ++-
- ++- STL std ::
- - ( )
- , ()
- , d
d [ ] (# - )d ? - , , , ( ) - ( / ( )) - - ( ) d
: -[ ] (https://github.com/jwasham/pH   -c) -[ ++] (https://github.com/jwasham/pH   -cpp) -[ ] (https://github.com/jwasham/pH   -python) d
, d d d
##
<details> < > << > -[] ** **
- d , , , * * d
-[] [ , ] (https://www.amazon.com/Programming-Language- - - /dp/0131103628) - ,
d d
-[ ] (https://github.com/lekkas/c-algorithms) -[] ** : ** -[] [ ( ) ]] (https://www.youtube.com/watch?v=XM4lGflQFvA) -[] [ -ALU ( )] (https://youtu.be/1I5ZMmrOfnA) -[] [ ( )] (https://youtu.be/fpnE6UAfbtU) -[] [ ( ) ( )] (https://youtu.be/FZGugFqdr60) -[] [ ( )] (https://youtu.be/zltgXvg6r3k) </details> ## / - /
<details> < > / - / </ > -
- d d d
- d
-[] [ 50- ( )] (https://www.youtube.com/watch?v=iOq5kSKqeR4) -[] [ ( ) ( )] (https://www.youtube.com/watch?v=V6mKVRU1evU) -[] [ ( )- ( )] (https://www.youtube.com/watch?v=ei-A_wy5Yxw&index=2&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN) -[] : -[ ] (https://www.youtube.com/watch?v=gSyDMtdPNpU&index=2&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) -[ ] (http://www3.cs.stonybrook.edu/~algorith/video-lectures/2007/lecture2.pdf) -[] [ ] (http://discrete.gr/complexity/) -[] [ ( )] (https://www.coursera.org/lecture/algorithmic-thinking-1/orders-of-growth-6PKkX) -[] [ ( )] (https://www.coursera.org/lecture/algorithmic- -1/asyptics-bXAtM) -[] [ ( )] (https://archive.org/details/ucberkeley_webcast_VIS4YDpuP98) -[] [ ( )] (https://archive.org/details/ucberkeley_webcast_ca3e7UVmeUc) -[] [ ( )] (https://www.youtube.com/watch?v=B3SpQZaAZP4&index=10&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN) -[] [ " " ( )] (https://www.coursera.org/lecture/algorithmic-thinking-1/illustrating-big-o-YVqzv) -[] ( ): -[ : 1] (https://www.topcoder.com/commune/competitive-pramramming/tutorials/computational-complexity-section-1/) -[ : 2] (https://www.topcoder.com / / - / / - - / ) -[] [ ] (http://bigocheatsheet.com/) </details> ##
<details> < > </summary> -###
- d
-[] : -[ ( )] (https://www.coursera.org/learn/data-structures/ //sBSF/arrays) -[ 61 - - ( )] (https://archive.org/details/ucberkeley_webcast_Wp8oiO_CZZE) (15m 32s ) -[ ( )] (https://archive.org/details/0102WhatYouShouldKnow/02_04-basicArrays.mp4) -[ ( )] (https://archive.org/details/0102What youShouldKnow/02_05- . 4) -[ ( )] (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- . 4) -[ ( )] (https://archive.org/details/0102WhatYouShouldKnow/03_01-resizableArrays.mp4) -[] ( ): -[] , th -[]
- ,
-16 , 2-16, 32, 64, 128
-[] ()-
-[] ()-
-[ ] () -[] ( )- ,
-[] ( ) -[] ( , )- ,
-[] ( )- 0
-[] ()- ,
-[] ( )- ,
-[] ( )- ( ) -[] ( )- ,-
-[] ( _ ) //
- ,
- , 1/4
-[]
- (1) / ( ),
- ( ) /
-[]
-
- = ( , > = ) * , 2n ( ) -###
-[] : -[] [ ( )] (https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists) -[] [ 61 - 1 ( )] (https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0) -[] 61 - 2 ( )] (https://archive.org/details/ucberkeley_webcast_-c4I3gFYe3w) -[] [ ( )] (https://www.youtube.com/watch?v=QN6FPiD0Gzo) - , d
-[] : -[ ( )] (https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/rjBs9/core-linked-lists-vs-arrays) -[ ( )] (https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/QUaUd/in-the-real-world-lists-vs-arrays) -[] [ ( ) ]] (https://www.youtube.com/watch?v=YQs6IC-vgmo) -[] : : ( ) d d d
-[ ] (https://www.eskimo.com/~scs/cclass/int/sx8.html) -[] ( ): -[] ()-
-[] ()-
-[] _ ( )- ( 0 ) -[] _ ( )-
-[] _ ()-
-[] _ ( )-
-[] _ ()-
-[] ()-
-[] ()-
-[] ( , )- ,
-[] ( )- s -[] _ _ _ ( )-
-[] ()-
-[] _ ( )-
-[]
-[ ( )] (https://www.coursera.org/learn/data-structures/lecture/jpGKD/doubly-linked-lists) -
-###
-[] [ ( )] (https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks) -[] [ - ( )] (https://archive.org/details/0102WhatYouShouldKnow/05_01-Stacks forLast-inFirst-out.mp4) -[]] d d
-###
-[] [ ( )] (https://archive.org/details/0102WhatYouShouldKnow/05_03-usingQueuesForFirst-inFirst-out.mp4) -[] [ ( )] (https://www.coursera.org/lecture/data-structures/queues-EShpq) -[] [ / ] (https://en.wikedia.org/wiki/Circular_buffer) -[] [ ( )] (https://archive.org/details/0102WhatYouShouldKnav/05_04-priorityQueuesAndDeques.mp4) -[] - : - ( )-
- ()- ( )
- () -[] : - ( )-
- ()-
- () - () -[] : - tail O (n) ,
- : (1) ( , [ ]) - : (1) ( ) - : O (1) ( ) -###
-[] : -[] [ ( )] (https://www.youtube.com/watch?v=0M_kIqhwbFo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=8) -[] [ , - ( )] (https://www.youtube.com/watch?v=BRO7mVIFt08&index=9&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) -[] [ , ( )] (https://www.youtube.com/watch?v=rvdJDijO2Ro&index=10&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) -[] [ : ( )] (https://www.youtube.com/watch?v=C4Kc8xzcA68) -[] [( ) : ( )] (https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11) -[] [( ) ( )] (https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEWKD-NbwZ4ezj7gyc_3yNrojKM9&index=4) -[] : -[] [ ( )] (https://archive.org/details/0102WhatYouShouldKnow/06_02- . 4) -[] [ ( ) ] (https://archive.org/details/0102WhatYouShouldKnow/06_03-USHashTables.mp4) -[] [ ( ) ] (https://archive.org/details/0102WhatYouShouldKnow/06_04-SupportingHashing.mp4) -[] [ ( )] (https://archive.org/details/0102WhatYouShouldKnow/06_05-languageSupportForHashTables.mp4) -[] [ ( )] (https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables) -[] [ ( )] (https://www.coursera.org/learn/data-structures/home/week/3) -[] [ ( )] (https://www.coursera.org/learn/data-structures/ / NYZZP/ iPhone-book- ) -[] : -[ ( )] (https://www.coursera.org/learn/data-structures/lecture/DvaIb/instant-uploads-and-stores-optimization-in-rodbox) -[ ( )] (https://www.coursera.org/learn/data-structures/lecture/tvH8H/distributes-hash-tables) -[]
- ( , )-
- ( , )-
- ( ) - ( ) - ( ) </details> ##
<details> <summary> << > -###
-[] [ ( )] (https://www.youtube.com/watch?v=D5SrAga1pno) -[] [ ( )] (https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search) -[] [ ] (https://www.topcoder.com/commune/competitive-programming/tutorials/binary-search/) -[] : - ( ) -
-###
-[] [ ] (https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/bit-cheat-sheet.pdf)- 2 (2 ^ 1 2 ^ 16 2 ^ 32) -[] : &, |, ^, ~, >> >> << -[] [ ] (https://en.wikedia.org/wiki/Word_ ( _ )) -[] : [ ( )] (https://www.youtube.com/watch?v=7jkIUgLC29I) -[] [ 2-10: ( )] (https://www.youtube.com/watch?v=d0AwjSpNXR0) -[] [ ] (https://en.wikedia.org/wiki/Bit_manipulation) -[] [ ] (https://en.wikedia.org/wiki/ _ ) -[] [ ] (https://ographicics.stanford.edu/~seender/bithacks.html) -[] [ ] (https://bit.stephan-brumme.com/) -[] [ ] (https://bit.stephan-brumme.com/interactive.html) -[] 2 1
-[ : ( ' ) ( )] (https://www.youtube.com/watch?v=lKTsv6iVxV4) -[ ] (https://en.wikedia.org/wiki/Ones%27_complement) -[2 ] (https://en.wikedia.org/wiki/Two%27s_complement) -[]
-[ ( ) 4 ] (https://youtu.be/Hzuzo9NJrlc) -[ ) (https://ographicics.stanford.edu/~seender/bithacks.html#CountBitsSetKernighan) -[32 ] (http://stackoverflow.com/questions/109023/how-to-count-the-number-of-set- -in-a-32- - ) -[] 2 : -[ ' ] (https://bit.stephan-brumme.com/roundUpToNextPowerOfTwo.html) -[[] : -[ (https://bit.stephan-brumme.com/swap.html) -[] : -[ ] (https://bit.stephan-brumme.com/absInteger.html) </details> ##
<details> <summary> </summary> -### -
-[] [ : ( )] (https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees) -[] [ : ( )] (https://www.coursera.org/learn/data-structures/ / 95qda/trees) -
-traversal -
-[] [ ( ) ( - ) ( )] (https://www.youtube.com/watch?v=uWL6FJhq5fM) - : - ( , ) - : ( ) - : : O (1), : O (n / 2) = O (n) - : - : ( ) - : : ( )- d
: ( ) - ( : , , ) - ( : , , ) - ( : , , ) -### :
-[] [ ( )] (https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) -[] [ ( )] (https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/p82sw/core-intr ~J/'H'1-to-binary-search-trees) -
-[] [ ( )] (https://www.coursera.org/learn/data-structures/lecture/E7cXP/intr ~J/'H'1) -[] [ ( )] (https://www.youtube.com/watch?v=9Jry5-82I68) - / ++: -[] [ - / ++ ( ) ]] (https://www.youtube.com/watch?v=COZK7NATh4k&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=28) -[] [ - ( ) ] (https://www.youtube.com/watch?v=hWokyBoo0aI&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=29) -[] [ ( )] (https://www.youtube.com/watch?v=Ut90klNN264&index=30&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) -[] [ ( )] (https://www.youtube.com/watch?v=_pnqMz5nrRs&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=31) -[] [ - ( )] (https://www.youtube.com/watch?v=9RHO6jU--GU&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=32) -[] [ : ( )] (https://www.youtube.com/watch?v=86g8jAQug04&index=33&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) -[] [ : , , ( )] (https://www.youtube.com/watch?v=gm8DUJJhmY4&index=34&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) -[] [ ( ) ] (https://www.youtube.com/watch?v=yEwSGhSsT0U&index=35&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) -[] [ ( ) ] (https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36) -[] [ ( )] (https://www.youtube.com/watch?v=5cPbNCrdotA&index=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) -[] : -[] //
-[] get_node_count //
-[] _ //
-[] _
-[[] is_in_tree // returns -[] get_height // ( 1) -[] get_min //
-[] get_max // returns -[] ' _ _ _
-[] _
-[] get_successor // - ,-1
-### / /
- , ( , ) -[] [ ] (https://en.wikedia.org/wiki/Heap_ ( _ )) -[] [ ( )] (https://www.coursera.org/learn/data-structures/ / 2 / ) -[] [ ( )] (https://www.coursera.org/learn/data-structures/lecture/z3l9N/naive- ) -[] [ ( )] (https://www.coursera.org/learn/data-structures/ / 2 / - ) -[] [ ( )] (https://www.coursera.org/learn/data-structures/supplement/S5xxz/tree-height-remark) -[] [ ( )] (https://www.coursera.org/learn/data-structures/lecture/0g1dl/basic-operation) -[] [ ( )] (https://www.coursera.org/learn/data-structures/lecture/gl5Ni/ - - ) -[] [ ( )] (https://www.coursera.org/learn/data-structures/  K # / HxQo9/pseudocode) -[] [ - ( )] (https://youtu.be/odNJmw5TOEE?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3291) -[] [ ( )] (https://www.coursera.org/learn/data-structures/lecture/hSzMO/heap-sort) -[] [ ( )] (https://www.coursera.org/learn/data-structures/lecture/dwrOS/building-a-heap) -[] [ : ( )] (https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) -[] [ 61 24: ( )] (https://archive.org/details/ucberkeley_webcast_yIUFT6AKBGE) -[] [ ( )] (https://www.youtube.com/watch?v=MiyLo8adrWw) -[] : -[] sert
-[] _ -.
-[] get_max-
-[] get_size ()-
-[] is_empty ()-
-[] extract_max-
-[] - _ needed -[] (i)-
-[] - _
-[] _ ()-
- : , ( )d </details> ##
<details> <summary> </summary> -[ ] : - / , : - - - (n ^ 2), <= 16
-[] (" ?") -[ ) (https://en.wikedia.org/wiki/Sorting_algorithm#Stability) -[ ] (http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms) -[ ] (http://www.geeksforgeeks.org/stability-in-sorting-algorithms/) -[ - ] (http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/stability.pdf) -[] ? ? ? - , d
-[ ] (http://www.geeksforgeeks.org/ - - - /) - , d d
-[] [ - ( )] (https://www.coursera.org/learn/algorithms-part1/home/week/3) -[] [ d Mergesort] (https://www.coursera.org/learn/algorithms-part1/lecture/ARWDq/mergesort) -[] [ d ] (https://www.coursera.org/learn/algorithms-part1/lecture/PWNEl/bottom-up-3Esort) -[] [3d ] (https://www.coursera.org/learn/algorithms-part1/lecture/xAltF/sorting-complexity) -[] [ d Comparators] (https://www.coursera.org/learn/algorithms-part1/lecture/9FYhS/comparators) -[] [ d ] (https://www.coursera.org/learn/algorithms-part1/lecture/pvvLZ/stability) -[] [ - (4 )] (https://www.coursera.org/learn/algorithms-part1/home/week/3) -[] [ d Quicksort] (https://www.coursera.org/learn/algorithms-part1/lecture/vjvnC/quicksort) -[] [ d ] (https://www.coursera.org/learn/algorithms-part1/lecture/UQxFT/selection) -[] [3d ]] (https://www.coursera.org/learn/algorithms-part1/lecture/XvjPd/d ate-keys) -[] [ d ] (https://www.coursera.org/learn/algorithms-part1/lecture/QBNZ7/system-sorts) -[] : -[] [ 61 29: ( )] (https://archive.org/details/ucberkeley_webcast_EiUvYS2DT6I) -[] [ 61 30: II ( )] (https://archive.org/details/ucberkeley_webcast_2hTY3t80Qsk) -[] [ 61 32: III ( )] (https://archive.org/details/ucberkeley_webcast_Y6LOLpxg6Dc) -[] [ 61 33: ( )] (https://archive.org/details/ucberkeley_webcast_qNMQ4ly43p4) -[] [ ( )] (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) -[] [ ( )] (https://www.youtube.com/watch?v=c4BRHC7kTaQ&index=2&list=PL89B61F78B552C1AB) -[] [ ( )] (https://www.youtube.com/watch?v=GCae1WNvnZM&index=3&list=PL89B61F78B552C1AB) -[] [ ( )] (https://www.youtube.com/watch?v=y_G9BkAm6B8&index=4&list=PL89B61F78B552C1AB) -[] [ ( )] (https://www.youtube.com/watch?v=6nDMgr0-Yyo&index=8&list=PL89B61F78B552C1AB) -[] : -[] [ ( ) ] (http://www.cs.yale.edu/homes/aspnes/classes/223/example/sorting/ sort.c) -[] [ ( ) ]] (https://github.com/jwasham/pH   -python/blob/master/lays_sort/ 5 ? 8 _ . ) -[] [ - ( ++)] (https://github.com/jwasham/pH   -cpp/blob/master/ 5 ? 8 _ / _ . ) -[] : -[] [ ( )] (http://www.cs.yale.edu/homes/aspnes/class/223/exults/randomization/quick.c) -[] [ ( )] (https://github.com/jwasham/pH   -c/blob/master/quick_sort/quick_sort.c) -[] [ ( )] (https://github.com/jwasham/pH   -python/blob/master/quick_sort/quick_sort.py) -[] : -[] : ( ) case -[] ( )
- ( ^ 2)
- , d
-[] , : -[] [ - (6 )] (https://www.coursera.org/learn/algorithms-part2/home/week/3) -[] [ d (https://www.coursera.org/learn/algorithms-part2/lecture/vGHvb/strings-in-java) -[] [ d ] (https://www.coursera.org/learn/algorithms-part2/lecture/2pi1Z/key-indexed-counting) -[] [3d ] (https://www.coursera.org/learn/algorithms-part2/lecture/c1U7L/lsd-radix-sort) -[] [ d ] (https://www.coursera.org/learn/algorithms-part2/lecture/gFxwG/msd-radix-sort) -[] [ d 3 ] (https://www.coursera.org/learn/algorithms-part2/lecture/crkd5/3-way-radix-quicksort) -[] [d d ] (https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays) -[] [ ] (http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#radixSort) -[] [ ( )] (https://www.youtube.com/watch?v=xhr26ia4k38) -[] [ , ( ) ( )] (https://www.youtube.com/watch?v=Nz1KZXbghj8&index=7&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) -[] [ : , , ( )] (https://www.youtube.com/watch?v=cNB2lADK3_s&index=8&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) -[] [ ( )] (https://www.youtube.com/watch?v=pOKy3RZbSws&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=14) , [ ] (https://www.youtube.com/watch?v=kPRA0W1kECg) d
, [ ] " " ( - - - ) </details> ##
<details> <summary> </summary> , , d
- : - 4 : -
-
-
-
- &
- - ,
- , - , d
-[] ( ): -[] [ - ] (https://www.youtube.com/watch?v=s-CYnVz-uh4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=13) -[] [ - ] (https://www.youtube.com/watch?v=AfSk24UTFS8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=14) -[] - : -[] [ 373 2012- 11- ( )] (https://www.youtube.com/watch?v=OiXxhDrFruw&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=11) -[] [ 373 2012- 12- - ( )] (https://www.youtube.com/watch?v=g5vF8jscteo&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=12) -[] [ 373 2012- 13- ( )] (https://www.youtube.com/watch?v=S23W6eTcqdY&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=13) -[] [ 373 2012- 14- ( ) ( )] (https://www.youtube.com/watch?v=WitPBKGV0HY&index=14&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) -[] [ 373 2012- 15- ( 2) ( )] (https://www.youtube.com/watch?v=ia1L30l7OIg&index=15&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) -[] [ 373 2012- 16- (3 ) ( )] (https://www.youtube.com/watch?v=jgDOQq6iWy8&index=16&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) -[] ( ): -[] [00. ( )] (https://www.youtube.com/watch?v=Aa2sqUhIn-E&index=15&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) -[] 6.. ( )] (https://www.youtube.com/watch?v=2E7MmKv0Y24&index=16&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) -[] [6.006 - ( )] (https://www.youtube.com/watch?v=ozsuci5pIso&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=17) -[] [00. ( ) ] (https://www.youtube.com/watch?v=CHvQ3q_gJ7E&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=18) -[] [ : - , , - 6 ( )] (https://www.youtube.com/watch?v=i_AQT_XfvD8&index=6&list=PLFDnBGSyx3C3x1C3u3 -[] [ : - , , , - (( )] (https://www.youtube.com/watch?v=ufj5_bppBsA&list=PLFDnELG9dpVxQCxu7-9BSy2&yndy ) -[] [ : III: - 8 ( )] (https://www.youtube.com/watch?v=DiedsPsMKXc&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=8) -[] [ : : - 9 ( )] (https://www.youtube.com/watch?v=XIAQRlNkJAw&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=9) -[] ~~ [ 61 2014 (58:09 ) ( )] (https://youtu.be/dgjX4HdMI-Q?list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&t=3489) ~~ -[] [ 61 2014: ( )] (https://archive.org/details/ucberkeley_webcast_zFbq8vOZ_0k) -[] [ : ( )] (https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) -[] [ r ( )] (https://www.youtube.com/watch?v=RpgcYiky7uw) - : -[] [ ( )] (https://www.coursera.org/learn/algorithms-on- / / ) - : -[] ( ) -[] ( ) -[] ( ) -[] ( ) -[]
-[]
-[] ( ) -[]
- - ( ): -[] ( , ) -[]
-[]
-[] strongly
-[]
</details> ##
<details> <summary> << > -###
-[] : -[] [ 8 | ( )] (https://www.youtube.com/watch?v=gl3emqCuueQ&list=PLFE6E58F856038C69&index=8) -[] [ 9 | ( )] (https://www.youtube.com/watch?v=uFJhEPrbycQ&list=PLFE6E58F856038C69&index=9) -[] [ 10 | ( )] (https://www.youtube.com/watch?v=NdF1QDTRkck&index=10&list=PLFE6E58F856038C69) -[] [ 11 | ( )] (https://www.youtube.com/watch?v=p-gpaIGRCQI&list=PLFE6E58F856038C69&index=11) -
- ? -[] [ ?] (Https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad) -[] [ ( )] (https://www.youtube.com/watch?v=L1jjXGfxozc) -###
- , d
- , d
- understanding d
-[] : -
-[] [ : 373 2012- 19- ( )] (https://youtu.be/Qc2ieXRgR0k?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=1718) -[] [ : 373 2012- 20- ( )] (https://youtu.be/IsmMhMdyeGY?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=2749) -[] [ : 373 2012- 21- ( )] (https://youtu.be/o0V9eYF4UI8?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=406) -[] [ : 373 2012- 22- ( )] (https://www.youtube.com/watch?v=dRbMC1Ltl3A&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=22) -[] [ : 0 (59:18 ) ( )] (https://youtu.be/J5aJEcOr6Eo?list=PLFDnelG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3558) -[] [ : - 11 ( )] (https://www.youtube.com/watch?v=0EzHjQ_SOeU&index=11&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) -[] [ : II- 12 ( )] (https://www.youtube.com/watch?v=v1qiRwuJU7g&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=12) -[] ( ): [ ( )] (https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr) -[] : -[] [ ] (http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#dynamic ) -[] : -[] [ ( )] (https://www.coursera.org/learn/algorithmic-thinking-2/ / 80RrW/the-rna-secondary- - ) -[] [ ( )] (https://www.coursera.org/learn/algorithmic-thinking-2/lecture/PSonq/a-dynamic-programming-algorithm) -[] [ ( ) ] (https://www.coursera.org/learn/algorithmic-thinking-2/lecture/oUEK2/illustrating-the-dp-algorithm) -[] [ ( )] (https://www.coursera.org/learn/algorithmic-thinking-2/lecture/nfK2r/running-time-of-the-dp-algorithm) -[] [ ( )] (https://www.coursera.org/learn/algorithmic-thinking-2/lecture/M999a/dp-vs-recursive- ) -[] [ ( )] (https://www.coursera.org/learn/algorithmic-thinking-2/lecture/UZ7o6/global-pairwise-sequence-alignment) -[] [ ( )] (https://www.coursera.org/learn/algorithmic-thinking-2/lecture/WnNau/local-pairwise-sequence-alignment) -###
-[] ption : . ( )] (https://www.youtube.com/watch?v=OkC7HKtiZC0&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc) -[] - : (21 ): - OO OO d
-[ : ( )] (https://www.youtube.com/playlist?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO) -[] : -[] [ ( )] (https://www.youtube.com/watch?v=TMuno5RZNeE) -[] [ ( )] (https://www.youtube.com/playlist?list=PL4CE9F710017EA77A) -[] -[ ] (http://www.oodesign.com/single- - html) | [ ] (http://www.javacodegeeks.com/2011/11/solid-single- - - html) -[ ] (https://docs.google.com/open?id=0ByOwmqah_nuGNHEtcU5OekdDMkk) -[] -[ / ] (http://www.oodesign.com/open-close-pr5HDle.html) | [ ] (https://en.wikedia.org/wiki/Open/closed_pr5HD) -[ ] (http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BWCYaYDn8EgN2M5MTkwM2EtNWFkZC00ZTI3LWFjZTUTNThhGG1Y&hzGiY) -[] -[ ] (http://www.oodesign.com/liskov-s-substedia-pr5HDle.html) | [ ' ' ] (http://stackoverflow.com/questions/56860/ -is-the-liskov-subst / G 6 B - ) -[ ] (http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BWCYaYDn8EgNzAzZjA5ZmItNjU3NS00MzQ5LTkwYjMtTDhhenU5ZZll55) -[] -[ ] (http://www.oodesign.com/interface-segregation-pr5HDle.html) |
-[5 ( )] (https://www.youtube.com/watch?v=3CtAfl7aXAQ) -[ ] (http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BWCYaYDn8EgOTViYjJhYzMtMzYxMC00MzFjLWJjMzYtOGJiMDc5i&jdc5i&jdc5i) -[] -[ ] (http://www.oodesign.com/d dependency-inversion-pr5HDle.html) | d
-[ ] (http://stackoverflow.com/questions/62539/ - - - - - - - - - ) -[ ] (http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BWCYaYDn8EgMjdlMWIzNGUtZTQ0NC00ZjQ5LTkwYzQtZjhhddlljrhmdlljrhmdlljdlmljrlm
0
-###
-[] [ ( )] (https://www.youtube.com/watch?v=3cmzqZzwNDM&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc&index=3) -[] : -[]
-[]
-[]
-[]
-[]
-[]
-[] ,
-[]
-[]
-[]
-[]
-[]
-[ ]
-[]
-[]
-[]
-[]
-[] 6 ( 1)- ( )] (https://youtu.be/LAP2A80Ajrg?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO&t=3344) -[] (( )- - , , - , , , ( )] (https://www.youtube.com/watch?v=U8-PGsjvZc4&index= 12 & = PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO) -[] (( 3)- , , , , ( )] (https://www.youtube.com/watch?v=7sduBHuex4c&index=13&list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO) -[] [ ( videos )] (https://www.youtube.com/playlist?list=PLF206E906175C7E07) -[] [ ] (https://www.amazon.com/Head- - - - / /0596007124) - " : - " d
-[] : 101 ] (https://sourcemaking.com/design-patterns- -tips) -[] [ ] (https://github.com/kamranahmedse/design-patterns-for-humans#structural-design-patterns) -### (n )
-[] [ : , ( ) ( )] (https://www.youtube.com/watch?v=8RRo6Ti9d0U) -[] [ : ( )] (https://www.youtube.com/watch?v=sZkAAk9Wwa4) -[] [ : ( )] (https://www.youtube.com/watch?v=dNaJg-mLobQ) -[ ] : - : -[] [ ] (https://www.khanacademy.org/math/probability/probability-and-combinatorics- ) - -41 ( ): -[] [ ( )] (https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19) -### , -
- - , , d
- - d
-[] [ ( )] (https://www.youtube.com/watch?v=moPtwq_cVH8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=23) -[] : -[] [ d ( ) II ] (https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) -[] [ ( )] (https://www.youtube.com/watch?v=e0tGC6ZQdQE&index=16&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) -[] [ ( )] (https://www.youtube.com/watch?v=fCX1BGT3wjE&index=17&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) -[] [ ( )] (https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=18) -[] : -[] [ 373 2012- 23- - ( )] (https://youtu.be/KiK5TVgXbFg?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=1508) -[] [ 373 2012- 24- - ( )] (https://www.youtube.com/watch?v=27Al52X3hd4&index=24&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) -[] [ 373 2012- 25- - ( )] (https://www.youtube.com/watch?v=xCPH4gwIIXM&index=25&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) -[] [ : , , - , ( )] (https://www.youtube.com/watch?v=eHZifpgyH_4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=22) -[] [ : ( )] (https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=24) -[] [ : - ( )] (https://www.youtube.com/watch?v=4q-jmGrmxKs&index=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) - : -[ ] (http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb) - 1048-1140 d
-###
-[] : -[] [ ( 100 ) ( )] (https://www.youtube.com/watch?v=R5ON3iwx78M) -[] [ ( )] (https://www.youtube.com/watch?v=bq6N7Ym81iI) -[] [ -146 ( ++) ( )] (https://www.youtube.com/watch?v=8-FZRAjR7qU) -[] : -[] [ 6.004 15: ( )] (https://www.youtube.com/watch?v=vjYF_fAZI5E&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-&index=24) -[] [ 00. : ( )] (https://www.youtube.com/watch?v=ajgC3-pyGlk&index=25&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-) -###
-[] 162- (25 ): - 1-11
-[ ( )] (https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iBDyz-ba4yDskqMDY6A1w_c) -[ ?] (Https://www.quora.com/What-is-the-differences-between-a-process-and-a-thread) - : - , ,
-
-
-
-
-
-semaphores -
-
-
-
- , ,
-
-[ , ( )] (https://www.youtube.com/watch?v=LKe7xK0bF7o&list=PLCiOXwirraUCBE9i_ukL8_Kfg6XNv7Se8&index=2) -[ ( )] (https://www.youtube.com/watch?v=uFKi2-J-6II&list=PLCiOXwirraUCBE9i_ukL8_Kfg6XNv7Se8&index=3) -[ ( )] (https://www.youtube.com/watch?v=-Gu5mYdKbu4&index=4&list=PLCiOXwirraUCBE9i_ukL8_Kfg6XNv7Se8) - ( : , , , , , i / o) - ( ( ) , , ) - ( ) , d
-
-
-[] [ ++ ( -10 ) ]] (https://www.youtube.com/playlist?list=PL5jc9xFGsL8E12so1wlMS0r0hTQoJL74M) -[] ( ): -[] [ ] (https://www.youtube.com/playlist?list=PL1H1sBF1VAKVMONJWJkmUh6_p8g4F2oy1) -[] [ ] (https://www.youtube.com/watch?v=Bs7vPNbB9JM) -[] [ ( )] (https://www.youtube.com/watch?v=Obt-vMVdM8s) -[ ] (http://www.dabeaz.com/GIL) -[] [ - : !- 2015] (https://www.youtube.com/watch?v=MCs5OvhV9S4) -[] [ - ( )] (https://www.youtube.com/watch?v=ZzfHjytDceU) -[] [ ] (https://www.youtube.com/watch?v=0zaPs8OtyKY) -###
- : -
-
-
-
-[] [ ( ) ] (https://www.youtube.com/watch?v=SAhJf36_u5U) -[] [ ( ) ] (https://www.youtube.com/watch?v=ILkT_HV9DVU) -[] [ - - ( ) ( )] (https://vimeo.com/83960706) -[ ] (http://gotocon.com/dl/goto-berlin-2013/slides/SteveFreeman_TestDrivenDe mentThatNotWhatWeMeant.pdf) -[] [ d d ] (Http://david.heinemeierhansson.com/2014/tdd-is-dead-long-live-testing.html) -[] [ ? ( )] (https://www.youtube.com/watch?v=z9quxZsLcfo) -[] [ (152 )- ( )] (https://www.youtube.com/watch?v=nzJapzxH_rE&list=PLAwxTw4SYaPkWVHeC_8aSIbSxE_NXI76g) -[] [ - ] (http://www.obeythetestinggoat.com/pages/book.html#toc) -[ ] : -[] [ ] (https://www.youtube.com/watch?v=IKD2-MAkXyQ) -[] [ ] (http://jasonpolites.github.io/tao-of-testing/ch3-1.1.html) -[] [ ] (http://jasonpolites.github.io/tao-of-testing/ch4-1.1.html) -###
- ,
-
-###
-[] [ - ( )] (https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays) -[] [ - ( )] (https://www.coursera.org/learn/algorithms-part2/home/week/4) -[] [ d ] (https://www.coursera.org/learn/algorithms-part2/lecture/n3ZpG/intr ~J/'H'1-to-substring-search) -[] [ d - ] (https://www.coursera.org/learn/algorithms-part2/lecture/2Kn5i/brute-force-substring-search) -[] [3d - ] (https://www.coursera.org/learn/algorithms-part2/lecture/TAtDr/knuth-morris-pratt) -[] [ d ] (https://www.coursera.org/learn/algorithms-part2/lecture/CYxOT/boyer-moore) -[] [ d -Karp] (https://www.coursera.org/learn/algorithms-part2/lecture/3KiqT/rabin-karp) -[] [ ( )] (https://www.coursera.org/learn/data-structures/lecture/tAfHI/search-pattern-in-text) , [ ] " " ( - - - ) -###
- d , ,
d
- , d
-[] [ - (3 )] (https://www.coursera.org/learn/algorithms-part2/home/week/4) -[] [ d ] (https://www.coursera.org/learn/algorithms-part2/lecture/CPVdr/r-way-tries) -[] [ d ] (https://www.coursera.org/learn/algorithms-part2/lecture/yQM8K/ternary-search-tries) -[] [3d ] (https://www.coursera.org/learn/algorithms-part2/lecture/jwNmV/character- - ) -[] [ ] (http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html# ) -[] : -[] [ ( )] (https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08Xyf/core-intr ~J/'H'1-to-tries) -[] [ ( )] (https://www.coursera.org/learn/data-structures-optimizing- / / PvlZW/core-performance-of-tries) -[] [ ( )] (https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie) -[] [ : ] (https://www.toptal.com/java/the-trie-a-neglected-data-st 8  0  ( > ) -[] [ - ] (https://www.topcoder.com/commune/competitive-pogramming/tutorials/ using-tries/) -[] [ ( ) ( )] (https://www.youtube.com/watch?v=TJ8SkcUSdbU) -[] [ , , ( ) ( )] (https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf) -###
-[] 8- : [ -1 ( - - )] (https://www.youtube.com/watch?v=ji3SfClm8TU) -[] 32 : [ 7575 32- ( )] (https://www.youtube.com/watch?v=50ZYcZebIec) -###
-[] [ , ] (http://www.joelonsoftware.com/articles/Unicode.html) -[] [ , ] [http://kunststube.net/encoding/) -###
-[] [ ] (https://web.archive.org/web/20180107141940/http://www.cs.umd.edu:80/class/sum2003/cmsc311/Notes/Data/endiand ) -[] [ ( )] (https://www.youtube.com/watch?v=JrNF0KRAlyo) -[] [ / ( )] (https://www.youtube.com/watch?v=oBSuXP-1Tc0) - d d
- d
-###
-** ** - ,
-[] [ ] (https://www.khanacademy.org/computing/computer-science/internet-intro) -[] [ : ( )] (https://www.youtube.com/watch?v=Vdc8TCESIg8) -[] [ / ! ( )] (https://www.youtube.com/watch?v=e5DEVa9eSN0) -[] [ d / d ( )] (https://www.youtube.com/watch?v=nomyRJehhnM) -[] [ ( )] (https://www.youtube.com/watch?v=WGJrLqtX7As) -[] [ ( )] (https://www.youtube.com/watch?v=S2iBR2ZlZf0) -[] [ / ( )] (https://www.youtube.com/watch?v=Rp3iZUvXWlM) -[] [ . ( )] (https://www.youtube.com/watch?v=E9FxNzv1Tr8) -[] [ (21 ) ( )] (https://www.youtube.com/playlist?list=PLEbnTDJUr_IegfoqO4iPnPYQui46QqT0j) -[] [ - 5 ( )] (https://www.youtube.com/watch?v=t5xYI0jzOf4) -[] : -[] [ - - ( )] (https://www.youtube.com/watch?v=6G_W54zuadg&t=6s) -[] [ ( )] (https://www.youtube.com/watch?v=G75vN2mnJeQ) </details> ## , ,
<details> < > , , </summary> ** 4+ * - since / d
d
- : -
-
-
-
-
-
-
-
-
- ust
-
-
-[] ** **: [ ] (https://github.com/donnemartin/system-design-primer) -[] [ ] (http://www.hiredintech.com/system-design/) -[] [ ?] (Https://www.quora.com/How-do-I-prepare-to-answer-design-questions-in-a-technical-interview? redirected_qid = 1500023) -[] [ 8 ]] (http://blog.gainlo.co/index.php/2015/10/22/8-things-you-need-to-know-before-system - /) -[] [ ] (http://www.hiredintech.com/algorithm-design/) -[] [ -1NF, 2NF, 3NF 4NF ( )] (https://www.youtube.com/watch?v=UYYLYV7WSHM) -[] [ ] (https://github.com/checkcheckzz/system-design-interview)- d d d
-[] [ ] (http://www.palantir.com/2011/10/how-to-rock-a-systems-design-interview/) -[] [ ] (http://eirtythingisdata.wordpress.com/2009/10/17/numbers-everyone-should-know/) -[] [ ?] (Http://blog.tsunanet.net/2010/11/how-long-does-it-take-to-make-context.html) -[] [ ( )] (https://www.youtube.com/watch?v=srOgpXECblk) -[] [ ] (http://ksat.me/a-plain-english-intr ~J/'H'1-to-cap-theorem/) -[] : -[] -[ - ( )] (https://www.youtube.com/watch?v=s8JqcZtvnsM) -[] -[ ( )] (https://www.youtube.com/watch?v=P9Ydif5_qvE) -[] [ ] (https://raft.github.io/) -[] [ ] (http://thesecretlivesofdata.com/raft/) -[] [ ] (http://www.tom-e-white.com/2007/11/cons Contin-hashing.html) -[] [ ] (http://horicky.blogspot.com/2009/11/nosql-patterns.html) -[] : - d d
-[] [ ( )] (https://www.youtube.com/watch?v=-W9F__D3oY4) -[] : -[ ] (http://www.lecloud.net/post/7295452622/scalability-for-dummies-part-1-clones) -[ ] (http://www.lecloud.net/post/7994751381/scalability- - - -- ) -[ ] (http://www.lecloud.net/post/9246290032/scalability-for-dummies-part-3-cache) -[ ] (http://www.lecloud.net/post/9699762917/scalability-for-dummies-part-4-asynchronism) -[] [ ] (http://www.aosabook.org/en/distsys.html) -[] [ ] (https://pages.cs.wisc.edu/~zuyu/files/fallacies.pdf) -[] [ ] (http://horicky.blogspot.com/2010/10/scalable- - - html) -[ : ] (http://horicky.blogspot.com/2010/07/google-pregel-1'A- html) -[] [ - ( )] (https://www.youtube.com/watch?v=modXC5IWTJI) -[] [ ] (http://lethain.com/intr Productions-to-architecting- -for- /) -[] [ ( ) ]] (https://www.youtube.com/watch?v=9nWyWwY2Onc) -[] [ - ( ) - ]] (https://www.youtube.com/watch?v=H4vMcD7zKM0) -[] [ ] (https://www.topcoder.com/commune/competitive-pogramming/tutorials/the-Importance-of-algorithms/) -[] [ ] (http://highscalability.com/blog/2009/8/6/an-unorthodox-approach-to-database-design-the-  > . @ -of-the.html) -[] [ (2012), " " ( )] (https://www.youtube.com/watch?v=oodS71YtkGU) -[] [ - ( )] (https://www.youtube.com/watch?v=p0jGmgIrf_M&list=PLRXxvay_m8gqVlExPC5DG3TGWJTaBgqSA&index=4) -[] [ 7 ] (http://highscalability.com/blog/2012/3/26/7-years-of-youtube-scalability-lessons-in-30-minutes.html ) -[ ] (https://www.youtube.com/watch?v=G-lGCC4KKok) -[] [ 8 ] (http://highscalability.com/blog/2016/8/15/how-paypal-scaled-to-billions-of-transferences-daily-using-ju.html) -[] [ ] (https://blog.clevertap.com/how-to-remove-d -in-large-datasets/) -[] [ ( ) ] (https://www.youtube.com/watch?v=3vV4YiqKm1o) -[] [ ] (http://thenewstack.io/led-amazon-microservices-architecture/) -[] [ , ] (https://eng.uber.com/trip-data-squeeze/) -[] [ , ] (http://highscalability.com/blog/2016/3/3/asyncio-tarantool-queue-get-in-the-queue.html) -[] [ ?] (Http://highscalability.com/blog/2016/2/25/When-should-approtimate-query-processing-be-used.html) -[] [ , , ] [http://highscalability.com/blog/2016/2/23/googles-transition-from-single-datacenter-to-failover- -an.html) -[] [ ] (http://highscalability.com/blog/2012/9/24/google-spanners-most-surprising-revelation-nosql-is-out-and.html) -[] [ : ] (http://highscalability.com/blog/2016/7/6/machine-learning-driven-programming-a-new-programming-for-a.html) -[] [ ] [http://highscalability.com/blog/2016/6/15/the-image-optimization-technology-that-serves-millions-of-re .html) -[] [ ] (http://highscalability.com/blog/2016/2/1/a-patreon-architecture-short.html) -[] : ?] (Http://highscalability.com/blog/2016/1/27/tinder-how-does-one-of- - -de.html) -[] [ ] (http://highscalability.com/blog/2016/1/25/design-of-a-modern-cache.html) -[] [ ] (http://highscalability.com/blog/2016/1/13/live-video-streaming-at-facebook-scale.html) -[] [ 11 + ] (http://highscalability.com/blog/2016/1/11/a-beginners-guide-to-scaling-to-11-million- - -amazons.html) -[] [ ?] (Http://highscalability.com/blog/2015/12/16/how-does-the-use-of-docker-efect-latency.html) -[] [ 360 ] (http://highscalability.com/blog/2015/11/9/a-360-degree-view-of-the-entire-netflix-stack.html ) -[] [ - ] (http://highscalability.com/latency-everywhere-and-it-costs-you-sales-how-crush-it) -[] [ ( , )] (http://martinfowler.com/articles/serverless.html) -[] [ : , ] (http://instagram-engineering.tumblr.com/post/13649370142/ - - - - ) -[] - , ] (http://highscalability.com/blog/2012/7/16/cinchcast-architecture- -1500-hours-of-audio-every-dd ) -[] [ . ] (http://highscalability.com/blog/2010/3/16/justintvs-live-video- - html) -[] [ -50 ] (http://highscalability.com/blog/2010/9/21/playfishs-social-gaming-architecture-50-million-monthly-user.html ) -[] -40 , 200 , 30 ] (http://highscalability.com/blog/2011/6/27/tripadvisor-architecture-40m-visitors-200m-dynamic-page-view .html) -[] [ ] (http://highscalability.com/pletyoffish-architecture) -[] [ - . ] [http://highscalability.com/blog/2013/9/23/salesforce-architecture-how-they-handle-13-billion-transacti.html ) -[] [ -100,000 ] [http://highscalability.com/blog/2013/11/4/espns-architecture-at-scale-operating-at-100000-duh-nuh-nuhs.html) -[] " , " See -[ ] : -[ ' 2011: , " " ( )] (https://www.youtube.com/watch?v=5cKTP36HVgI) -[ ] (https://www.infoq.com/preferencesations/Twitter-Timeline- ) - , [ ] (# - ) " " d
-[] : , : - : [ ] (https://github.com/donnemartin/system-design-primer) -[ ] (http://www.hiredintech.com/system-design/) -[ ] (https://github.com/jwasham/coding-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf) - : 1. : -
-
-
- ,
. : -
- ( ) -
- 80/20
-
- 5
-
3. : - ( , , ) - : ,
-
-
- : -[ : ] (http://repository.cmu.edu/cgi/viewcontent.cgi?article=2112&context=compsci) -[ ] (https://blog.twitter.com/2010/annoucing-snowflake) -[ ] (http://www.indieflashblog.com/how-to-create-an-asynchronous-multplayer-game.html) -[ - ) (http://www.slideshare.net/dvirsky/intrration-to-redis) -[ ] (http://highscalability.com/blog/2011/12/6/instagram-architecture-14-million-users-terabytes-of-photos.html) -[ ) (http://ijcai13.org/files/tutorial_slides/td3.pdf) -[ - : ) (http://www.hiredintech.com/system-design/the-system-design-process/) -[ ) (https://www.adayinthelifeof.nl/2011/02/06/mmcache-internals/) </details> --- ##
<details> <summary> </ > d
d
-[] - ( ) -[ ] (https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -[] 2-5 - (18 ): -[ ] (https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ) -[] [ - ] (https://www.coursera.org/learn/algorithms-part1) -[] [ - ] (https://www.coursera.org/learn/algorithms-part2) </details> --- ##
<details> < > << > , d
** * ** : -
-
-
- ,
-
-
, d
, : [ ] (http://www.hiredintech.com/algorithm-design/) ? . d ,
d d " "d d d d
! [ ] (https://d3j2pkmjtin6ou.cloudfront.net/art_board_sm_2.jpg) : -[ ] (https://www.topcoder.com / / - / / - /) -[ - ] (https://www.topcoder.com/commune/competitive-pogramming/tutorials/dynamic-programming-from-novice-to-advanced/ -[ ] (https://web.archive.org/web/20160906124824/http://courses.csail.mit.edu/iap/interview/matorys.php) -[ ] (http://exercism.io/languages) ** ( ): ** -[] [ : , ] (http://www.wiley.com/WileyCDA/WileyTitle/productCd-047012167X.html) - , ++
-[] [ , 6th ] (http://www.amazon.com/Cracking-Coding-Interview-6th- / /0984782850/) -
[ ] (# - ) </details> ## /
<details> < > << > , d
d
-[] [ ] (https://www.topcoder.com/commune/competitive-programming/tutorials/how-to-find-a-solution/) -[] [ ] (https://www.topcoder.com/commune/competitive-programming/tutorials/how-to-dissect-a-topcoder-problem-statement/) : -[ ( )] (https://www.youtube.com/watch?v=NBcqBddFbZw&list=PLamzFoFxwoNjPfxzaWqs7cZGsPYy0x_gI) -[ ( )] (https://www.youtube.com/user/tusharroy2525/playlists?shelf_id=2&view=50&sort=dd) : -[ ] (https://leetcode.com/) -[ ] (https://www.topcoder.com/) -[ ( - )] (https://projecteuler.net/index.php?section=problems) -[ ] (http://www.codewars.com) -[ ] (https://www.haakerrearth.com/) -[ ] (https://www.hackerrank.com/) -[ ] (https://codility.com / /) -[ ] (https://www.interviewcake.com/) -[ ] (http://www.geeksforgeeks.org/) -[ ] (https://www.interviewbit.com/invite/icjf) -[ ( )] (http://www.spoj.com/) -[ ] (https://www.codechef.com/) : -[ ] (https://github.com/donnemartin/interactive-coding-challenges) : -[ . : ]] (http://www.gainlo.co/)- d
-[ : / ] (https://www.pramp.com/)- - -
-[ : ]] (https://refdash.com/)- d
</details> ##
-[] 2 ( ) : -[ ] (https://www.youtube.com/watch?v=4NIb9l3imAo) -[ - ] (https://www.youtube.com/watch?v=Eg5-tdAwclo) ##
-
##
20 d 2-3 d
, d
- ? - ? - ? - / ? - d
- ? - ? -[ x / y] ? -[ x / y] ? - [ / ]- ? - [ x / y] ? -[ / ] ? ##
( ): - ? - ? / / ? - ? ? - ? - ? - ? - ? - ? - ? ##
! d
d
--- ************************************************** ************************************************** * ************************************************** ************************************************** * Everything d

d d
************************************************** ************************************************** * ************************************************** ************************************************** * --- ##
<details> <summary> </ > -[ ] (https://www.amazon.com/dp/013937681X) -
-[ : ] (https://www.amazon.com/dp/1593273894/) -
-[ / ] (https://en.wikedia.org/wiki/TCP/IP_ ) -[ ] (https://www.amazon.com/gp/product/0596007124/) -
-[ : - ] (https://www.amazon.com/ - - - - - / / 36 6363 ) - " " ,
-
-[ , 5 ] (https://www.amazon.com/UNIX-Linux-System- - /dp/0134277554/) -[ ] (http://www.amazon.com/Algorithm- - - - / / 1849967202) ( ) -
- d
- 2 : -
- : -
-
-
- : -
- 7, 8, 9 ,
- : , d
- : - d
- d d
-
- : -[ ] (http://www.algorithm.cs.sunysb.edu/algowiki/index.php/The_Algorithms_ _ _ ( _ ) -[ ] (http://blog.panictank.net/category/algorithmndesignmanoutsolutions/page/2/) -[ ] (http://www3.cs.stonybrook.edu/~skiena/algorist/book/errata) -[ ] (https://www.amazon.com/Intr Productions- - - / /0262033844) -** : ** d , d d
- , ,
-[ , : ] (https://www.amazon.com/dp/0128119055) - (2017),
-[ ] (http://www.amazon.com/Programming-Pearls-2nd- -Bentley/dp/0201657880) - ( )
, , d
</details> </details> ##
<details> <summary> < > , .
, d
-###
-[] [ ~ 1 ( ) ] [https://www.youtube.com/watch?v=IhC7sdYe-Jg) -[] [ 50- ( )] (https://www.youtube.com/watch?v=CSZLNYF4Klo) -[] [ ++ ( )] (https://www.youtube.com/watch?v=twodd1KFfGk) -[] [ ( ++) ( ) ] (https://www.youtube.com/watch?v=FnGCDLhaxKU) -### ( ) -
-vi ( ): -[ 01 - , , ( )] (https://www.youtube.com/watch?v=5givLEMcINQ&index=1&list=PL13bz4SHGmRxlZVmWQ9DvXo1fEg4UdGkr) -[ ] (http://vim-ad EE.com/) -4 : -[ / - 1] (https://www.youtube.com/watch?v=SI8TeVMX8pk) -[ / - 2] (https://www.youtube.com/watch?v=F3OO7ZIOaEE) -[ / - 3] (https://www.youtube.com/watch?v=ZYEccA_nMaI) -[ / - 4] (https://www.youtube.com/watch?v=1lYD5gwgZIA) -[ ] [http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html# _ _ _ _ ) - : -[ ( )] (https://www.youtube.com/watch?v=hbmV1bnQ-i0) -3 ( ): -[ ( )- 1- , / / , ] (https://www.youtube.com/watch?v=ujODL7MD04Q) -[ ( )- 2- , , ] (https://www.youtube.com/watch?v=XWpsRupJ4II) -[ ( )- 3- , , ~ / .emacs ] (https://www.youtube.com/watch?v=paSgzPso-yc) -[ : , ( )] (https://www.youtube.com/watch?v=JWD1Fpdd4Pc) -[ ] [http://www.cs.yale.edu/homes/aspnes/class/223/notes.html# _ _ _ _ ) -[( ) : ( )] (https://www.youtube.com/watch?v=nsGYet02bEk) -###
- d
-[]
-[]
-[]
-[]
-[]
-[]
-[ ]
-[]
-[]
-[] [ ] (https://en.wikedia.org/wiki/Strace) -[] [tcpdump] (https://danielmiessler.com/study/tcpdump/) -### ( ) -[] [ ] (https://www.khanacademy.org/computing/computer-s 5 ?  M  > ( / ) -[] : -[] [ ] (https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/waxgx/core-markov-text-generation) -[] [ ] (https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/gZhiC/core-implementing-markov-text-generation) -[] [ = ] (https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/EUjrq/project-markov-text-generation-walk-through) - 6.050J d
-### ( ) -[] [ ] (https://www.youtube.com/watch?v=q-3BctoUpHE) -[] [ ] (https://www.youtube.com/watch?v=DdMcAUlxh1M) -[] : -[ ] (https://www.youtube.com/watch?v=1A_NcXxdoCc) -[ ] (https://www.youtube.com/watch?v=JAMLuxdHH8o) -[] [ ] (https://www.youtube.com/watch?v=wbH2VxzmoZk) -###
-
-
-[] [ , , , , ( )] (https://youtu.be/JnJq3Py0dyM?t=176) -###
-
-
-[] [ ] (https://www.khanacademy.org/computing/computer-s 5 ?  M  > ( /cryptography) -[] [ : ] (https://www.youtube.com/watch?v=KqqOXndnvic&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=30) -[] [ : ] (https://www.youtube.com/watch?v=9TNI2wHmaeI&index=31&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) -###
-
-[] ( ): -[] [ ] (https://www.youtube.com/watch?v=Lto-ajuqW3w) -[] [ ] (https://www.youtube.com/watch?v=M5c_RFKVkko) -[] [ ( )] (https://www.youtube.com/watch?v=umTbivyJoiI) -[] [ / - ] (https://www.youtube.com/watch?v=DV8efuB3h2g) -[] [ ( 77 77 )] (https://www.youtube.com/watch?v=goOa3DGezUA) -[] [ ) (https://www.youtube.com/watch?v=cCDCfoHTsaU) -[] [ ] (https://www.youtube.com/playlist?list=PLOU2XLYxmsIJGErt5rrCqaSGTMyyqNt2H) -[] [(al ) : !] (https://www.youtube.com/watch?v=whGwm0Lky2s) -###
-[ ( )] (https://www.youtube.com/playlist?list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -[] [ , ] (https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -[] [ ] (https://www.youtube.com/watch?v=6bwzNg5qQ0o&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=2) -[] [ ] (https://www.youtube.com/watch?v=drQyrzRoRiA&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=3) -[] [ ] (https://www.youtube.com/watch?v=6SIJmoE9L9g&index=4&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -[] [ ] (https://www.youtube.com/watch?v=8VqTSY-11F4&index=5&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -[] [ ] (https://www.youtube.com/watch?v=VEV74hwASeU&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=6) -[] [ ] (https://www.youtube.com/watch?v=chkFBigodIw&index=7&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -[] [ ] (https://www.youtube.com/watch?v=EBQIGy1ROLY&index=8&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -[] [ ] (https://www.youtube.com/watch?v=yRVZPvHYHzw&index=9&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -[] [ ] (https://www.youtube.com/watch?v=SIEVvk3NVuk&index=11&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -[] [ ] (https://www.youtube.com/watch?v=QOtA76ga_fY&index=12&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -[] [ - ) (https://www.youtube.com/watch?v=PuVMkSEcPiI&index=15&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -###
-[] [ ( )] (https://www.youtube.com/watch?v=iHVs_HkjdmI) -[] [ : !] (Https://www.infoq.com/preferencesations/garbage-col -- ) -[] [ : ( )] (https://www.youtube.com/watch?v=P-8Z0-MhdQs&list=PLdzf4Clw0VbOEWOS_sLhT_9zaiQDrS5AR&index=3) -###
-[] [ ( )] (https://www.coursera.org/learn/parprog1/home/week/1) -[] [ ( )] (https://www.youtube.com/watch?v=uY85GkaYzBk) -### ,
-[] [ ] (https://thrift.apache.org/) -[ ] (http://thrift-tutorial.readthedocs.io/en/latest/intro.html) -[] [ ) (https://developers.google.com/protocol-buffers/) -[ ] (https://developers.google.com/protocol-buffers/docs/tutorials) -[] [ ] (http://www.grpc.io/) -[ ( ) 101] (https://www.youtube.com/watch?v=5tmPvSe7xXQ&list=PLcTqM9n_dieN0k1nSeN36Z_ppKnvMJOL&index=1) -[] [ ] (http://redis.io/) -[ ] (http://try.redis.io/) -[] [ ( )] (https://aws.amazon.com/sqs/) -[] [ ( )] (https://aws.amazon.com/sns/) -[] [ ] (https://www.rabbitmq.com/) -[ ] (https://www.rabbitmq.com/getstarted.html) -[] [ ] (http://www.celeryproject.org/) -[ ] (http://docs.celeryproject.org/en/latest/getting-st / - - html) -[] [ ] (http://zeromq.org/) -[ - ] (http://zeromq.org/intro:read-the-manual) -[] [ ] (http://activemq.apache.org/) -[] [ ] (http://kafka.apache.org/docamentation.html#intr ~J/'H'1) -[] [ ] (http://msgpack.org/index.html) -[] [ ] (https://avro.apache.org/) -### * -[] [ ] (https://en.wikedia.org/wiki/A*_search_algorithm) -[] [ * ( )] (https://www.youtube.com/watch?v=KNXfSOx4eEE) -[] [ * (E01: ) ( )] (https://www.youtube.com/watch?v=-L-WgKMFuhE) -###
-[] [ ] (https://betterexplained.com/articles/an-interactive-guide-to-the-fourier-transform/) -[] [ ? ?] (Http://www.askamathematician.com/2012/09/q- -is-a-fourier-transform- -is-it-used-for/) -[] [ ? ( )] (https://www.youtube.com/watch?v=Xxut2PN-V8Q) -[] [ : ( )] (https://www.youtube.com/watch?v=iTMn0Kt18tg&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=4) -[] [ ] (http://jakevdp.github.io/blog/2013/08/28/ -the-fft/) -###
- , ' ( ) -[ ( )] (https://www.youtube.com/watch?v=-SUTGoFYjZs) -[ | | ( )] (https://www.youtube.com/watch?v=qBTdukbzc78) -[ ] (http://billmill.org/bloomfilter-tutorial/) -[ ] (http://blog.michaelschmatz.com/2016/04/11/how-to-write-a-bloom-filter-cpp/) -###
-[ 1.5 ) (http://highscalability.com/blog/2012/4/5/big-data-counting-how-to-count-a-billion-distinct-objects-us.html) -### -
-
-MD5 SHA 2 / d
-[ ( ) ]] (http://ferd.ca/simhashing-hopefully-made-simple.html) -###
-[] [ : ( )] (https://www.youtube.com/watch?v=hmReJCupbNU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=6) -[] [ ] (https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2012/lecture-notes / MIT6_046JS12_lec15.pdf) -###
-[] [ 61 39: ] (https://archive.org/details/ucberkeley_webcast_zksIj9O8_jc) -###
- ( ): -" , / - d
- ' ,
""-
- d
d
, d - d
- : , ,
/ : - ,
- - d
-[] [ - ] (https://en.wikedia.org/wiki/S 3D- _ _ _ ) -[] ** ** - : , , : ( ) , d
 , d

( , )d -[] [ / ( )] (https://www.youtube.com/watch?v=FNeL18KsWPc&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=6) -[] [ ( )] (https://www.coursera.org/learn/data-structures/ / Qq5E0/avl-trees) -[] [ ( )] (https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree- ) -[] [ ] (https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-5 ? 8 ) -[] ** ** - : , , , , - ( , , ( )) )
-[] [ 61 : ( )] (https://archive.org/details/ucberkeley_webcast_G5QIXywcJlY) -[] : : - 10 d
-[ ] (https://www.youtube.com/watch?v=QnPl_Y6EqMo) -[] ** / ** - 2-3 ( ) - :  , d
- - , ; , 
- d 8 ,
, - d
-[] [ - - 4 ( ) ( )] (https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871) -[] [ - - 5 ( )] (https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5) -[] [ - ] (https://en.wikedia.org/wiki/Red%E2%80%93 _ ) -[] [ ] (https://www.topcoder.com/commune/competitive-pogramming/tutorials/an-intr Produc-to-binary-search-and-red-black-trees /) -[] ** - ** - : 2-3 ( )d - 2-3 d d
-[] [ - ( )] (https://www.youtube.com/watch?v=C3SsdUqasD4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=2) -[] [ - ] (https://www.youtube.com/watch?v=iYvBtGKsqSg&index=3&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) -[] [ - ( ) ( )] (https://www.youtube.com/watch?v=TOb1tuEZ2X4&index=5&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) -[] ** - - ( - ) ** - : 2-4 ,  d
2-4 - - d 2-4
-
- 2-4 , ** 2-4 **d -[] [ 61 26: ( )] (https://archive.org/details/ucberkeley_webcast_zqrqYXkth6Q) -[] [ 234- ( )] (https://www.youtube.com/watch?v=DQdMYevEyE4&index=4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) -[] [ 234- ( )] (https://www.youtube.com/watch?v=2679VQ26Fp4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=5) -[] ** - ( - , - ) ** - : ( ) - 2- , = 2
-2-3 3-ary
-[] [ - ] (https://en.wikedia.org/wiki/K-ary_tree) -[] ** - ** - : , , ( - )
- : - d - ( ) d
, - allow d ' into ( - - ) d
-[] [ - ] (https://en.wikedia.org/wiki/B-tree) -[] [ - ] (http://btechsmartclass.com/data_structures/b-trees.html) -[] [ - ( )] (https://www.youtube.com/watch?v=I22wEC1tToGO&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=6) -[] [ - ( )] (https://www.youtube.com/watch?v=s3bCdZGrgpA&index=7&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) -[] [ - ( )] (https://www.youtube.com/watch?v=svfnVhJOfMc&index=8&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) -[] [ 85. - ( )] (https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf) - - - ,
- 37 , ( , ) -###
-
- -
-[] [ ( )] (https://www.youtube.com/watch?v=W94M9D_yXKk) -[] [ ( )] (https://www.youtube.com/watch?v=Y4ZgLlDfKDg) -###
-" "-
-[] [ : ( )] (https://www.youtube.com/watch?v=2g9OSRKJuzM&index=10&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) -[] [ ] (https://en.wikedia.org/wiki/Skip_list) -###
-[] [5 - - ( )] (https://www.youtube.com/watch?v=Tl90tNtKvxs) -[] [ - ( )] (https://www.youtube.com/watch?v=v1VgJmkEJW0) -[] [ ( )] (https://www.youtube.com/watch?v=2vhN4Ice5jI) -###
-[] [ 61 - ; ( )] (https://archive.org/details/ucberkeley_webcast_MAEGXTwmUsI) -[] [ - - (6 )] (https://www.coursera.org/learn/algorithms-part1/home/week/1) -###
-[] [ , ( )] (https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) -[] [ ( ) ( )] (https://www.youtube.com/watch?v=ru7mWZJlRQg) -###
-
-[] [ ] (https://en.wikedia.org/wiki/Treap) -[] [ : ( )] (https://www.youtube.com/watch?v=6podLUYinH8) -[] [ ] (https://www.cs.cmu.edu/~scandal/papers/treaps-spaa98.pdf) -### ( ) -[] [ ] (https://www.youtube.com/watch?v=M4K6HYLHREQ) -[] [ ] (https://www.youtube.com/watch?v=2ACJ9ewUC6U) -[] [ ] (https://www.youtube.com/watch?v=8AA_81xI3ik) -[] [ - ] (https://www.youtube.com/watch?v=44pAWI7v5Zk) -### , ( ) -[] [ : - 9] (https://youtu.be/XIAQRlNkJAw?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3164) -[] [ : - 10] (https://www.youtube.com/watch?v=J5aJEcOr6Eo&index=10&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) -[] [ : , ] (https://www.youtube.com/watch?v=EzeYI7p9MjU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=2) -###
-
-###
-[] ? -[] [ ] (https://backchannel.com/how-google-is-remaking-itself-as-a-machine-learning-first-company-ada63defcb70) -[] [ ( )] (https://www.youtube.com/watch?v=QSaZGT4-6EY) -[] [ ] (https://www.youtube.com/watch?v=X769cyzBNVw) -[] [ ( )] (https://www.youtube.com/watch?v=Ja2hxBAwG_0) -[] [ ( ) ( )] (https://www.youtube.com/playlist?list=PLOU2XLYxmsIIuiBfYad6rFYQU_jL2ryal) -[] [ ( )] (https://www.youtube.com/watch?v=oZikw5k_2FM) -[] [ ] (https://www.tensorflow.org/versions/r0.11/tutorials/index.html) -[] [ ( )] (http://www.analyticsvidhya.com/blog/2016/04/neural-networks-python-theano/) - : -[ : ] (https://www.coursera.org/learn/machine-learning) -[ ] (https://www.youtube.com/playlist?list=PLZ9qNFMHZ-A4rycgrgOYma6zxF4BZGGPW) - 12-18 (14 15 ) -[ ] (https://www.coursera.org/learn/neural- ) -[ ] (https://www.udacity.com/course/DP-learning--ud730) -[ / ] (https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009) -[ - ] (https://www.udacity.com/drive) -[ (2 99 )] (http://www.thisismetis.com / - - ) - : - : -[ ] (https://www.amazon.com/Python-Machine-Learning-Sebastian-Raschka/dp/1783555130/) -[ : ] (https://www.amazon.com/Data-S M  > ( -Scratch- - /dp/149190142X) -[ ] (https://www.amazon.com/Intr Productions-Machine-Learning- - / dp/1449369413/) -[ ] (https://github.com/ZuzooVn/machine-learning-for-software-engineers) - : http://www.dataschool.io/ </details> --- ##
<details> < > </ > ,
d d
, ? -[] ** - ** -[] [ ] (https://www.coursera.org/learn/data-structures/ / / ) -[] [ ] (https://www.coursera.org/learn/data-structures/lecture/EM5D0/naive- ) -[] [ ] (https://www.coursera.org/learn/data-structures/lecture/Mxu0w/trees) -[] [ ] (https://www.coursera.org/learn/data-structures/lecture/qb4c2/union-by-rank) -[] [ ] (https://www.coursera.org/learn/data-structures/ / Q9CVI/path-compression) -[] [ ) (https://www.coursera.org/learn/data-structures/lecture/GQQLN/analysis-optional) -[] ** ** ( ) -[] 6.. : : , ] (https://www.youtube.com/watch?v=OQ5jsbhAv_M&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=19) -[] 6.. : II: , ] (https://www.youtube.com/watch?v=ENyox7kNKeY&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=20) -[] 6.. : : , , ] (https://www.youtube.com/watch?v=ocZMDMZWCY&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=21) -[] 6.. : : , , d ] (https://www.youtube.com/watch?v=tp4_UXaVyx8&index=22&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) -[] 6. 4646: ] (https://www.youtube.com/watch?v=Tw1k46ywN6E&index=14&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) -[] [.0. 4646: : - ] [https://www.youtube.com/watch?v=NzgFUwOaoIw&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=15) -[] 6. 4646: ( )] (https://www.youtube.com/watch?v=krZI60lKPek&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=12) -[] ** ** ( ) -[] [ : - d ] (https://www.youtube.com/watch?v=mUBmcbbJNf4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=27) -[] [ : ] (https://www.youtube.com/watch?v=kQ-UQAzcnzA&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=28) -[] ** ** ( , , ) ( ): -[] [ 6.042 - ] (https://www.youtube.com/watch?v=SmFwFdESMHI&index=18&list=PLB7540DEDD482705B) -[] [ 6.042 - ] (https://www.youtube.com/watch?v=E6FbvM-FGZ8&index=19&list=PLB7540DEDD482705B) -[] [ 6.042 - ] (https://www.youtube.com/watch?v=l1BCv3qqW4A&index=20&list=PLB7540DEDD482705B) -[] [ 6.042 - ] (https://www.youtube.com/watch?v=MOfhhFaQdjw&list=PLB7540DEDD482705B&index=21) -[] [ 6.042 - ] (https://www.youtube.com/watch?v=gGlMSe7uEkA&index=22&list=PLB7540DEDD482705B) -[] [ 6.042 - II] (https://www.youtube.com/watch?v=oI9fMUqgfxY&index=23&list=PLB7540DEDD482705B) -[] [ 6.042 - ] (https://www.youtube.com/watch?v=q4mwO2qS2z4&index=24&list=PLB7540DEDD482705B) -[] [ 6.042 - ] (https://www.youtube.com/watch?v=56iFMY8QW2k&list=PLB7540DEDD482705B&index=25) -[] [ : ( )] (https://www.youtube.com/watch?v=oDniZCmNmNw&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=19) -[] ** ** -[] - ( ): -[ ] (https://www.coursera.org/learn/data-structures/lecture/c0Qkw/rabin-karps-algorithm) -[ ] (https://www.coursera.org/learn/data-structures/lecture/nYrc8/optimization-precomputation) -[ : ] (https://www.coursera.org/learn/data-structures/lecture/h4ZLc/optimization- - - ) -[ , - ] (https://www.youtube.com/watch?v=BRO7mVIFt08&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=9) -[ , ] (https://www.youtube.com/watch?v=w6nuXg0BISo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=32) -[] - - ( ): -[ - - ( ) ] (https://www.youtube.com/watch?v=5i7oKodCRJo) -[] 
-[ - ] (https://en.wikedia.org/wiki/Boyer%E2%80%93 _ _ _ ) -[ - - ( ) ] [https://www.youtube.com/watch?v=QDZpzctPf10) -[] [ : ] (https://www.coursera.org/learn/algorithms-on-strings/home/week/1) -
-
-
-[ ] ** ** -[] : -[] [ 15 | ( )] (https://www.youtube.com/watch?v=ENp00xylP7c&index=15&list=PLFE6E58F856038C69) -[] [ 16 | ( )] (https://www.youtube.com/watch?v=y4M9IVgrVKo&index=16&list=PLFE6E58F856038C69) -[] , [ . d ] (Http://www.aduni.org/): -[] [ - - 2 ( )] (https://www.youtube.com/watch?v=odNJmw5TOEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=2) -[] [ - - 3 ( )] (https://www.youtube.com/watch?v=hj8YKFTFKEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=3) -[[] : -[] [ 26:46 ( )] (https://youtu.be/ute-pmMkyuk?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=1600) -[] [ 27:40 ( )] (https://www.youtube.com/watch?v=yLvp-pB8mak&index=8&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) -[] [ : ( )] (https://www.youtube.com/watch?v=q7K9otnzlfE&index=9&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) -[] [ 23:50 ( ) ] (https://www.youtube.com/watch?v=TvqIGu9Iupw&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=10) </details> ##
d " ":
<details> < > </summary> -[] [ ( )] (https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr) -[] [x86 , , ( )] (https://www.youtube.com/playlist?list=PL038BE01D3BAEFDB0) -[] [ 18.06 , 2005 (35 )] (https://www.youtube.com/playlist?list=PLE7DDD91010BC51F8) -[] [ - : ] (https://www.youtube.com/playlist?list=PL3B08AE665AB9002A) -[] [ 70, 001- 2015- ] (http://www.infocobuild.com/education/audio-video-courses/computer-s M  > ( /cs70-spring2015-berkeley.html) -[] [ (19 )] (https://www.youtube.com/playlist?list=PL3o9D4Dl2FJ9q0_gtFXPh_H4POI5dK0yG) -[] [ ( )] (https://www.youtube.com/playlist?list=PLGxuz-nmYlQPOc4w1Kp2MZrdqOOm4Jxeo) -[] 373- (25 ) -[ ] (https://www.youtube.com/watch?v=ZFjhkohHdAA&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=1) -[] [ 61 ( 2014): (25 )] (https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd) -[] [ B ( 2006): (39 )] (https://archive.org/details/ucberkeley-webcast-PL4BBB74C7D2A1049C) -[] [ 61 : (26 )] (https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iCl2-D-FS5mk0jFF6cYSJs_) -[] : (21 )] (https://www.youtube.com/playlist?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO) -[] U [ 152: (20 )] (https://www.youtube.com/watch?v=UH0QYvtP7Rk&index=20&list=PLkFD6_40KJIwEiwQx1dACXW-2Fuo32qr) ~~ -[] [ 00. : ( )] (https://www.youtube.com/playlist?list=PLDSlqjcPpoL64CJdF0Qee5oWqGS6we_Yu) -[] [ - (39 )] (https://www.youtube.com/playlist?list=PL5PHm2jkkXmi5CxxI7b3JCL1TWybTDtKq) -[] [ 00. : ( videos )] (https://www.youtube.com/watch?v=HtSuA80QTyo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&nohtml5=False) -[] [ .0. : ( )] (https://www.youtube.com/watch?v=zm2VP0kHl1M&list=PL6535748F59DCA484) -[] [ 6.034 , 2010 (30 )] (https://www.youtube.com/playlist?list=PLUl4u3cNGP63gFHB6xb-kVBiQHYe_4hSi) -[] [ 6.042 : , 2010 (25 )] (https://www.youtube.com/watch?v=L3LMbpZIKhQ&list=PLB7540DEDD482705B) -[] [ .0. 4646: ( )] (https://www.youtube.com/watch?v=2P-yW7LQr08&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) -[] [ 6.050J: , 2008 (19 )] (https://www.youtube.com/watch?v=phxsQrZQupo&list=PL_2Bwul6T-A7OldmhGODImZL8KEVE38X7) -[] [ 85. : ( )] (https://www.youtube.com/watch?v=T0yzrZL1py0&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=1) -[] [ 6.854: , 2016 (24 )] (https://www.youtube.com/playlist?list=PL6ogFv-ieghdoGKGg2Bik3Gl1glBTEu8c) -[] [ COMPSCI 224: (25 )] (https://www.youtube.com/playlist?list=PL2SOU6wwxB0uP4rJgf5ayhHWgw7akUWSf) -[] [ 6.858 , 2014] (https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) -[] [ : ( videos )] (https://www.youtube.com/view_play_list?p=9D558D49CA734A02) -[] [ ] (https://www.youtube.com/playlist?list=PL6N5qY2nvvJE8X75VkXglSrVhLv1tVcfy) -[ ] (http://www.crypto-textbook.com/) -[] [ - ( )] (https://www.youtube.com/playlist?list=PLLssT5z_DsK9JDLcT8T62VtzwyW9LNepV) -[] [ (videos 67 )] (https://www.youtube.com/user/DrSaradaHerke/playlists?shelf_id=5&view=50&sort=dd) </details> ##
-[ ] (https://github.com/open-source-sociversity/computer-s 5 ?  M  > ( ) -[ ( )] (https://github.com/prakhar1989/awesome-courses) ##
<details> <summary> </summary> -[ ?] (Https://www.cs.cmu.edu/~crary/819-f09/) -[] [1978: ] (http://spinroot.com/courses/summer/Papers/hoare_1978.pdf) -[ ] (https://godoc.org/github.com/thomas11/csp) -[] [2003: ] (http://static.googleusercontent.com/media/research.google.com/en//archive/gfs-sosp2003.pdf) -2012
-[] [ : : ] (http://static.googleusercontent.com/media/research.google.com/en//archive/mapreduce-osdi04.pdf) - ? -[] [ :: : ] (https://static.googleusercontent.com/media/research.google.com/en//archive/bigtable-osdi06.pdf) -[ ] (https://cloud.google.com/files/BigQueryTechnicalWP.pdf) -[] [ :: - ] (https://research.google.com/archive/chubby-osdi06.pdf) -[] [ :: : - ] (http://s3.amazonaws.com/AllThingsDistributes/sosp/amazon-dynamo-sosp2007.pdf) -
-[] [ :: ( , )] (https://www.akkadia.org/drepper/cpumemory.pdf) -[] [ : , ] (https://research.google.com/pubs/archive/36356.pdf) -[] [ : : - ] (https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/36632.pdf) -[] [ : ] (https://www.wired.com/2012/07/google-colossus/) -
-[] 2012: : : -[ ] (http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/37752.pdf) -[ ] (https://www.usenix.org/conferences/atc12/technical-sessions/preferencesation/serebryany) -[] 2013: : : -[ ] (http://static.googleusercontent.com/media/research.google.com/en//archive/spanner-osdi2012.pdf) -[ ] (https://www.usenix.org/node/170855) -[] [ : : t - ] (http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43146.pdf) -[] [ : ] (http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43790.pdf) -[] [ : - : ] (https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44686.pdf) -[] [ : : ] (http://download.tensorflow.org/paper/ whitepaper2015.pdf) -[] [ : : ] (http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43835.pdf) -[] [ :: , ] (http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44843.pdf) </details> ##
[ - - -4.0] (./ LICENSE.txt)