update lists
This commit is contained in:
@@ -1,4 +1,4 @@
|
||||
[38;5;12m [39m[38;2;255;187;0m[1m[4mAwesome Algorithms[0m
|
||||
[38;5;12m [39m[38;2;255;187;0m[1m[4mAwesome Algorithms[0m
|
||||
|
||||
[38;5;12mA curated list of awesome places to learn and/or practice algorithms.[39m
|
||||
[38;5;12mInspired by [39m[38;5;14m[1mawesome-awesomeness[0m[38;5;12m (https://github.com/bayandin/awesome-awesomeness) and all the other awesome Awesome libraries.[39m
|
||||
@@ -21,7 +21,7 @@
|
||||
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mA Visual Guide to Graph Traversal Algorithms[0m[38;5;12m (https://workshape.github.io/visual-graph-algorithms/) - Interactive visualizations for learning how graph traversal algorithms work.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mW3School[0m[38;5;12m (https://www.w3schools.in/data-structures-tutorial/intro/) - Data Structures tutorial.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCodeChef[0m[38;5;12m (https://www.codechef.com/LEARNDSA/) - Learning DSA by practice on Codechef[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCodeChef[0m[38;5;12m (https://www.codechef.com/roadmap/algorithms) - Learning DSA by practice on Codechef[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithm Visualizer[0m[38;5;12m (http://algo-visualizer.jasonpark.me/) - Dozens of animated algorithms (with code), and you can also create your own.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms Visualization[0m[38;5;12m (http://bost.ocks.org/mike/algorithms/) - A dense article on Algorithms Visualization.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mBig-O Cheat Sheet[0m[38;5;12m (http://bigocheatsheet.com/) - Big-O complexities of common algorithms used in Computer Science.[39m
|
||||
@@ -45,12 +45,10 @@
|
||||
|
||||
[48;2;30;30;40m[38;5;13m[3mHigh Quality Courses and tutorials on youtube[0m
|
||||
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mTim Roughgarden. Algorithms Illuminated[0m[38;5;12m (https://www.algorithmsilluminated.org/) - Tim Roughgarden, a pioneer of computer science, offers a companion to his book, with lecture videos and slides.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mFreeCodeCamp - Algorithms and Data Structures Tutorial - Full Course for Beginners[0m[38;5;12m (https://www.youtube.com/watch?v=8hly31xKli0) - Complete beginner friendly Algorithms and Data Structures Tutorial with mindblowing animation.[39m
|
||||
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAbdul Bari - Introduction to Algorithm[0m
|
||||
[38;5;12m (https://www.youtube.com/watch?v=0IAPZzGSbME&list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O) - This playlist is so much informative and provide simulation with code example. As like as you are in a class.[39m
|
||||
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mJenny's Lectures- Algorithm[0m[38;5;12m (https://www.youtube.com/watch?v=AT14lCXuMKI&list=PLdo5W4Nhv31bbKJzrsKfMpo_grxuLl8LU) - Another complete alogrithm playlist from basic level to intermediate. Easy explanation and simulation.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAbdul Bari - Introduction to Algorithm[0m[38;5;12m (https://www.youtube.com/watch?v=0IAPZzGSbME&list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O) - This playlist is so much informative and provide simulation with code example. As like as you are in a class.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mJenny's Lectures- Algorithm[0m[38;5;12m (https://www.youtube.com/watch?v=AT14lCXuMKI&list=PLdo5W4Nhv31bbKJzrsKfMpo_grxuLl8LU) - Another complete algorithm playlist from basic level to intermediate. Easy explanation and simulation.[39m
|
||||
|
||||
[38;2;255;187;0m[4mOnline Courses[0m
|
||||
|
||||
@@ -62,12 +60,12 @@
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming[0m[38;5;12m (https://www.coursera.org/learn/algorithms-greedy) - The primary topics are: greedy algorithms and dynamic programming.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them[0m
|
||||
[38;5;12m (https://www.coursera.org/learn/algorithms-npcomplete) - The primary topics are: shortest paths, NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms,[0m[38;5;14m[1m [0m[38;5;14m[1mPart[0m[38;5;14m[1m [0m[38;5;14m[1mI[0m[38;5;12m [39m[38;5;12m(https://www.coursera.org/learn/algorithms-part1/home/welcome)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mThis[39m[38;5;12m [39m[38;5;12mcourse[39m[38;5;12m [39m[38;5;12mcovers[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12messential[39m[38;5;12m [39m[38;5;12minformation[39m[38;5;12m [39m[38;5;12mthat[39m[38;5;12m [39m[38;5;12mevery[39m[38;5;12m [39m[38;5;12mserious[39m[38;5;12m [39m[38;5;12mprogrammer[39m[38;5;12m [39m[38;5;12mneeds[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mknow[39m[38;5;12m [39m[38;5;12mabout[39m[38;5;12m [39m[38;5;12malgorithms[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mdata[39m[38;5;12m [39m[38;5;12mstructures.[39m[38;5;12m [39m[38;5;12mPart[39m[38;5;12m [39m[38;5;12mI[39m[38;5;12m [39m[38;5;12mcovers[39m[38;5;12m [39m
|
||||
[38;5;12melementary[39m[38;5;12m [39m[38;5;12mdata[39m[38;5;12m [39m[38;5;12mstructures,[39m[38;5;12m [39m[38;5;12msorting,[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12msearching[39m[38;5;12m [39m[38;5;12malgorithms.[39m[38;5;12m [39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms,[0m[38;5;14m[1m [0m[38;5;14m[1mPart[0m[38;5;14m[1m [0m[38;5;14m[1mI[0m[38;5;12m [39m[38;5;12m(https://www.coursera.org/learn/algorithms-part1/home/welcome)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mThis[39m[38;5;12m [39m[38;5;12mcourse[39m[38;5;12m [39m[38;5;12mcovers[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12messential[39m[38;5;12m [39m[38;5;12minformation[39m[38;5;12m [39m[38;5;12mthat[39m[38;5;12m [39m[38;5;12mevery[39m[38;5;12m [39m[38;5;12mserious[39m[38;5;12m [39m[38;5;12mprogrammer[39m[38;5;12m [39m[38;5;12mneeds[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mknow[39m[38;5;12m [39m[38;5;12mabout[39m[38;5;12m [39m[38;5;12malgorithms[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mdata[39m[38;5;12m [39m[38;5;12mstructures.[39m[38;5;12m [39m[38;5;12mPart[39m[38;5;12m [39m[38;5;12mI[39m[38;5;12m [39m[38;5;12mcovers[39m[38;5;12m [39m[38;5;12melementary[39m[38;5;12m [39m[38;5;12mdata[39m[38;5;12m [39m
|
||||
[38;5;12mstructures,[39m[38;5;12m [39m[38;5;12msorting,[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12msearching[39m[38;5;12m [39m[38;5;12malgorithms.[39m[38;5;12m [39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms, Part II[0m[38;5;12m (https://www.coursera.org/learn/algorithms-part2) - Part II focuses on graph- and string-processing algorithms.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mKhan Academy Algorithms[0m[38;5;12m (https://www.khanacademy.org/computing/computer-science/algorithms) - Algorithm course ministered by Tomas Cormen and Devin Balkcom.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mMIT - 6-006[0m[38;5;12m (https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/video_galleries/lecture-videos/) - Well explained algorithms.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mMIT - 6-046j[0m[38;5;12m (http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/) - Similar to the previous one, but with different algorithms.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mMIT - 6-046j[0m[38;5;12m (https://ocw.mit.edu/courses/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video_galleries/video-lectures/) - Similar to the previous one, but with different algorithms.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mMIT - 6-00sc[0m[38;5;12m (http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00sc-introduction-to-computer-science-and-programming-spring-2011/index.htm) - An easy and well-explained introduction to algorithms.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mMIT 18-409 - Topics in Theoretical Computer Science: An Algorithmist's Toolkit[0m
|
||||
[38;5;12m (https://ocw.mit.edu/courses/18-409-topics-in-theoretical-computer-science-an-algorithmists-toolkit-fall-2009/) - It covers a collection of geometric techniques that apply broadly in modern algorithm design.[39m
|
||||
@@ -89,27 +87,28 @@
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mData Structures Using C[0m[38;5;12m (http://www.amazon.com/Data-Structures-Using-Aaron-Tenenbaum/dp/0131997467) - The basic concepts and usages of data structures.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mElementary Algorithms[0m[38;5;12m (https://github.com/liuxinyu95/AlgoXY) - An awesome book about algorithms and data structures.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mGrokking Algorithms[0m[38;5;12m (http://www.manning.com/bhargava) - An illustrated book on algorithms with practical examples.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mIntroduction to Algorithms[0m[38;5;12m (http://mitpress.mit.edu/books/introduction-algorithms) - Essential![39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mIntroduction to Algorithms[0m[38;5;12m (https://mitpress.mit.edu/9780262046305/introduction-to-algorithms/) - Essential![39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mReal World Algorithms: A Beginner's Guide[0m[38;5;12m (https://mitpress.mit.edu/books/real-world-algorithms) - An introduction to algorithms for readers with no background in advanced mathematics or computer science.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mSwift Algorithms & Data Structures[0m[38;5;12m (http://shop.waynewbishop.com/) - A practical guide to concepts, theory, and code.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mThe Algorithm Design Manual[0m[38;5;12m (http://www.algorist.com/) - Easy to read and full of real-world examples.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mThe Art of Computer Programming[0m[38;5;12m (http://www-cs-faculty.stanford.edu/~uno/taocp.html) - The Book.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mStructure and Interpretation of Computer Programs[0m[38;5;12m (https://mitpress.mit.edu/books/structure-and-interpretation-computer-programs-second-edition)[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms and Data Structures in Action[0m[38;5;12m (https://www.manning.com/books/algorithms-and-data-structures-in-action) - A different and a great way to introduce algorithms and data structures that can be used at work.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAdvanced Algorithms and Data Structures[0m[38;5;12m (https://www.manning.com/books/advanced-algorithms-and-data-structures) - A different and a great way to introduce algorithms and data structures that can be used at work.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithmic Puzzles[0m[38;5;12m (https://www.amazon.com/Algorithmic-Puzzles-Anany-Levitin/dp/0199740445) - A very accessible illustration of algorithms in the forms of puzzles. No programming experience is required![39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mStandford CS166[0m[38;5;12m (https://web.stanford.edu/class/cs166/) - Standford CS166, a course in the design, analysis, and implementation of data structures.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mGrokking Data Structures[0m
|
||||
[38;5;12m (https://www.manning.com/books/grokking-data-structures) - Grokking Data Structures carefully guides you from the most basic data structures like arrays or linked lists all the way to powerful structures like graphs. It’s perfect for beginners.[39m
|
||||
|
||||
[38;2;255;187;0m[4mAlgorithm Analysis[0m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mSedgewick[0m[38;5;14m[1m [0m[38;5;14m[1m&[0m[38;5;14m[1m [0m[38;5;14m[1mFlajolet.[0m[38;5;14m[1m [0m[38;5;14m[1mAn[0m[38;5;14m[1m [0m[38;5;14m[1mIntroduction[0m[38;5;14m[1m [0m[38;5;14m[1mto[0m[38;5;14m[1m [0m[38;5;14m[1mthe[0m[38;5;14m[1m [0m[38;5;14m[1mAnalysis[0m[38;5;14m[1m [0m[38;5;14m[1mof[0m[38;5;14m[1m [0m[38;5;14m[1mAlgorithm[0m[38;5;12m [39m[38;5;12m(https://www.amazon.com/Introduction-Analysis-Algorithms-Introdu-Algori_p2-ebook/dp/B00B3TB7IQ)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mAm[39m[38;5;12m [39m[38;5;12madvanced[39m[38;5;12m [39m[38;5;12mcomplete[39m[38;5;12m [39m[38;5;12msurvey,[39m[38;5;12m [39m[38;5;12mintended[39m[38;5;12m [39m[38;5;12monly[39m[38;5;12m [39m[38;5;12mfor[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mmathematically[39m[38;5;12m [39m
|
||||
[38;5;12mmatured[39m[38;5;12m [39m[38;5;12mreader.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mSedgewick[0m[38;5;14m[1m [0m[38;5;14m[1m&[0m[38;5;14m[1m [0m[38;5;14m[1mFlajolet.[0m[38;5;14m[1m [0m[38;5;14m[1mAn[0m[38;5;14m[1m [0m[38;5;14m[1mIntroduction[0m[38;5;14m[1m [0m[38;5;14m[1mto[0m[38;5;14m[1m [0m[38;5;14m[1mthe[0m[38;5;14m[1m [0m[38;5;14m[1mAnalysis[0m[38;5;14m[1m [0m[38;5;14m[1mof[0m[38;5;14m[1m [0m[38;5;14m[1mAlgorithm[0m[38;5;12m [39m[38;5;12m(https://www.amazon.com/Introduction-Analysis-Algorithms-Introdu-Algori_p2-ebook/dp/B00B3TB7IQ)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mAm[39m[38;5;12m [39m[38;5;12madvanced[39m[38;5;12m [39m[38;5;12mcomplete[39m[38;5;12m [39m[38;5;12msurvey,[39m[38;5;12m [39m[38;5;12mintended[39m[38;5;12m [39m[38;5;12monly[39m[38;5;12m [39m[38;5;12mfor[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mmathematically[39m[38;5;12m [39m[38;5;12mmatured[39m[38;5;12m [39m
|
||||
[38;5;12mreader.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mMcConnell. Analysis of Algorithms[0m[38;5;12m (https://www.amazon.com/Analysis-Algorithms-Jeffrey-McConnell/dp/0763707821) - A very accessible and brief book on algorithms analysis, with implemented code included.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mVrajitoru[0m[38;5;14m[1m [0m[38;5;14m[1m&[0m[38;5;14m[1m [0m[38;5;14m[1mKnight.[0m[38;5;14m[1m [0m[38;5;14m[1mPractical[0m[38;5;14m[1m [0m[38;5;14m[1mAnalysis[0m[38;5;14m[1m [0m[38;5;14m[1mof[0m[38;5;14m[1m [0m[38;5;14m[1mAlgorithms[0m[38;5;12m [39m[38;5;12m(https://www.amazon.com/Practical-Analysis-Algorithms-Undergraduate-Computer/dp/331909887X)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mA[39m[38;5;12m [39m[38;5;12mvery[39m[38;5;12m [39m[38;5;12maccessible[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mbrief[39m[38;5;12m [39m[38;5;12mbook[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12malgorithms[39m[38;5;12m [39m[38;5;12manalysis,[39m[38;5;12m [39m[38;5;12mwith[39m[38;5;12m [39m[38;5;12mimplemented[39m[38;5;12m [39m[38;5;12mcode[39m[38;5;12m [39m
|
||||
[38;5;12mincluded.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mVrajitoru & Knight. Practical Analysis of Algorithms[0m[38;5;12m (https://www.amazon.com/Practical-Analysis-Algorithms-Undergraduate-Computer/dp/331909887X) - A very accessible and brief book on algorithms analysis, with implemented code included.[39m
|
||||
|
||||
[38;2;255;187;0m[4mRandomized Algorithms[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mMotwani & Raghavan. Randomized Algorithms[0m[38;5;12m (https://www.amazon.com/Randomized-Algorithms-Rajeev-Motwani/dp/0521474655) - A standard classic book.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mMitzenmacher[0m[38;5;14m[1m [0m[38;5;14m[1m&[0m[38;5;14m[1m [0m[38;5;14m[1mUpfal.[0m[38;5;14m[1m [0m[38;5;14m[1mProbability[0m[38;5;14m[1m [0m[38;5;14m[1mand[0m[38;5;14m[1m [0m[38;5;14m[1mComputing:[0m[38;5;14m[1m [0m[38;5;14m[1mRandomization[0m[38;5;14m[1m [0m[38;5;14m[1mand[0m[38;5;14m[1m [0m[38;5;14m[1mProbabilistic[0m[38;5;14m[1m [0m[38;5;14m[1mTechniques[0m[38;5;14m[1m [0m[38;5;14m[1min[0m[38;5;14m[1m [0m[38;5;14m[1mAlgorithms[0m[38;5;14m[1m [0m[38;5;14m[1mand[0m[38;5;14m[1m [0m[38;5;14m[1mData[0m[38;5;14m[1m [0m[38;5;14m[1mAnalysis[0m[38;5;12m [39m[38;5;12m(https://www.amazon.com/Probability-Computing-Randomization-Probabilistic-Techniques-ebook/dp/B06X9YBMFK)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m
|
||||
[38;5;12mStandard[39m[38;5;12m [39m[38;5;12mtext[39m[38;5;12m [39m[38;5;12mfor[39m[38;5;12m [39m[38;5;12mprobability[39m[38;5;12m [39m[38;5;12mmethods[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mtheir[39m[38;5;12m [39m[38;5;12mapplications[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12mrandomized[39m[38;5;12m [39m[38;5;12malgorithms.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mMitzenmacher[0m[38;5;14m[1m [0m[38;5;14m[1m&[0m[38;5;14m[1m [0m[38;5;14m[1mUpfal.[0m[38;5;14m[1m [0m[38;5;14m[1mProbability[0m[38;5;14m[1m [0m[38;5;14m[1mand[0m[38;5;14m[1m [0m[38;5;14m[1mComputing:[0m[38;5;14m[1m [0m[38;5;14m[1mRandomization[0m[38;5;14m[1m [0m[38;5;14m[1mand[0m[38;5;14m[1m [0m[38;5;14m[1mProbabilistic[0m[38;5;14m[1m [0m[38;5;14m[1mTechniques[0m[38;5;14m[1m [0m[38;5;14m[1min[0m[38;5;14m[1m [0m[38;5;14m[1mAlgorithms[0m[38;5;14m[1m [0m[38;5;14m[1mand[0m[38;5;14m[1m [0m[38;5;14m[1mData[0m[38;5;14m[1m [0m[38;5;14m[1mAnalysis[0m[38;5;12m [39m[38;5;12m(https://www.amazon.com/Probability-Computing-Randomization-Probabilistic-Techniques-ebook/dp/B06X9YBMFK)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mStandard[39m[38;5;12m [39m
|
||||
[38;5;12mtext[39m[38;5;12m [39m[38;5;12mfor[39m[38;5;12m [39m[38;5;12mprobability[39m[38;5;12m [39m[38;5;12mmethods[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mtheir[39m[38;5;12m [39m[38;5;12mapplications[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12mrandomized[39m[38;5;12m [39m[38;5;12malgorithms.[39m
|
||||
|
||||
[38;2;255;187;0m[4mCheat Sheets[0m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mTech Interview Cheat Sheet[0m[38;5;12m (https://github.com/TSiege/Tech-Interview-Cheat-Sheet)[39m
|
||||
@@ -196,10 +195,11 @@
|
||||
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mA2 Online Judge[0m[38;5;12m (https://a2oj.com/) - Online Judge and problem archive.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mACM-ICPC Live Archive[0m[38;5;12m (https://icpcarchive.ecs.baylor.edu/) - Hundreds of problems from previous ACM-ICPC Regionals and World Finals.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAIZU ONLINE JUDGE[0m[38;5;12m (http://judge.u-aizu.ac.jp/onlinejudge/) - Japanese Online Judge.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAIZU ONLINE JUDGE[0m[38;5;12m (https://onlinejudge.u-aizu.ac.jp/) - A Japanese online judge from the University of Aizu, offering a wide range of algorithmic challenges.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgo Muse[0m[38;5;12m (http://www.algomuse.appspot.com) - Research-based algorithmic problems. [39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAtCoder[0m[38;5;12m (https://atcoder.jp/) - Japanese programming contest website.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mBaekjoon Online Judge[0m[38;5;12m (https://www.acmicpc.net/) - Korean Online Judge. 10000+ problems. Supports 60+ languages.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mBeecrowd[0m[38;5;12m (https://judge.beecrowd.com/) - The Largest Competitive Programming and Online Code Judgement Platform in Latin America.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCS Academy[0m[38;5;12m (https://csacademy.com/) - Holds online contests and IOI practice contests[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCodeChef[0m[38;5;12m (https://www.codechef.com/) - More problems and monthly online contests.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCodeforces [0m[38;5;12m (http://codeforces.com/) - The only programming contests Web 2.0 platform[39m
|
||||
@@ -218,6 +218,7 @@
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mLavidaOnlineJudge[0m[38;5;12m (http://judge.lavida.us) - Korean Online Judge(Half English). 1300+ problems.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mLearneroo Algorithms Tutorials[0m[38;5;12m (https://www.learneroo.com/subjects/8) - Learn and practice algorithms by solving challenges online.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mLeetCode[0m[38;5;12m (https://leetcode.com/) - Learn algorithms and prepare for interviews.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mPaiza[0m[38;5;12m (https://paiza.jp/) - A Japanese platform offering coding challenges and career preparation.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mPKU JudgeOnline[0m[38;5;12m (http://poj.org/) - Chinese Online Judge.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mProjectEuler[0m[38;5;12m (https://projecteuler.net/) - Mathematical problems that can be solved using algorithms (or just a pencil, depending on how much you already know).[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mRosalind[0m[38;5;12m (http://rosalind.info/problems/locations/) - A platform for learning bioinformatics and programming through problem-solving.[39m
|
||||
@@ -249,8 +250,8 @@
|
||||
|
||||
[38;2;255;187;0m[4mRelated Awesome Lists[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mMath[0m[38;5;12m (https://github.com/rossant/awesome-math#readme) - Freely available lecture notes on mathematics.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mTheoretical[0m[38;5;14m[1m [0m[38;5;14m[1mComputer[0m[38;5;14m[1m [0m[38;5;14m[1mScience[0m[38;5;12m [39m[38;5;12m(https://github.com/mostafatouny/awesome-theoretical-computer-science/blob/main/README.md)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mThe[39m[38;5;12m [39m[38;5;12minterdisciplinary[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mMathematics[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mComputer[39m[38;5;12m [39m[38;5;12mScience,[39m[38;5;12m [39m[38;5;12mDistinguished[39m[38;5;12m [39m[38;5;12mby[39m[38;5;12m [39m[38;5;12mits[39m[38;5;12m [39m[38;5;12memphasis[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12mmathematical[39m[38;5;12m [39m
|
||||
[38;5;12mtechnique[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mrigour.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mTheoretical[0m[38;5;14m[1m [0m[38;5;14m[1mComputer[0m[38;5;14m[1m [0m[38;5;14m[1mScience[0m[38;5;12m [39m[38;5;12m(https://github.com/mostafatouny/awesome-theoretical-computer-science/blob/main/README.md)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mThe[39m[38;5;12m [39m[38;5;12minterdisciplinary[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mMathematics[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mComputer[39m[38;5;12m [39m[38;5;12mScience,[39m[38;5;12m [39m[38;5;12mDistinguished[39m[38;5;12m [39m[38;5;12mby[39m[38;5;12m [39m[38;5;12mits[39m[38;5;12m [39m[38;5;12memphasis[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12mmathematical[39m[38;5;12m [39m[38;5;12mtechnique[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m
|
||||
[38;5;12mrigour.[39m
|
||||
|
||||
|
||||
[38;2;255;187;0m[4mLicense[0m
|
||||
@@ -260,3 +261,5 @@
|
||||
[38;5;14m[1m![0m[38;5;12mCreative Commons License[39m[38;5;14m[1m (http://i.creativecommons.org/l/by/4.0/88x31.png)[0m[38;5;12m (http://creativecommons.org/licenses/by/4.0/)[39m
|
||||
|
||||
[38;5;12mThis work is licensed under a [39m[38;5;14m[1mCreative Commons Attribution 4.0 International License[0m[38;5;12m (http://creativecommons.org/licenses/by/4.0/).[39m
|
||||
|
||||
[38;5;12malgorithms Github: https://github.com/tayllan/awesome-algorithms[39m
|
||||
|
||||
Reference in New Issue
Block a user