update
This commit is contained in:
160
terminal/algorithmseducation2
Normal file
160
terminal/algorithmseducation2
Normal file
@@ -0,0 +1,160 @@
|
||||
[38;5;12m [39m[38;2;255;187;0m[1m[4mAwesome Algorithms Education [0m[38;5;14m[1m[4m![0m[38;2;255;187;0m[1m[4mAwesome[0m[38;5;14m[1m[4m (https://awesome.re/badge.svg)[0m[38;2;255;187;0m[1m[4m (https://awesome.re)[0m
|
||||
[38;5;12mAn algorithm is a list of rules to follow in order to solve a problem.[39m
|
||||
|
||||
[38;5;12mAlgorithms[39m[38;5;12m [39m[38;5;12mneed[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mhave[39m[38;5;12m [39m[38;5;12mtheir[39m[38;5;12m [39m[38;5;12msteps[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mright[39m[38;5;12m [39m[38;5;12morder.[39m[38;5;12m [39m[38;5;12mThink[39m[38;5;12m [39m[38;5;12mabout[39m[38;5;12m [39m[38;5;12man[39m[38;5;12m [39m[38;5;12malgorithm[39m[38;5;12m [39m[38;5;12mfor[39m[38;5;12m [39m[38;5;12mgetting[39m[38;5;12m [39m[38;5;12mdressed[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12mmorning.[39m[38;5;12m [39m[38;5;12mWhat[39m[38;5;12m [39m[38;5;12mif[39m[38;5;12m [39m[38;5;12myou[39m[38;5;12m [39m[38;5;12mput[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12myour[39m[38;5;12m [39m[38;5;12mcoat[39m[38;5;12m [39m[38;5;12mbefore[39m[38;5;12m [39m[38;5;12myour[39m[38;5;12m [39m[38;5;12mjumper?[39m[38;5;12m [39m[38;5;12mYour[39m[38;5;12m [39m[38;5;12mjumper[39m[38;5;12m [39m[38;5;12mwould[39m[38;5;12m [39m[38;5;12mbe[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12mtop[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12myour[39m[38;5;12m [39m[38;5;12mcoat[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mthat[39m[38;5;12m [39m[38;5;12mwould[39m[38;5;12m [39m[38;5;12mbe[39m[38;5;12m [39m[38;5;12msilly![39m[38;5;12m [39m[38;5;12mWhen[39m[38;5;12m [39m[38;5;12myou[39m[38;5;12m [39m[38;5;12mwrite[39m
|
||||
[38;5;12man[39m[38;5;12m [39m[38;5;12malgorithm[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12morder[39m[38;5;12m [39m[38;5;12mof[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12minstructions[39m[38;5;12m [39m[38;5;12mis[39m[38;5;12m [39m[38;5;12mvery[39m[38;5;12m [39m[38;5;12mimportant.[39m
|
||||
|
||||
[38;5;12mIf you want to contribute, please read the [39m[38;5;14m[1mcontribution guidelines[0m[38;5;12m (https://github.com/gaerae/awesome-algorithms/blob/master/contributing.md).[39m
|
||||
|
||||
[38;5;12mLanguage: [39m[38;5;12m😎 English[39m[38;5;14m[1m (readme-en.md)[0m[38;5;12m • [39m[38;5;14m[1m한국어 (Korean)[0m[38;5;12m (readme-ko.md)[39m
|
||||
|
||||
[38;2;255;187;0m[4mContents[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mCourses[0m[38;5;12m (#courses)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCompetitive programming[0m[38;5;12m (#competitive-programming)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mVisualizations[0m[38;5;12m (#visualizations)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mInterviews[0m[38;5;12m (#interviews)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mVideos[0m[38;5;12m (#videos)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mBooks[0m[38;5;12m (#books)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mArticles[0m[38;5;12m (#articles)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCompetitions[0m[38;5;12m (#competitions)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mMiscellaneous[0m[38;5;12m (#miscellaneous)[39m
|
||||
|
||||
[38;2;255;187;0m[4mCourses[0m
|
||||
[38;2;255;187;0m[4mIntroductory[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithms[0m[38;5;12m (https://www.khanacademy.org/computing/computer-science/algorithms) - Khan Academy.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mFundamentals of Algorithms[0m[38;5;12m (http://www.geeksforgeeks.org/fundamentals-of-algorithms) - Geeks for Geeks.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithm course for smart programming[0m[38;5;12m (https://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98-%EA%B0%95%EC%A2%8C) - Korean / Inflearn.[39m
|
||||
|
||||
[38;2;255;187;0m[4mIntermediate[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithms and Data Structures[0m[38;5;12m (https://www.class-central.com/subject/algorithms-and-data-structures) - Class Central.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithms[0m[38;5;12m (https://www.edx.org/course/algorithms) - edX(IITBombay).[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mIntro to Algorithms[0m[38;5;12m (https://www.udacity.com/course/intro-to-algorithms--cs215) - Udacity.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mDesign and Analysis of Algorithms, 2015[0m[38;5;12m (https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015) - MIT OCW.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mIntroduction to Algorithms, 2011[0m[38;5;12m (https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011) - MIT OCW.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mClasses and Teaching by Erik Demaine[0m[38;5;12m (http://erikdemaine.org/classes) - MIT(Lecture notes).[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mEfficient Algorithms and Intractable Problems, 2001[0m[38;5;12m (https://people.eecs.berkeley.edu/~jrs/170/) - UC Berkeley(Lecture notes).[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mData Structures, 2014[0m[38;5;12m (https://people.eecs.berkeley.edu/~jrs/61b/) - UC Berkeley(Lecture notes).[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithms, Etc., 2015[0m[38;5;12m (https://people.eecs.berkeley.edu/~jrs/61b/) - Illinois University(Lecture notes).[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithms, Part I[0m[38;5;12m (https://www.coursera.org/learn/algorithms-part1) - Coursera(Princeton University).[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithms, Part II[0m[38;5;12m (https://www.coursera.org/learn/algorithms-part2) - Coursera(Princeton University).[39m
|
||||
|
||||
[38;2;255;187;0m[4mAdvanced[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mData Structures and Algorithms[0m[38;5;12m (http://online-learning.harvard.edu/course/data-structures-and-algorithms) - Paid Content. / Harvard University.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithms Specialization[0m[38;5;12m (https://www.coursera.org/specializations/algorithms) - Paid Content. / Coursera(Stanford University).[39m
|
||||
|
||||
[38;2;255;187;0m[4mCompetitive programming[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mHackerRank[0m[38;5;12m (https://www.hackerrank.com/domains/algorithms)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCodility[0m[38;5;12m (https://app.codility.com/programmers)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTopCoder[0m[38;5;12m (https://www.topcoder.com)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCodeWars[0m[38;5;12m (http://www.codewars.com)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCodeChef[0m[38;5;12m (https://www.codechef.com)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCodeforces[0m[38;5;12m (http://codeforces.com) - English, Romanian, Russian.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mUVA[0m[38;5;12m (https://uva.onlinejudge.org)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mA2 Online Judge[0m[38;5;12m (https://a2oj.com)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mACM-ICPC Live Archive[0m[38;5;12m (https://icpcarchive.ecs.baylor.edu)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCS Academy[0m[38;5;12m (https://csacademy.com) - English, Russian, Arabic.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCoderByte[0m[38;5;12m (https://coderbyte.com/course/learn-data-structures-and-algorithms)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mHackerEarth[0m[38;5;12m (https://www.hackerearth.com)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mInfoarena[0m[38;5;12m (http://www.infoarena.ro) - Romanian.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mKattis[0m[38;5;12m (https://open.kattis.com)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mLearneroo Algorithms Tutorials[0m[38;5;12m (https://www.learneroo.com/subjects/8)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mLeetCode[0m[38;5;12m (https://leetcode.com/problemset/algorithms) - English, Chinese.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mRosalind[0m[38;5;12m (http://rosalind.info/problems/locations)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mShareCode[0m[38;5;12m (https://sharecode.io)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSnakify[0m[38;5;12m (https://snakify.org)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSphere Online Judge (SPOJ)[0m[38;5;12m (http://www.spoj.com)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mURI[0m[38;5;12m (https://www.urionlinejudge.com.br) - English, Spanish, Brazilian Portuguese.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mPKU JudgeOnline[0m[38;5;12m (http://poj.org) - English, Chinese.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAIZU ONLINE JUDGE[0m[38;5;12m (http://judge.u-aizu.ac.jp/onlinejudge) - English, Japanese.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mProject Euler[0m[38;5;12m (https://projecteuler.net)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mProject Euler @kr[0m[38;5;12m (http://euler.synap.co.kr) - Korean.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mBaekjoon[0m[38;5;12m (https://www.acmicpc.net) - Korean.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgospot[0m[38;5;12m (https://algospot.com) - Korean.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mDovelet[0m[38;5;12m (http://www.dovelet.com) - Korean.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mJUNGOL[0m[38;5;12m (http://www.jungol.co.kr) - Korean.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mKoistudy[0m[38;5;12m (http://koistudy.net) - Korean.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCodeUp[0m[38;5;12m (http://codeup.kr) - Korean.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCodingdojang[0m[38;5;12m (http://codingdojang.com) - Korean.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mProgrammers[0m[38;5;12m (https://programmers.co.kr/learn/challenges) - Korean.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCodeground[0m[38;5;12m (https://www.codeground.org) - English, Korean.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSW Expert Academy[0m[38;5;12m (https://www.swexpertacademy.com) - Korean.[39m
|
||||
|
||||
[38;2;255;187;0m[4mVisualizations[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithm Visualizer[0m[38;5;12m (http://algo-visualizer.jasonpark.me)[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/)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mVisuAlgo[0m[38;5;12m (https://visualgo.net) - English, Korean, Chinese, Japanese.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgomation[0m[38;5;12m (http://www.algomation.com)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithms Visualization[0m[38;5;12m (http://bost.ocks.org/mike/algorithms/)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mData Structure Visualizations[0m[38;5;12m (https://www.cs.usfca.edu/~galles/visualization/Algorithms.html)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSorting Algorithms Animations[0m[38;5;12m (https://www.toptal.com/developers/sorting-algorithms)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSORTING[0m[38;5;12m (http://sorting.at)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mString Matching Visualization[0m[38;5;12m (http://whocouldthat.be/visualizing-string-matching)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mPath Finding[0m[38;5;12m (https://qiao.github.io/PathFinding.js/visual/)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithm Wiki by Will Thimbleby[0m[38;5;12m (http://will.thimbleby.net/algorithms)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTensorFlow Playground[0m[38;5;12m (http://playground.tensorflow.org)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTangle[0m[38;5;12m (https://github.com/enjalot/algovis) - JavaScript Programming Language.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mVamonos[0m[38;5;12m (http://rosulek.github.io/vamonos) - JavaScript Programming Language.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mThe Sound of Sorting[0m[38;5;12m (http://panthema.net/2013/sound-of-sorting) - C ++ Programming Language.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mGeneaQuilts[0m[38;5;12m (http://www.aviz.fr/geneaquilts) - Java Programming Language.[39m
|
||||
|
||||
[38;2;255;187;0m[4mInterviews[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mInterview Cake[0m[38;5;12m (https://www.interviewcake.com)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTop 10 Algorithms for Coding Interview[0m[38;5;12m (https://www.programcreek.com/2012/11/top-10-algorithms-for-coding-interview)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mSoftware Engineering technical interviews[0m[38;5;12m (https://github.com/kdn251/interviews)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTech Interview Handbook[0m[38;5;12m (https://github.com/yangshun/tech-interview-handbook)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mInteractive Python coding interview challenges[0m[38;5;12m (https://github.com/donnemartin/interactive-coding-challenges)[39m
|
||||
|
||||
[38;2;255;187;0m[4mVideos[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mHow algorithms shape our world[0m[38;5;12m (https://www.ted.com/talks/kevin_slavin_how_algorithms_shape_our_world) - Kevin Slavin.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithms[0m[38;5;12m (https://www.youtube.com/playlist?list=PL01A89F4E9E5F3ADE) - Oresoft LWC.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mComputer Sc - Programming and Data Structure[0m[38;5;12m (https://www.youtube.com/playlist?list=PLD9781AC5EBC9FA16) - Nptelhrd.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mDesign and Analysis of Algorithms, 2015[0m[38;5;12m (https://www.youtube.com/playlist?list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mIntroduction to Algorithms, 2011[0m[38;5;12m (https://www.youtube.com/playlist?list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mMerge Sort vs Quick Sort[0m[38;5;12m (https://youtu.be/es2T6KY45cA)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1m15 Sorting Algorithms in 6 Minutes[0m[38;5;12m (https://youtu.be/kPRA0W1kECg)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgoRythmics[0m[38;5;12m (https://www.youtube.com/user/AlgoRythmics/videos) - Sapientia University.[39m
|
||||
|
||||
[38;2;255;187;0m[4mBooks[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mElementary Algorithms[0m[38;5;12m (https://github.com/liuxinyu95/AlgoXY)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mData Structures and Algorithms[0m[38;5;12m (https://people.mpi-inf.mpg.de/~mehlhorn/Toolbox.html)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mKorea Olympiad in Informatics[0m[38;5;12m (http://www.digitalculture.or.kr/koi/StudyBook.do)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mThinking critically about and researching algorithms[0m[38;5;12m (http://futuredata.stanford.edu/classes/cs345s/handouts/kitchin.pdf)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCRACKING the CODING INTERVIEW[0m[38;5;12m (http://www.crackingthecodinginterview.com) - [39m[38;5;14m[1mGitHub[0m[38;5;12m (https://github.com/careercup/CtCI-6th-Edition), [39m[38;5;14m[1mQuora[0m[38;5;12m (https://www.quora.com/profile/Gayle-Laakmann-McDowell).[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithm Design[0m[38;5;12m (https://www.pearsonhighered.com/program/Kleinberg-Algorithm-Design/PGM319216.html)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithms[0m[38;5;12m (http://algs4.cs.princeton.edu/home/)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mIntroduction to Algorithms[0m[38;5;12m (http://mitpress.mit.edu/books/introduction-algorithms)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mGrokking Algorithms[0m[38;5;12m (http://www.manning.com/bhargava)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAlgorithmic Problem Solving Strategies[0m[38;5;12m (http://book.algospot.com) - Korean.[39m
|
||||
|
||||
[38;2;255;187;0m[4mArticles[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mstoimen's web log[0m[38;5;12m (http://www.stoimen.com/category/algorithms)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mWhat are the best and efficient ways to learn algorithms for beginners?[0m[38;5;12m (https://www.quora.com/What-are-the-best-and-efficient-ways-to-learn-algorithms-for-beginners)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mWhat are the best books on algorithms and data structures?[0m[38;5;12m (https://www.quora.com/What-are-the-best-books-on-algorithms-and-data-structures)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mStudy data for algorithm[0m[38;5;12m (http://d2.naver.com/news/4850628) - Korean.[39m
|
||||
|
||||
[38;2;255;187;0m[4mCompetitions[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mGoogle Code Jam[0m[38;5;12m (https://codingcompetitions.withgoogle.com/codejam) - 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.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mGoogle Kick Start[0m[38;5;12m (https://codingcompetitions.withgoogle.com/kickstart) - University students looking to develop their coding skills and potentially pursue a Google career.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mGoogle Hash Code[0m[38;5;12m (https://codingcompetitions.withgoogle.com/hashcode) - Students in Africa, Europe, and the Middle East looking to work as a team on real Google problems.[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mGoogle[0m[38;5;14m[1m [0m[38;5;14m[1mSummer[0m[38;5;14m[1m [0m[38;5;14m[1mof[0m[38;5;14m[1m [0m[38;5;14m[1mCode[0m[38;5;12m [39m[38;5;12m(https://summerofcode.withgoogle.com)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mA[39m[38;5;12m [39m[38;5;12mglobal[39m[38;5;12m [39m[38;5;12mprogram[39m[38;5;12m [39m[38;5;12mfocused[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12mintroducing[39m[38;5;12m [39m[38;5;12mstudents[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mopen[39m[38;5;12m [39m[38;5;12msource[39m[38;5;12m [39m[38;5;12msoftware[39m[38;5;12m [39m[38;5;12mdevelopment.[39m[38;5;12m [39m[38;5;12mStudents[39m[38;5;12m [39m[38;5;12mwork[39m[38;5;12m [39m[38;5;12mon[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12m3[39m[38;5;12m [39m[38;5;12mmonth[39m[38;5;12m [39m[38;5;12mprogramming[39m[38;5;12m [39m[38;5;12mproject[39m[38;5;12m [39m[38;5;12mwith[39m[38;5;12m [39m[38;5;12man[39m[38;5;12m [39m[38;5;12mopen[39m[38;5;12m [39m[38;5;12msource[39m[38;5;12m [39m[38;5;12morganization[39m[38;5;12m [39m[38;5;12mduring[39m[38;5;12m [39m[38;5;12mtheir[39m[38;5;12m [39m
|
||||
[38;5;12mbreak[39m[38;5;12m [39m[38;5;12mfrom[39m[38;5;12m [39m[38;5;12muniversity.[39m
|
||||
|
||||
[38;2;255;187;0m[4mMiscellaneous[0m
|
||||
[38;5;12m- [39m[38;5;14m[1mCompetitive Programming[0m[38;5;12m (https://github.com/lnishan/awesome-competitive-programming#readme)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mMIT OpenCourseWare[0m[38;5;12m (https://www.youtube.com/user/MIT/playlists)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mOEDb(Open Education Databases): Algorithm[0m[38;5;12m (http://oedb.org/open/search-results/?search-term=algorithm)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAwesome Data Science[0m[38;5;12m (https://github.com/bulutyazilim/awesome-datascience)[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mAwesome Machine Learning[0m[38;5;12m (https://github.com/josephmisiti/awesome-machine-learning)[39m
|
||||
[38;5;12m-[39m[38;5;12m [39m[38;5;14m[1mRosetta[0m[38;5;14m[1m [0m[38;5;14m[1mCode[0m[38;5;12m [39m[38;5;12m(http://rosettacode.org/wiki/Rosetta_Code)[39m[38;5;12m [39m[38;5;12m-[39m[38;5;12m [39m[38;5;12mThe[39m[38;5;12m [39m[38;5;12midea[39m[38;5;12m [39m[38;5;12mis[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mpresent[39m[38;5;12m [39m[38;5;12msolutions[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mthe[39m[38;5;12m [39m[38;5;12msame[39m[38;5;12m [39m[38;5;12mtask[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mas[39m[38;5;12m [39m[38;5;12mmany[39m[38;5;12m [39m[38;5;12mdifferent[39m[38;5;12m [39m[38;5;12mlanguages[39m[38;5;12m [39m[38;5;12mas[39m[38;5;12m [39m[38;5;12mpossible,[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12mdemonstrate[39m[38;5;12m [39m[38;5;12mhow[39m[38;5;12m [39m[38;5;12mlanguages[39m[38;5;12m [39m[38;5;12mare[39m[38;5;12m [39m[38;5;12msimilar[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mdifferent,[39m[38;5;12m [39m[38;5;12mand[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12maid[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mperson[39m[38;5;12m [39m[38;5;12mwith[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mgrounding[39m
|
||||
[38;5;12min[39m[38;5;12m [39m[38;5;12mone[39m[38;5;12m [39m[38;5;12mapproach[39m[38;5;12m [39m[38;5;12mto[39m[38;5;12m [39m[38;5;12ma[39m[38;5;12m [39m[38;5;12mproblem[39m[38;5;12m [39m[38;5;12min[39m[38;5;12m [39m[38;5;12mlearning[39m[38;5;12m [39m[38;5;12manother.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCode.org[0m[38;5;12m (https://code.org) - Anybody can learn.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mCheckiO[0m[38;5;12m (https://checkio.org) - Online game for Python and JavaScript coders.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mHUST Online Judge System[0m[38;5;12m (https://github.com/freefcw/hustoj-neo) - Online Judge is a web application.[39m
|
||||
[38;5;12m- [39m[38;5;14m[1mTech stack for Baekjoon online judge[0m[38;5;12m (https://goo.gl/qwgBAp) - Korean / How to choose a technology stack for judge?[39m
|
||||
|
||||
[38;2;255;187;0m[4mLicense[0m
|
||||
[38;5;14m[1m![0m[38;5;12mCC0[39m[38;5;14m[1m (https://mirrors.creativecommons.org/presskit/buttons/88x31/svg/cc-zero.svg)[0m[38;5;12m (https://creativecommons.org/publicdomain/zero/1.0/)[39m
|
||||
|
||||
[38;5;12mTo the extent possible under law, [39m[38;5;14m[1mgaerae[0m[38;5;12m (https://github.com/gaerae) has waived all copyright and related or neighboring rights to this work.[39m
|
||||
|
||||
[38;5;12malgorithmseducation Github: https://github.com/gaerae/awesome-algorithms-education[39m
|
||||
Reference in New Issue
Block a user