Virtusa Hackthon test pattern - R1


DM for slots booking

@Mrtrueliving_ix @Mrtrueliving_ix

TCS codevita codes are available

Secret key

Interview

String

DM @Mrtrueliving_ix ✓

TCS codevita ✓

from collections import defaultdict, deque

def min_energy(n, t_input, s, d):
g = defaultdict(list)
t_map = {}
t_id = 0

for line in t_input:
if line == "break":
t_id += 1
continue

spots = list(map(int, line.split()))
p = spots[0]

for c in spots[1:]:
g[p].append(c)
t_map[c] = t_id

e_cost = {}
q = deque([(s, 0)])
e_cost[s] = 0

while q:
cur, cur_e = q.popleft()

if cur == d:
return cur_e

for c in g[cur]:
if c not in e_cost or cur_e + 1 < e_cost[c]:
e_cost[c] = cur_e + 1
q.append((c, cur_e + 1))

for neighbor in g:
if neighbor != cur and neighbor in e_cost:
e_next = cur_e + 1
if neighbor not in e_cost or e_next < e_cost[neighbor]:
e_cost[neighbor] = e_next
q.append((neighbor, e_next))

return float('inf')

n = int(input())
t_input = []
for _ in range(n):
t_input.append(input().strip())
s, d = map(int, input().split())

result = min_energy(n, t_input, s, d)
print(result)



Hybrid banana ✓ // codevita ✓

Virtusa Hackthon // Java // QA

ALL CODES ARE AVAILABLE

DM @Mrtrueliving_ix @Mrtrueliving_ix

5 days challenge ✓

@Mrtrueliving_ix

Virtusa 2 pm all codes available

@Mrtrueliving_ix ✓