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!

Additional Materials


  • https://github.com/lnishan/awesome-competitive-programming
  • Open problems (from Oct. 2016)

Channel Bots

  • dobodob - provides banter ~~and access to hackerrank leaderboards~~

Big O Table

Table of Big O

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.