News for hackers. Stuff that matters.
Re:How to Crack the Toughest Coding Interviews by Someone on Saturday October 27, 2012 @05:17AM (#4705798)
I wasn't assuming, I was following what the OP wrote: "by going only up or right one point with each move (that is, each move is either (0,1) or (1,0)))" for 3D.

Counting self-avoiding walks is hard in 2D, too (http://oeis.org/A007764)

There are no comments on this comment yet.