← Wells Fargo questions

Frog river crossing path printing

Filed under Wells Fargo

Given $N$ stones, a frog can jump either 1 or 2 steps at a time. Print all possible paths (sequences of stone indices) to reach the $N$-th stone.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Wells Fargo questions

Collected from public candidate posts and coding forums. Updated Nov 2026.