JS:

function connectingTowns(n, routes) { // Write your code here if(n<2) return 1; return routes[0]*connectingTowns(n-1,routes.slice(1,n-1)) % 1234567 }

Eassy Java : int no_roads=1; for(int i=0;i

Eassy Java : int no_roads=1; for(int i=0;i

C# solution:

    public static int connectingTowns(int n, List<int> routes)
    {
        int productOfRoads=1;
        for(int i=0; i<n-1;i++){           
            productOfRoads *= routes[i];         
            productOfRoads %= 1234567;
        }
        return productOfRoads;
    }

int connectingTowns(int n, vector routes) { int total_routes{1}; for(size_t i = 0 ; i < n-1 ; i++){ total_routes*=routes.at(i) % 1234567; } return total_routes ;

} whats wrong with my code ??