โ† OYO questions

Unique Path Finding on Triangle Vertices

Filed under OYO

Given a triangle with 3 vertices, find the number of ways to return to the starting vertex after exactly n steps. Each step must be to an adjacent vertex.

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.