Given an unsigned integer x, convert it to binary with n bits, reverse the order of the bits, and convert it back to an integer.
5094 Solvers
Sum all integers from 1 to 2^n
5584 Solvers
Remove white space from the string
139 Solvers
117 Solvers
149 Solvers
Solution 207786
From now on, anytime I can chain together a composition of functions, I will never exceed a Cody score of 12! Thank you!
I also would encourage people not to submit this sort of dynamic expression regexp trick solutions indiscriminately. Having said that, and just for reference, you can push this down to a Cody score of 10... (hint1: use varargin; hint2: use 'command syntax' instead of 'function syntax').
To keep Cody from degenerating into a bunch of unreadable party tricks, we've blocked usage of eval, evalc, and a few others. But regexp is too important for us to block, so this trick will remain available into the foreseeable future. Which means, to back up Alfonso's comment, please don't abuse it. It's funny once, and then it just gets annoying.