Solution 2 for Scaler Topics Fortnightly Contest - 2

This article is part of the Scaler Topics Fortnightly Contest - 2.

Solution Approach

• Brute Force: Backtracking
• Optimised: ans = 4 * A * A-1. Notice that the problem is asking about number of hamiltonian path in a N-wheel graph.

C++ Implementation

Java Implementation

Python Implementation