1 coding question. To solve within 3 hours. Related to graph. Question required BFS traversel within the graph. Use adjacency matrix form of graph. There were 50 test cases. One needs to pass all the test cases to qualify for the round. Go through the question properly, otherwise one may miss some corner cases resulting in partial passing of test cases.