โ† OYO questions

Triangle Path Counting

Filed under OYO

Given a triangle graph with 3 vertices (A, B, C) and k steps, return the number of ways to return to the source vertex in exactly k steps.

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.