search

Mozilla-Campus-Club-Cummins / CompetitiveProgramming-HacktoberFest23

1 stars 25 forks source link

Possible Path #59

Open Chaitralikore opened 8 months ago

Chaitralikore commented 8 months ago

Given an undirected graph with n vertices and connections between them. Your task is to find whether you can come to same vertex X if you start from X by traversing all the vertices atleast once and use all the paths exactly once.

Example 1:

Input: paths = {{0,1,1,1,1},{1,0,-1,1,-1}, {1,-1,0,1,-1},{1,1,1,0,1},{1,-1,-1,1,0}} Output: 1 Exaplanation: One can visit the vertices in the following way: 1->3->4->5->1->4->2->1 Here all the vertices has been visited and all paths are used exactly once.

sejalphatangare commented 8 months ago

Hi assign me this issue. Sejal Phatangare UCE2021457

ManasiGDeshmukh commented 8 months ago

@sejalphatangare Happy Coding!!