Updating conversion, creating readmes
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
|
||||
@@ -29,8 +29,7 @@
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCP-Algorithms[0m[38;5;12m (https://cp-algorithms.com/) - Algorithms and data structures are especially popular in the field of competitive programming.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mData Structure Visualizations[0m[38;5;12m (http://www.cs.usfca.edu/~galles/visualization/Algorithms.html) - Visualize the behavior of Data Structures and play with its operations.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mGeeks for Geeks[0m[38;5;12m (http://www.geeksforgeeks.org/fundamentals-of-algorithms/) - Lots and lots of well-explained and implemented algorithms.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mPath[0m[38;5;14m[1m [0m[38;5;14m[1mFinding[0m[38;5;12m [39m[38;5;12m(https://qiao.github.io/PathFinding.js/visual/)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mA[39m[38;5;12m [39m[38;5;12mvisual[39m[38;5;12m [39m[38;5;12mrepresentation[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mhow[39m[38;5;12m [39m[38;5;12malgorithms[39m[38;5;12m [39m[38;5;12msuch[39m[38;5;12m [39m[38;5;12mas[39m[38;5;12m [39m[38;5;12mA[39m[38;5;12m*,[39m[38;5;12m [39m[38;5;12mIDA[39m[38;5;12m*,[39m[38;5;12m [39m[38;5;12mBreadth-First-Search,[39m[38;5;12m [39m[38;5;12mBest-First-Search,[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mothers[39m[38;5;12m [39m[38;5;12mdescribe[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mpath[39m[38;5;12m [39m[38;5;12mbetween[39m[38;5;12m [39m[38;5;12mtwo[39m[38;5;12m [39m[38;5;12mpoints[39m
|
||||
[38;5;12mA[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mB.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mPath Finding[0m[38;5;12m (https://qiao.github.io/PathFinding.js/visual/) - A visual representation of how algorithms such as A[39m[38;5;12m*, IDA[39m[38;5;12m*, Breadth-First-Search, Best-First-Search, and others describe a path between two points A and B.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mProgramiz[0m[38;5;12m (https://www.programiz.com/dsa) - Easy to follow tutorials on data structures and algorithms along with suitable examples.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mRosetta Code[0m[38;5;12m (http://rosettacode.org/wiki/Rosetta_Code) - A programming chrestomathy site that aims to present implementations of many algorithms and data structures in different programming languages.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mSorting Algorithms[0m[38;5;12m (http://www.sorting-algorithms.com/) - Nice and simple animations of sorting algorithms. With short codes and discussions.[39m
|
||||
@@ -46,14 +45,12 @@
|
||||
|
||||
[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[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[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[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
|
||||
|
||||
[38;2;255;187;0m[4mOnline Courses[0m
|
||||
|
||||
@@ -61,26 +58,22 @@
|
||||
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms: Divide and Conquer, Sorting and Searching, and Randomized Algorithms[0m
|
||||
[38;5;12m (https://www.coursera.org/learn/algorithms-divide-conquer) - The primary topics are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer, and randomized algorithms.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms: Graph Search, Shortest Paths, and Data Structures[0m
|
||||
[38;5;12m (https://www.coursera.org/learn/algorithms-graphs-data-structures) - The primary topics are: data structures, graph primitives, and their applications.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms: Graph Search, Shortest Paths, and Data Structures[0m[38;5;12m (https://www.coursera.org/learn/algorithms-graphs-data-structures) - The primary topics are: data structures, graph primitives, and their applications.[39m
|
||||
[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:[0m[38;5;14m[1m [0m[38;5;14m[1mShortest[0m[38;5;14m[1m [0m[38;5;14m[1mPaths[0m[38;5;14m[1m [0m[38;5;14m[1mRevisited,[0m[38;5;14m[1m [0m[38;5;14m[1mNP-Complete[0m[38;5;14m[1m [0m[38;5;14m[1mProblems[0m[38;5;14m[1m [0m[38;5;14m[1mand[0m[38;5;14m[1m [0m[38;5;14m[1mWhat[0m[38;5;14m[1m [0m[38;5;14m[1mTo[0m[38;5;14m[1m [0m[38;5;14m[1mDo[0m[38;5;14m[1m [0m[38;5;14m[1mAbout[0m[38;5;14m[1m [0m[38;5;14m[1mThem[0m[38;5;12m [39m[38;5;12m(https://www.coursera.org/learn/algorithms-npcomplete)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mThe[39m[38;5;12m [39m[38;5;12mprimary[39m[38;5;12m [39m[38;5;12mtopics[39m[38;5;12m [39m[38;5;12mare:[39m[38;5;12m [39m[38;5;12mshortest[39m[38;5;12m [39m[38;5;12mpaths,[39m[38;5;12m [39m[38;5;12mNP-completeness[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mwhat[39m[38;5;12m [39m[38;5;12mit[39m
|
||||
[38;5;12mmeans[39m[38;5;12m [39m[38;5;12mfor[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12malgorithm[39m[38;5;12m [39m[38;5;12mdesigner,[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mstrategies[39m[38;5;12m [39m[38;5;12mfor[39m[38;5;12m [39m[38;5;12mcoping[39m[38;5;12m [39m[38;5;12mwith[39m[38;5;12m [39m[38;5;12mcomputationally[39m[38;5;12m [39m[38;5;12mintractable[39m[38;5;12m [39m[38;5;12mproblems.[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: 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, 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-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 - 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-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
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mUdacity Intro to Algorithms[0m[38;5;12m (https://www.udacity.com/course/intro-to-algorithms--cs215) - Python-based Algorithms course.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms in Motion[0m[38;5;12m (https://www.manning.com/livevideo/algorithms-in-motion) - Beginner's algorithms course with fun illustrations, based on the book Grokking Algorithms[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1m[9mYogiBearian[0m[38;5;14m[1m[9m [0m[38;5;14m[1m[9mYouTube[0m[38;5;14m[1m[9m [0m[38;5;14m[1m[9mChannel[0m[38;5;12m[9m [0m[38;5;12m[9m(https://www.youtube.com/channel/UCv3Kd0guxD5KWQtP---9D6g)[0m[38;5;12m[9m [0m[38;5;12m[9m-[0m[38;5;12m[9m [0m[38;5;12m[9mLots[0m[38;5;12m[9m [0m[38;5;12m[9mof[0m[38;5;12m[9m [0m[38;5;12m[9mwell-explained[0m[38;5;12m[9m [0m[38;5;12m[9mvideos[0m[38;5;12m[9m [0m[38;5;12m[9mon[0m[38;5;12m[9m [0m[38;5;12m[9mvarious[0m[38;5;12m[9m [0m[38;5;12m[9mcomputer[0m[38;5;12m[9m [0m[38;5;12m[9mscience[0m[38;5;12m[9m [0m[38;5;12m[9msubjects.[0m[38;5;12m [39m[38;5;12m_Account[39m[38;5;12m [39m[38;5;12mterminated[39m[38;5;12m [39m[38;5;12mdue[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mviolations[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mYoutube[39m[38;5;12m [39m
|
||||
[38;5;12mPolicies._[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1m[9mYogiBearian YouTube Channel[0m[38;5;12m[9m (https://www.youtube.com/channel/UCv3Kd0guxD5KWQtP---9D6g) - Lots of well-explained videos on various computer science subjects.[0m[38;5;12m _Account terminated due to violations of Youtube Policies._[39m
|
||||
|
||||
[38;2;255;187;0m[4mBooks[0m
|
||||
|
||||
@@ -91,8 +84,7 @@
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms[0m[38;5;12m (http://algs4.cs.princeton.edu/home/) - Problems explained with Java, OO good practices, visualizations, and free online resources.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms and Data Structures in JavaScript[0m[38;5;12m (https://gum.co/dsajs) - Classical algorithms and data structures implemented and explained using JavaScript.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms in a Nutshell[0m[38;5;12m (https://www.amazon.com/Algorithms-Nutshell-In-OReilly/dp/059651624X) - by George T. Heineman.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mClassic Computer Science Problems in Python[0m
|
||||
[38;5;12m (https://www.manning.com/books/classic-computer-science-problems-in-python) -This great book presents dozens of coding challenges, ranging from simple tasks to clustering data using k-means.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mClassic Computer Science Problems in Python[0m[38;5;12m (https://www.manning.com/books/classic-computer-science-problems-in-python) -This great book presents dozens of coding challenges, ranging from simple tasks to clustering data using k-means.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mData Structures and Algorithms Made Easy[0m[38;5;12m (https://www.amazon.in/Data-Structures-Algorithms-Made-Easy/dp/819324527X) - A great way to implement algorithms with their specific programmable tasks.[39m
|
||||
[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
|
||||
@@ -103,22 +95,21 @@
|
||||
[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[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[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
|
||||
|
||||
[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;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;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
|
||||
@@ -216,8 +207,7 @@
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCodeMarshal[0m[38;5;12m (https://algo.codemarshal.org/) - Real-world contests online![39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCodeWars[0m[38;5;12m (http://www.codewars.com/) - A website that houses support to solve algorithms in many languages in varying difficulty.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCoderByte[0m[38;5;12m (http://www.coderbyte.com/) - A decent website with algorithm challenges from beginner to advanced levels. Supports most of the popular languages like C++, python, javascript, ruby.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mFirecode[0m[38;5;12m [39m[38;5;12m(https://www.firecode.io/)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mFirecode.io[39m[38;5;12m [39m[38;5;12muses[39m[38;5;12m [39m[38;5;12mmachine[39m[38;5;12m [39m[38;5;12mlearning[39m[38;5;12m [39m[38;5;12malgorithms[39m[38;5;12m [39m[38;5;12malong[39m[38;5;12m [39m[38;5;12mwith[39m[38;5;12m [39m[38;5;12mcurated[39m[38;5;12m [39m[38;5;12mreal-world[39m[38;5;12m [39m[38;5;12minterview[39m[38;5;12m [39m[38;5;12mquestions,[39m[38;5;12m [39m[38;5;12msolutions[39m[38;5;12m [39m[38;5;12m&[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mvibrant[39m[38;5;12m [39m[38;5;12msocial[39m[38;5;12m [39m[38;5;12mcommunity[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mlearners[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mget[39m[38;5;12m [39m[38;5;12myou[39m[38;5;12m [39m[38;5;12mready[39m[38;5;12m [39m[38;5;12mfor[39m[38;5;12m [39m
|
||||
[38;5;12myour[39m[38;5;12m [39m[38;5;12mnext[39m[38;5;12m [39m[38;5;12mcoding[39m[38;5;12m [39m[38;5;12minterview.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mFirecode[0m[38;5;12m (https://www.firecode.io/) - Firecode.io uses machine learning algorithms along with curated real-world interview questions, solutions & a vibrant social community of learners to get you ready for your next coding interview.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCoding Blocks[0m[38;5;12m (https://hack.codingblocks.com/app/) - Website that has problems based on Maths, Data Structures, Various Algorithm and also conducts Coding Competition.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mHackerEarth [0m[38;5;12m (https://www.hackerearth.com/) - Practice algorithmic problems & challenges and participate in hiring challenges.[39m
|
||||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mHackerRank[0m[38;5;12m (https://www.hackerrank.com/) - Featured algorithm and functional programming online judges[39m
|
||||
@@ -259,8 +249,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
|
||||
|
||||
Reference in New Issue
Block a user