← Oracle questions

Dijkstra's Algorithm

Filed under Oracle · Also reported at Dell, Entrata, Infybeam, Samsung, TCS

Given a weighted directed graph with n vertices labeled from 0 to n - 1 and non-negative edge weights, compute the shortest distance from a given source vertex to all other vertices. Return -1 for…

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 Oracle questions

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