bhavya_19's blog

GS intern OA question anyone help
By bhavya_19, history, 10 months ago, In English

there is undirected graph with n nodes and m edges you can start from any node and you have to end a path at node 1 and condition is that you cannot visit the same edge twice what is the maximum length of path you can have? constraints are n<=100 and m<=2*n-2

  • Vote: I like it
  • -19
  • Vote: I do not like it

»
10 months ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

something like making a line graph, and dfs from every potential node(all edges from 1) getting max would work ?

upd: nvm it would tle I guess

→ Reply
»
10 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Dominater069 any thought on this problem?

→ Reply
»
10 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

[user:Radewoosh][user:rainboy][user:Dominator069][user:ksun48] please help

→ Reply