Home

Welcome to ##algorithms

Our wiki is modeled after the ##C channel's topic page but with less content.

Topic

We discuss puzzles, algorithms, data structures, problem solving and related topics.

Use http://codepad.org/ to share code, Use http://mathb.in/ to share math

Don't be sorry for your bad English!

Algorithms around the web

• e-maxxx in english
• wcipeg wiki

Additional Materials

• Books for algorithms: CLRS, DSV, Erickson's Algorithms
• Courses: MIT's Introduction to Algorithms, MIT's Design & Analysis of Algorithms
• Competitive Programming Books: CP3, Laaksonen's Handbook,
• Online Judge Sites: Hacker Rank, CodeChef, Kattis, Hacker Earth, AtCoder, Topcoder, Codeforces
• ICPC style Judge sites: Kattis, SPOJ, UVA, USACO
• Wikis: algo.is competitive programming wiki, list of algorithms on Wikipedia
• Books for interviews: How would you move mount fuji?, Cracking the coding interview, Cracking the coding Interview problems on HackerRank

Advanced Materials

• Courses: MIT's Advanced Algorithms, MIT's Advanced Data Structures, Harvard CS50, Stanford CS161
• Books: Looking for a Challenge,
• MIT Challenge to learn CS curricula in 1 year

Less Rigorous Books (Good for engineers)

• Analysis of Algorithms
• Skiena

Links

• https://github.com/lnishan/awesome-competitive-programming
• How to be a programmer by Robert Read
• Open problems (from Oct. 2016)
• Cherim's list of unsolveable Erdos problems

Channel Bots

• dobodob - provides banter and access to hackerrank leaderboards

Big O Table

This table is from CP3 and gives an idea of what complexity is necessary for different input sizes to achieve All Correct (AC) without hitting Time Length Exceeded (TLE). Reading the first line: if max N=11, an algorithm of factorial complexity or N^6 (or better) is acceptable.