BIT-GO (Screening Round)

Platform: Coderbyte

Question:1 (Graph)

• find the shortest path between two node
• Input ["number of vertex", "first-node", .... "last_node", "node1-node2", "node2-node3"], example: ["4", "A", "B", "C", "D", "A-B", "B-C", "C-D"]
• You need to find shortest distance between first-node & last-node

Question:2 (Graph)

• find the shortest path between two node in a weighted graph
• Input ["number of vertex", "first-node", .... "last_node", "node1|node2|weight", "node2|node3|weight"] example: ["5", "A", "B", "C", "D", "E", "A|B|1", "B|C|2", "C|D|3", "D|E|4"]
• You need to find shortest distance between first-node & last-node

Solved Question 1 with 100% Success rate. Solved almots 97% for 2nd question.
Recuirter said, they didn't get any response from Coderbyte side.