def main(edges): res= [] v = [-1] * len(edges) for | INFOSYS&WIPRO&COGNIZANT&ACCENTURE &TCS& ALL OFF CAMPUS exam answers group

def main(edges):
res= []
v = [-1] * len(edges)
for i in range(0, len(edges)):
New = []
K= i
while cell > -1 and v[K] == -1:
v[K] = i
New.append(K)
K = edges[K]
if K > -1 and v[K] == i:
_idx = New.index(K)
New = New[_idx:]
if len(New) > len(res):
res = New
return res,len(res)

size =int(input())
edges =list(map(int,input().split())) [ : size]
print(main(edges))

Python3
Maximum weight node!