283 lines
45 KiB
Plaintext
283 lines
45 KiB
Plaintext
[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
|
||
|
||
[38;5;12mIf you want to contribute, please read the [39m[38;5;14m[1mcontribution guidelines[0m[38;5;12m (https://github.com/tayllan/awesome-algorithms/blob/master/CONTRIBUTING.md).[39m
|
||
|
||
[38;5;12m- [39m[38;5;14m[1mAwesome Algorithms[0m[38;5;12m (#awesome-algorithms)[39m
|
||
[48;5;235m[38;5;249m- **Websites** (#websites)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m- **YouTube Playlists** (#youtube-playlists)[49m[39m
|
||
[48;5;235m[38;5;249m- **Online Courses** (#online-courses)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m- **Books** (#books)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m- **Cheat Sheets** (#cheat-sheets)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m- **Github Libraries** (#github-libraries)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m- **Online Judges** (#online-judges)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m- **Tools** (#tools)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
|
||
[38;2;255;187;0m[4mWebsites[0m
|
||
|
||
[48;2;30;30;40m[38;5;13m[3mWebsites you should use to learn classic algorithms[0m
|
||
|
||
[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[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
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCode-Drills[0m[38;5;12m (https://code-drills.com/tools/comparator) - Practice problems recommender (includes Codeforces, Codechef, and Spoj).[39m
|
||
[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;12m [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[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
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mStoimen's web log[0m[38;5;12m (http://www.stoimen.com/) - Some algorithms nicely explained.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mThe Sound of Sorting[0m[38;5;12m (http://panthema.net/2013/sound-of-sorting/) - The Sound of Sorting - "Audibilization" and Visualization of Sorting Algorithms[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mVisuAlgo[0m[38;5;12m (http://visualgo.net) - Visualising data structures and algorithms through animation.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mWikipedia - Algorithms[0m[38;5;12m (https://en.wikipedia.org/wiki/List_of_algorithms) - Of course!![39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mWikipedia - Data Structures[0m[38;5;12m (https://en.wikipedia.org/wiki/List_of_data_structures) - and why not ?!![39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mLearnersbucket[0m[38;5;12m (https://learnersbucket.com/) - Tutorials on data structures and algorithms in Javascript.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mredblobgames[0m[38;5;12m (https://www.redblobgames.com/) - interactive visual explanations of math and algorithms, using motivating examples from computer games.[39m
|
||
|
||
[38;2;255;187;0m[4mYoutube Playlists[0m
|
||
|
||
[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[1mAbdul[0m[38;5;14m[1m [0m[38;5;14m[1mBari[0m[38;5;14m[1m [0m[38;5;14m[1m-[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[1mAlgorithm[0m[38;5;12m [39m[38;5;12m(https://www.youtube.com/watch?v=0IAPZzGSbME&list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mThis[39m[38;5;12m [39m[38;5;12mplaylist[39m[38;5;12m [39m[38;5;12mis[39m[38;5;12m [39m[38;5;12mso[39m[38;5;12m [39m[38;5;12mmuch[39m[38;5;12m [39m[38;5;12minformative[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mprovide[39m[38;5;12m [39m[38;5;12msimulation[39m[38;5;12m [39m
|
||
[38;5;12mwith[39m[38;5;12m [39m[38;5;12mcode[39m[38;5;12m [39m[38;5;12mexample.[39m[38;5;12m [39m[38;5;12mAs[39m[38;5;12m [39m[38;5;12mlike[39m[38;5;12m [39m[38;5;12mas[39m[38;5;12m [39m[38;5;12myou[39m[38;5;12m [39m[38;5;12mare[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mclass.[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
|
||
|
||
[48;2;30;30;40m[38;5;13m[3mFree and High-Quality Courses Online[0m
|
||
|
||
[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: 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;12m [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;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[0m[38;5;14m[1m [0m[38;5;14m[1m-[0m[38;5;14m[1m [0m[38;5;14m[1m6-046j[0m[38;5;12m [39m[38;5;12m(http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mSimilar[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mprevious[39m[38;5;12m [39m[38;5;12mone,[39m[38;5;12m [39m[38;5;12mbut[39m
|
||
[38;5;12mwith[39m[38;5;12m [39m[38;5;12mdifferent[39m[38;5;12m [39m[38;5;12malgorithms.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mMIT[0m[38;5;14m[1m [0m[38;5;14m[1m-[0m[38;5;14m[1m [0m[38;5;14m[1m6-00sc[0m[38;5;12m [39m[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)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mAn[39m[38;5;12m [39m[38;5;12measy[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m
|
||
[38;5;12mwell-explained[39m[38;5;12m [39m[38;5;12mintroduction[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12malgorithms.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mMIT[0m[38;5;14m[1m [0m[38;5;14m[1m18-409[0m[38;5;14m[1m [0m[38;5;14m[1m-[0m[38;5;14m[1m [0m[38;5;14m[1mTopics[0m[38;5;14m[1m [0m[38;5;14m[1min[0m[38;5;14m[1m [0m[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;14m[1m [0m[38;5;14m[1mAn[0m[38;5;14m[1m [0m[38;5;14m[1mAlgorithmist's[0m[38;5;14m[1m [0m[38;5;14m[1mToolkit[0m[38;5;12m [39m
|
||
[38;5;12m(https://ocw.mit.edu/courses/18-409-topics-in-theoretical-computer-science-an-algorithmists-toolkit-fall-2009/)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mIt[39m[38;5;12m [39m[38;5;12mcovers[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mcollection[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mgeometric[39m[38;5;12m [39m[38;5;12mtechniques[39m[38;5;12m [39m[38;5;12mthat[39m[38;5;12m [39m[38;5;12mapply[39m[38;5;12m [39m[38;5;12mbroadly[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mmodern[39m[38;5;12m [39m
|
||
[38;5;12malgorithm[39m[38;5;12m [39m[38;5;12mdesign.[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
|
||
|
||
[38;2;255;187;0m[4mBooks[0m
|
||
|
||
[48;2;30;30;40m[38;5;13m[3mThe most highly regarded books to learn algorithms[0m
|
||
|
||
[38;2;255;187;0m[4mAlgorithms and Data structures[0m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithm Design[0m[38;5;12m (https://www.pearsonhighered.com/program/Kleinberg-Algorithm-Design/PGM319216.html) - Pretty straightforward.[39m
|
||
[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[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
|
||
[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[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[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[1mMcConnell.[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/Analysis-Algorithms-Jeffrey-McConnell/dp/0763707821)[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;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
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mPrinceton DS Cheat Sheet[0m[38;5;12m (https://algs4.cs.princeton.edu/cheatsheet/)[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCLRS in short[0m[38;5;12m (https://sinon.org/algorithms//#data-structures)[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mRice university DS course in short[0m[38;5;12m (https://www.clear.rice.edu/comp160/data1.html)[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mUseful Reddit thread[0m[38;5;12m (https://www.reddit.com/r/learnprogramming/comments/3gpvyx/algorithms_and_data_structures_cheat_sheets/)[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgo Deck[0m[38;5;12m (https://github.com/teivah/algodeck/) - An open-source collection of +200 algorithmic cards.[39m
|
||
|
||
[38;2;255;187;0m[4mGithub Libraries[0m
|
||
|
||
[48;2;30;30;40m[38;5;13m[3mImplementations of the most classic algorithms in a wide variety of programming languages[0m
|
||
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mC[39m
|
||
[48;5;235m[38;5;249m* **by @fragglet** (https://github.com/fragglet/c-algorithms)[49m[39m
|
||
[48;5;235m[38;5;249m* **by @TheAlgorithms** (https://github.com/TheAlgorithms/C)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCoffeeScript[0m[38;5;12m (https://github.com/BrunoRB/algorithms.coffee)[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mC#[39m
|
||
[48;5;235m[38;5;249m* **by @shkolovy** (https://github.com/shkolovy/classic-algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @aalhour** (https://github.com/aalhour/C-Sharp-Algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @justcoding121** (https://github.com/justcoding121/Advanced-Algorithms)[49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mC++[39m
|
||
[48;5;235m[38;5;249m* **by @xtaci** (https://github.com/xtaci/algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @PetarV-** (https://github.com/PetarV-/Algorithms)[49m[39m
|
||
[48;5;235m[38;5;249m* **by @faheel** (https://github.com/faheel/Algos)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @sslotin** (http://github.com/sslotin/algo)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mErlang[0m[38;5;12m (https://github.com/aggelgian/erlang-algorithms)[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mGo[39m
|
||
[48;5;235m[38;5;249m* **by @arnauddri** (https://github.com/arnauddri/algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @floyernick** (https://github.com/floyernick/Data-Structures-and-Algorithms)[49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mJava[39m
|
||
[48;5;235m[38;5;249m* **by @jpa99** (https://github.com/jpa99/Algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @phishman3579** (https://github.com/phishman3579/java-algorithms-implementation)[49m[39m
|
||
[48;5;235m[38;5;249m* **by @asmolich** (https://github.com/asmolich/algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @psjava** (https://github.com/psjava/psjava)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @jeandersonbc** (https://github.com/jeandersonbc/algorithms-and-ds)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @pedrovgs** (https://github.com/pedrovgs/Algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @Erdos-Graph-Framework** (https://github.com/Erdos-Graph-Framework/Erdos)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @deepak-malik** (https://github.com/deepak-malik/Data-Structures-In-Java)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @yusufcakal** (https://github.com/yusufcakal/algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @FarheenB** (https://github.com/FarheenB/Data-Structures-and-Algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mJavaScript[39m
|
||
[48;5;235m[38;5;249m* **by @jiayihu** (https://github.com/jiayihu/pretty-algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @felipernb** (https://github.com/felipernb/algorithms.js)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @nzakas** (https://github.com/nzakas/computer-science-in-javascript)[49m[39m
|
||
[48;5;235m[38;5;249m* **by @duereg** (https://github.com/duereg/js-algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @mgechev** (https://github.com/mgechev/javascript-algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @trekhleb** (https://github.com/trekhleb/javascript-algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @ManrajGrover** (https://github.com/ManrajGrover/algorithms-js)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @amejiarosario** (https://github.com/amejiarosario/dsa.js)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @zonayedpca** (https://github.com/zonayedpca/AlgoDS.js)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mLua[39m
|
||
[48;5;235m[38;5;249m* **by @evandrolg** (https://github.com/EvandroLG/computer_science_in_lua)[49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mObjective-C[39m
|
||
[48;5;235m[38;5;249m* **by @ EvgenyKarkan** (https://github.com/EvgenyKarkan/EKAlgorithms)[49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mPHP[39m
|
||
[48;5;235m[38;5;249m* **by @TheAlgorithms** (https://github.com/TheAlgorithms/PHP)[49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mPython[39m
|
||
[48;5;235m[38;5;249m* **by @nryoung** (https://github.com/nryoung/algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @prakhar1989** (https://github.com/prakhar1989/Algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @laurentluce** (https://github.com/laurentluce/python-algorithms)[49m[39m
|
||
[48;5;235m[38;5;249m* **by @nbro** (https://github.com/nbro/ands)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @keon** (https://github.com/keon/algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @vinta** (https://github.com/vinta/fuck-coding-interviews)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mRuby[39m
|
||
[48;5;235m[38;5;249m* **by @kanwei** (https://github.com/kanwei/algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @sagivo** (https://github.com/sagivo/algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @kumar91gopi** (https://github.com/kumar91gopi/Algorithms-and-Data-Structures-in-Ruby)[49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mScala[0m[38;5;12m (https://github.com/vkostyukov/scalacaster)[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mSwift[39m
|
||
[48;5;235m[38;5;249m* **by @kingreza** (https://github.com/kingreza/Swift-Algorithms-Strings-)[49m[39m
|
||
[48;5;235m[38;5;249m* **by @waynewbishop** (https://github.com/waynewbishop/SwiftStructures)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @hollance** (https://github.com/hollance/swift-algorithm-club)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;12mLanguage agnostic[39m
|
||
[48;5;235m[38;5;249m* **by @kennyledet** (https://github.com/kennyledet/Algorithm-Implementations)[49m[39m
|
||
[48;5;235m[38;5;249m* **by @indy256** (https://github.com/indy256/codelibrary)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @sagivo** (https://github.com/sagivo/algorithms)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @patmorin** (https://github.com/patmorin/ods)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
[48;5;235m[38;5;249m* **by @btjanaka** (https://github.com/btjanaka/algorithm-problems)[49m[39m[48;5;235m[38;5;249m [49m[39m
|
||
|
||
[38;2;255;187;0m[4mOnline Judges[0m
|
||
|
||
[48;2;30;30;40m[38;5;13m[3mOnline Judges to practice what you learned above[0m
|
||
|
||
[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[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[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
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCodefights[0m[38;5;12m (https://codefights.com/) - Practice programming and tackle your next tech interview[39m
|
||
[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[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
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mHiHoCoder[0m[38;5;12m (http://hihocoder.com/) - Chinese and English problem-solving practice and recruitment challenge site.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mInfoarena[0m[38;5;12m (http://www.infoarena.ro/) - Romanian Online Judge. 1500+ algorithmic problems[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mInterviewbit[0m[38;5;12m (https://www.interviewbit.com/) - Learn, practice, and prepare for interviews.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mKattis[0m[38;5;12m (https://open.kattis.com/)- Online judge and problem archive[39m
|
||
[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[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
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mShareCode.io [0m[38;5;12m (https://sharecode.io/) - Online Judge and contest host with a lot of algorithmic problems in the archive to practice.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mSnakify[0m[38;5;12m (https://snakify.org/) - An introductory Python course with 100+ algorithmic problems and a step-by-step debugger (from Russia).[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mSPOJ[0m[38;5;12m (http://www.spoj.com/) - More problems.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mTopCoder[0m[38;5;12m (https://www.topcoder.com/) - Lots of problems and real-world/money-worthy problems in Graphic Design, Data Science, and Development.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mToph[0m[38;5;12m (https://toph.co/) - Bangladeshi Online Judge. Holds online contests regularly.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mURI[0m[38;5;12m (https://www.urionlinejudge.com.br/judge/login) - Brazilian Online Judge. Not so many problems, but it's growing and it has online contests.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mUVA[0m[38;5;12m (https://uva.onlinejudge.org/) - Hundreds of problems (from previous ACM-ICPC Regionals, World Finals, and others).[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mCodility[0m[38;5;12m (https://app.codility.com/programmers/challenges/) - Compete to land coding jobs at top companies[39m
|
||
|
||
[38;2;255;187;0m[4mBlogs[0m
|
||
|
||
[48;2;30;30;40m[38;5;13m[3mAwesome list of blogs, mainly for competitive programming but you can refer to these when learning a new topic/algorithm[0m
|
||
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAn awesome list for competitive programming![0m[38;5;12m (https://codeforces.com/blog/entry/23054) - Awesome blog for all the resources and list of books and algorithms.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms Weekly[0m[38;5;12m (https://petr-mitrichev.blogspot.com/) - A good blog by Petr Mitrichev, mainly in Java.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mSport of Programming[0m[38;5;12m (https://www.hackerearth.com/practice/notes/getting-started-with-the-sport-of-programming/) - Informative blog for starting with the sport of programming.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithms and Data Structures[0m[38;5;12m (http://www.allisons.org/ll/AlgDS/) - For getting a deeper knowledge of algorithms and how to think in the right direction.[39m
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1mAlgorithm Tutorials by Tanuj Khattar[0m
|
||
[38;5;12m (https://tanujkhattar.wordpress.com/) - Excellent blog by Tanuj Khattar. Covers tutorials on some interesting data structures along with example problems to solve. [39m
|
||
|
||
|
||
[38;2;255;187;0m[4mTools[0m
|
||
|
||
[48;2;30;30;40m[38;5;13m[3mSome tools that can help you in the learning of algorithms[0m
|
||
|
||
[48;5;12m[38;5;11m⟡[49m[39m[38;5;12m [39m[38;5;14m[1minteractive-coding-challenges[0m[38;5;12m (https://github.com/donnemartin/interactive-coding-challenges) - Interactive, test-driven coding challenges (algorithms and data structures).[39m
|
||
|
||
[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;2;255;187;0m[4mLicense[0m
|
||
|
||
[38;5;12mAnd for the sake of copyleft, here's our license:[39m
|
||
|
||
[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
|