Reach a Number

Find the minimum k such that by taking moves of lengths 1..k (each either left or right) you can land at target; this reduces to finding the smallest k with S = k(k+1)/2 >= |target| and S and |target| having the same parity (so S - |target| is even).