3 ms·

I'm pretty sure that "algorithmic challenge" is NP-complete.

• trurl 15y ago
  Hah, quite the optimist. In most commonly used languages deciding the equivalence of two code fragments is undecidable.