update lists
This commit is contained in:
305
html/algorithmseducation.html
Normal file
305
html/algorithmseducation.html
Normal file
@@ -0,0 +1,305 @@
|
||||
<h1 id="awesome-algorithms-education-awesome">Awesome Algorithms
|
||||
Education <a href="https://awesome.re"><img
|
||||
src="https://awesome.re/badge.svg" alt="Awesome" /></a></h1>
|
||||
<p>An algorithm is a list of rules to follow in order to solve a
|
||||
problem.</p>
|
||||
<p>Algorithms need to have their steps in the right order. Think about
|
||||
an algorithm for getting dressed in the morning. What if you put on your
|
||||
coat before your jumper? Your jumper would be on top of your coat and
|
||||
that would be silly! When you write an algorithm the order of the
|
||||
instructions is very important.</p>
|
||||
<p>If you want to contribute, please read the <a
|
||||
href="https://github.com/gaerae/awesome-algorithms/blob/master/contributing.md">contribution
|
||||
guidelines</a>.</p>
|
||||
<p>Language: <strong><a href="readme-en.md">😎 English</a></strong> • <a
|
||||
href="readme-ko.md">한국어 (Korean)</a></p>
|
||||
<h2 id="contents">Contents</h2>
|
||||
<ul>
|
||||
<li><a href="#courses">Courses</a></li>
|
||||
<li><a href="#competitive-programming">Competitive programming</a></li>
|
||||
<li><a href="#visualizations">Visualizations</a></li>
|
||||
<li><a href="#interviews">Interviews</a></li>
|
||||
<li><a href="#videos">Videos</a></li>
|
||||
<li><a href="#books">Books</a></li>
|
||||
<li><a href="#articles">Articles</a></li>
|
||||
<li><a href="#competitions">Competitions</a></li>
|
||||
<li><a href="#miscellaneous">Miscellaneous</a></li>
|
||||
</ul>
|
||||
<h2 id="courses">Courses</h2>
|
||||
<h4 id="introductory">Introductory</h4>
|
||||
<ul>
|
||||
<li><a
|
||||
href="https://www.khanacademy.org/computing/computer-science/algorithms">Algorithms</a>
|
||||
- Khan Academy.</li>
|
||||
<li><a
|
||||
href="http://www.geeksforgeeks.org/fundamentals-of-algorithms">Fundamentals
|
||||
of Algorithms</a> - Geeks for Geeks.</li>
|
||||
<li><a
|
||||
href="https://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98-%EA%B0%95%EC%A2%8C">Algorithm
|
||||
course for smart programming</a> - Korean / Inflearn.</li>
|
||||
</ul>
|
||||
<h4 id="intermediate">Intermediate</h4>
|
||||
<ul>
|
||||
<li><a
|
||||
href="https://www.class-central.com/subject/algorithms-and-data-structures">Algorithms
|
||||
and Data Structures</a> - Class Central.</li>
|
||||
<li><a href="https://www.edx.org/course/algorithms">Algorithms</a> -
|
||||
edX(IITBombay).</li>
|
||||
<li><a
|
||||
href="https://www.udacity.com/course/intro-to-algorithms--cs215">Intro
|
||||
to Algorithms</a> - Udacity.</li>
|
||||
<li><a
|
||||
href="https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015">Design
|
||||
and Analysis of Algorithms, 2015</a> - MIT OCW.</li>
|
||||
<li><a
|
||||
href="https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011">Introduction
|
||||
to Algorithms, 2011</a> - MIT OCW.</li>
|
||||
<li><a href="http://erikdemaine.org/classes">Classes and Teaching by
|
||||
Erik Demaine</a> - MIT(Lecture notes).</li>
|
||||
<li><a href="https://people.eecs.berkeley.edu/~jrs/170/">Efficient
|
||||
Algorithms and Intractable Problems, 2001</a> - UC Berkeley(Lecture
|
||||
notes).</li>
|
||||
<li><a href="https://people.eecs.berkeley.edu/~jrs/61b/">Data
|
||||
Structures, 2014</a> - UC Berkeley(Lecture notes).</li>
|
||||
<li><a href="https://people.eecs.berkeley.edu/~jrs/61b/">Algorithms,
|
||||
Etc., 2015</a> - Illinois University(Lecture notes).</li>
|
||||
<li><a
|
||||
href="https://www.coursera.org/learn/algorithms-part1">Algorithms, Part
|
||||
I</a> - Coursera(Princeton University).</li>
|
||||
<li><a
|
||||
href="https://www.coursera.org/learn/algorithms-part2">Algorithms, Part
|
||||
II</a> - Coursera(Princeton University).</li>
|
||||
</ul>
|
||||
<h4 id="advanced">Advanced</h4>
|
||||
<ul>
|
||||
<li><a
|
||||
href="http://online-learning.harvard.edu/course/data-structures-and-algorithms">Data
|
||||
Structures and Algorithms</a> - Paid Content. / Harvard University.</li>
|
||||
<li><a
|
||||
href="https://www.coursera.org/specializations/algorithms">Algorithms
|
||||
Specialization</a> - Paid Content. / Coursera(Stanford University).</li>
|
||||
</ul>
|
||||
<h2 id="competitive-programming">Competitive programming</h2>
|
||||
<ul>
|
||||
<li><a
|
||||
href="https://www.hackerrank.com/domains/algorithms">HackerRank</a></li>
|
||||
<li><a href="https://app.codility.com/programmers">Codility</a></li>
|
||||
<li><a href="https://www.topcoder.com">TopCoder</a></li>
|
||||
<li><a href="http://www.codewars.com">CodeWars</a></li>
|
||||
<li><a href="https://www.codechef.com">CodeChef</a></li>
|
||||
<li><a href="http://codeforces.com">Codeforces</a> - English, Romanian,
|
||||
Russian.</li>
|
||||
<li><a href="https://uva.onlinejudge.org">UVA</a></li>
|
||||
<li><a href="https://a2oj.com">A2 Online Judge</a></li>
|
||||
<li><a href="https://icpcarchive.ecs.baylor.edu">ACM-ICPC Live
|
||||
Archive</a></li>
|
||||
<li><a href="https://csacademy.com">CS Academy</a> - English, Russian,
|
||||
Arabic.</li>
|
||||
<li><a
|
||||
href="https://coderbyte.com/course/learn-data-structures-and-algorithms">CoderByte</a></li>
|
||||
<li><a href="https://www.hackerearth.com">HackerEarth</a></li>
|
||||
<li><a href="http://www.infoarena.ro">Infoarena</a> - Romanian.</li>
|
||||
<li><a href="https://open.kattis.com">Kattis</a></li>
|
||||
<li><a href="https://www.learneroo.com/subjects/8">Learneroo Algorithms
|
||||
Tutorials</a></li>
|
||||
<li><a href="https://leetcode.com/problemset/algorithms">LeetCode</a> -
|
||||
English, Chinese.</li>
|
||||
<li><a href="http://rosalind.info/problems/locations">Rosalind</a></li>
|
||||
<li><a href="https://sharecode.io">ShareCode</a></li>
|
||||
<li><a href="https://snakify.org">Snakify</a></li>
|
||||
<li><a href="http://www.spoj.com">Sphere Online Judge (SPOJ)</a></li>
|
||||
<li><a href="https://www.urionlinejudge.com.br">URI</a> - English,
|
||||
Spanish, Brazilian Portuguese.</li>
|
||||
<li><a href="http://poj.org">PKU JudgeOnline</a> - English,
|
||||
Chinese.</li>
|
||||
<li><a href="http://judge.u-aizu.ac.jp/onlinejudge">AIZU ONLINE
|
||||
JUDGE</a> - English, Japanese.</li>
|
||||
<li><a href="https://projecteuler.net">Project Euler</a></li>
|
||||
<li><a href="http://euler.synap.co.kr">Project Euler <span
|
||||
class="citation" data-cites="kr">@kr</span></a> - Korean.</li>
|
||||
<li><a href="https://www.acmicpc.net">Baekjoon</a> - Korean.</li>
|
||||
<li><a href="https://algospot.com">Algospot</a> - Korean.</li>
|
||||
<li><a href="http://www.dovelet.com">Dovelet</a> - Korean.</li>
|
||||
<li><a href="http://www.jungol.co.kr">JUNGOL</a> - Korean.</li>
|
||||
<li><a href="http://koistudy.net">Koistudy</a> - Korean.</li>
|
||||
<li><a href="http://codeup.kr">CodeUp</a> - Korean.</li>
|
||||
<li><a href="http://codingdojang.com">Codingdojang</a> - Korean.</li>
|
||||
<li><a href="https://programmers.co.kr/learn/challenges">Programmers</a>
|
||||
- Korean.</li>
|
||||
<li><a href="https://www.codeground.org">Codeground</a> - English,
|
||||
Korean.</li>
|
||||
<li><a href="https://www.swexpertacademy.com">SW Expert Academy</a> -
|
||||
Korean.</li>
|
||||
</ul>
|
||||
<h2 id="visualizations">Visualizations</h2>
|
||||
<ul>
|
||||
<li><a href="http://algo-visualizer.jasonpark.me">Algorithm
|
||||
Visualizer</a></li>
|
||||
<li><a href="https://workshape.github.io/visual-graph-algorithms/">A
|
||||
Visual Guide to Graph Traversal Algorithms</a></li>
|
||||
<li><a href="https://visualgo.net">VisuAlgo</a> - English, Korean,
|
||||
Chinese, Japanese.</li>
|
||||
<li><a href="http://www.algomation.com">Algomation</a></li>
|
||||
<li><a href="http://bost.ocks.org/mike/algorithms/">Algorithms
|
||||
Visualization</a></li>
|
||||
<li><a
|
||||
href="https://www.cs.usfca.edu/~galles/visualization/Algorithms.html">Data
|
||||
Structure Visualizations</a></li>
|
||||
<li><a
|
||||
href="https://www.toptal.com/developers/sorting-algorithms">Sorting
|
||||
Algorithms Animations</a></li>
|
||||
<li><a href="http://sorting.at">SORTING</a></li>
|
||||
<li><a href="http://whocouldthat.be/visualizing-string-matching">String
|
||||
Matching Visualization</a></li>
|
||||
<li><a href="https://qiao.github.io/PathFinding.js/visual/">Path
|
||||
Finding</a></li>
|
||||
<li><a href="http://will.thimbleby.net/algorithms">Algorithm Wiki by
|
||||
Will Thimbleby</a></li>
|
||||
<li><a href="http://playground.tensorflow.org">TensorFlow
|
||||
Playground</a></li>
|
||||
<li><a href="https://github.com/enjalot/algovis">Tangle</a> - JavaScript
|
||||
Programming Language.</li>
|
||||
<li><a href="http://rosulek.github.io/vamonos">Vamonos</a> - JavaScript
|
||||
Programming Language.</li>
|
||||
<li><a href="http://panthema.net/2013/sound-of-sorting">The Sound of
|
||||
Sorting</a> - C ++ Programming Language.</li>
|
||||
<li><a href="http://www.aviz.fr/geneaquilts">GeneaQuilts</a> - Java
|
||||
Programming Language.</li>
|
||||
</ul>
|
||||
<h2 id="interviews">Interviews</h2>
|
||||
<ul>
|
||||
<li><a href="https://www.interviewcake.com">Interview Cake</a></li>
|
||||
<li><a
|
||||
href="https://www.programcreek.com/2012/11/top-10-algorithms-for-coding-interview">Top
|
||||
10 Algorithms for Coding Interview</a></li>
|
||||
<li><a href="https://github.com/kdn251/interviews">Software Engineering
|
||||
technical interviews</a></li>
|
||||
<li><a href="https://github.com/yangshun/tech-interview-handbook">Tech
|
||||
Interview Handbook</a></li>
|
||||
<li><a
|
||||
href="https://github.com/donnemartin/interactive-coding-challenges">Interactive
|
||||
Python coding interview challenges</a></li>
|
||||
</ul>
|
||||
<h2 id="videos">Videos</h2>
|
||||
<ul>
|
||||
<li><a
|
||||
href="https://www.ted.com/talks/kevin_slavin_how_algorithms_shape_our_world">How
|
||||
algorithms shape our world</a> - Kevin Slavin.</li>
|
||||
<li><a
|
||||
href="https://www.youtube.com/playlist?list=PL01A89F4E9E5F3ADE">Algorithms</a>
|
||||
- Oresoft LWC.</li>
|
||||
<li><a
|
||||
href="https://www.youtube.com/playlist?list=PLD9781AC5EBC9FA16">Computer
|
||||
Sc - Programming and Data Structure</a> - Nptelhrd.</li>
|
||||
<li><a
|
||||
href="https://www.youtube.com/playlist?list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp">Design
|
||||
and Analysis of Algorithms, 2015</a></li>
|
||||
<li><a
|
||||
href="https://www.youtube.com/playlist?list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb">Introduction
|
||||
to Algorithms, 2011</a></li>
|
||||
<li><a href="https://youtu.be/es2T6KY45cA">Merge Sort vs Quick
|
||||
Sort</a></li>
|
||||
<li><a href="https://youtu.be/kPRA0W1kECg">15 Sorting Algorithms in 6
|
||||
Minutes</a></li>
|
||||
<li><a
|
||||
href="https://www.youtube.com/user/AlgoRythmics/videos">AlgoRythmics</a>
|
||||
- Sapientia University.</li>
|
||||
</ul>
|
||||
<h2 id="books">Books</h2>
|
||||
<ul>
|
||||
<li><a href="https://github.com/liuxinyu95/AlgoXY">Elementary
|
||||
Algorithms</a></li>
|
||||
<li><a href="https://people.mpi-inf.mpg.de/~mehlhorn/Toolbox.html">Data
|
||||
Structures and Algorithms</a></li>
|
||||
<li><a href="http://www.digitalculture.or.kr/koi/StudyBook.do">Korea
|
||||
Olympiad in Informatics</a></li>
|
||||
<li><a
|
||||
href="http://futuredata.stanford.edu/classes/cs345s/handouts/kitchin.pdf">Thinking
|
||||
critically about and researching algorithms</a></li>
|
||||
<li><a href="http://www.crackingthecodinginterview.com">CRACKING the
|
||||
CODING INTERVIEW</a> - <a
|
||||
href="https://github.com/careercup/CtCI-6th-Edition">GitHub</a>, <a
|
||||
href="https://www.quora.com/profile/Gayle-Laakmann-McDowell">Quora</a>.</li>
|
||||
<li><a
|
||||
href="https://www.pearsonhighered.com/program/Kleinberg-Algorithm-Design/PGM319216.html">Algorithm
|
||||
Design</a></li>
|
||||
<li><a href="http://algs4.cs.princeton.edu/home/">Algorithms</a></li>
|
||||
<li><a
|
||||
href="http://mitpress.mit.edu/books/introduction-algorithms">Introduction
|
||||
to Algorithms</a></li>
|
||||
<li><a href="http://www.manning.com/bhargava">Grokking
|
||||
Algorithms</a></li>
|
||||
<li><a href="http://book.algospot.com">Algorithmic Problem Solving
|
||||
Strategies</a> - Korean.</li>
|
||||
</ul>
|
||||
<h2 id="articles">Articles</h2>
|
||||
<ul>
|
||||
<li><a href="http://www.stoimen.com/category/algorithms">stoimen’s web
|
||||
log</a></li>
|
||||
<li><a
|
||||
href="https://www.quora.com/What-are-the-best-and-efficient-ways-to-learn-algorithms-for-beginners">What
|
||||
are the best and efficient ways to learn algorithms for
|
||||
beginners?</a></li>
|
||||
<li><a
|
||||
href="https://www.quora.com/What-are-the-best-books-on-algorithms-and-data-structures">What
|
||||
are the best books on algorithms and data structures?</a></li>
|
||||
<li><a href="http://d2.naver.com/news/4850628">Study data for
|
||||
algorithm</a> - Korean.</li>
|
||||
</ul>
|
||||
<h2 id="competitions">Competitions</h2>
|
||||
<ul>
|
||||
<li><a href="https://codingcompetitions.withgoogle.com/codejam">Google
|
||||
Code Jam</a> - Google’s largest coding competition, calls on programmers
|
||||
around the world to put their skills to the test by solving multiple
|
||||
rounds of algorithmic puzzles.</li>
|
||||
<li><a href="https://codingcompetitions.withgoogle.com/kickstart">Google
|
||||
Kick Start</a> - University students looking to develop their coding
|
||||
skills and potentially pursue a Google career.</li>
|
||||
<li><a href="https://codingcompetitions.withgoogle.com/hashcode">Google
|
||||
Hash Code</a> - Students in Africa, Europe, and the Middle East looking
|
||||
to work as a team on real Google problems.</li>
|
||||
<li><a href="https://summerofcode.withgoogle.com">Google Summer of
|
||||
Code</a> - A global program focused on introducing students to open
|
||||
source software development. Students work on a 3 month programming
|
||||
project with an open source organization during their break from
|
||||
university.</li>
|
||||
</ul>
|
||||
<h2 id="miscellaneous">Miscellaneous</h2>
|
||||
<ul>
|
||||
<li><a
|
||||
href="https://github.com/lnishan/awesome-competitive-programming#readme">Competitive
|
||||
Programming</a></li>
|
||||
<li><a href="https://www.youtube.com/user/MIT/playlists">MIT
|
||||
OpenCourseWare</a></li>
|
||||
<li><a
|
||||
href="http://oedb.org/open/search-results/?search-term=algorithm">OEDb(Open
|
||||
Education Databases): Algorithm</a></li>
|
||||
<li><a
|
||||
href="https://github.com/bulutyazilim/awesome-datascience">Awesome Data
|
||||
Science</a></li>
|
||||
<li><a
|
||||
href="https://github.com/josephmisiti/awesome-machine-learning">Awesome
|
||||
Machine Learning</a></li>
|
||||
<li><a href="http://rosettacode.org/wiki/Rosetta_Code">Rosetta Code</a>
|
||||
- The idea is to present solutions to the same task in as many different
|
||||
languages as possible, to demonstrate how languages are similar and
|
||||
different, and to aid a person with a grounding in one approach to a
|
||||
problem in learning another.</li>
|
||||
<li><a href="https://code.org">Code.org</a> - Anybody can learn.</li>
|
||||
<li><a href="https://checkio.org">CheckiO</a> - Online game for Python
|
||||
and JavaScript coders.</li>
|
||||
<li><a href="https://github.com/freefcw/hustoj-neo">HUST Online Judge
|
||||
System</a> - Online Judge is a web application.</li>
|
||||
<li><a href="https://goo.gl/qwgBAp">Tech stack for Baekjoon online
|
||||
judge</a> - Korean / How to choose a technology stack for judge?</li>
|
||||
</ul>
|
||||
<h2 id="license">License</h2>
|
||||
<p><a href="https://creativecommons.org/publicdomain/zero/1.0/"><img
|
||||
src="https://mirrors.creativecommons.org/presskit/buttons/88x31/svg/cc-zero.svg"
|
||||
alt="CC0" /></a></p>
|
||||
<p>To the extent possible under law, <a
|
||||
href="https://github.com/gaerae">gaerae</a> has waived all copyright and
|
||||
related or neighboring rights to this work.</p>
|
||||
<p><a
|
||||
href="https://github.com/gaerae/awesome-algorithms-education">algorithmseducation.md
|
||||
Github</a></p>
|
||||
Reference in New Issue
Block a user