← Morgan Stanley questions

Shortest Path and Reverse Linked List in Pairs

Filed under Morgan Stanley

Implement Dijkstra's algorithm to find the shortest path in a graph, and write a function to reverse a linked list in pairs.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Morgan Stanley questions

Collected from public candidate posts and coding forums. Updated Nov 2026.