dijkstra
Programming Interview
Questions
dijkstra
Suppose you are modeling the relationships between stocks in a market, where each stock is a node and there is an edge between two nodes if the correlation between them exceeds a certain threshold.
Create a function dijkstra(graph, start, end) that find the "shortest" path between two stocks (nodes) in terms of the least correlation.
Return the value of the shortest path between start and end, by traversing through graph.
Example 1:
- graph: { 'A': {'B': 0.2}, 'B': {'A': 0.2, 'C': 0.3}, 'C': {'A': 0.5, 'B': 0.3} }
- start: 'A'
- End: 'B'
Output: 0.5 (because A -> B -> C costs 0.2 + 0.3 = 0.5).
If there is no path between the start and the end within the graph, return 'invalid'.
Tests - Login / Sign up to submit your code!
Efficiency
Test Case 1
Test Case 2
Test Case 3
Test Case 4
Test Case 5
Test Case 6
Test Case 7
Test Case 8
Test Case 9
Test Case 10
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results