Welcome to ##algorithms
Our wiki is modeled after the ##C channel's topic page but with less content.
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!
- 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
Don't read (just yet)
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.