Create a gist now

Instantly share code, notes, and snippets.

@fearphage /answers.js Secret
Created Aug 17, 2010

What would you like to do?
01. i=f.length;while((n=f[--i]).length);n()
02. a.filter(function(i){return i})
03. x=Math.max,n=Math.min,x(a,n(b,c))==b||n(a,x(b,c))==b
04. x===!!x
05. a=[b,b=a][0]
06. n===(n|0)
07. Math.max.apply(x,x)
08. a.indexOf(b)<0&&a.push(b)
09. Array(n+1).join(x)
10. a.push.apply(a,b)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment