← OYO questions

Count ways to travel cyclic path in N steps on triangular pyramid

Filed under OYO

A triangular pyramid (tetrahedron) has 4 vertices. Starting at a specific vertex, calculate the number of ways to return to that same vertex in exactly N steps. Each step must be to an adjacent…

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 OYO questions

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