Given a river of N units with stones at specific positions, start at 0 with a jump of 1. Each subsequent jump must be k-1, k, or k+1 where k is the previous jump length. Find the path that reaches the…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.