There were two rounds. 1st round was DSA round and a leetcode hard graph question was asked and it should be running code and second round was LLD round the expectation were really high of the interviewer they need pro based modular scalar code in just 45 mins
Interview questions [1]
Question 1
Find the shortest between given and starting node such that all node can pe prime number and you can jump only bye two numbers which are prime and differ by 1 digit.