Skip to main content
All Questions

Suppose you run Dijkstra's algorithm on a graph where a path's length is the bitwise XOR of its edge weights instead of their sum. Does it still find the shortest paths?

Unlock detailed company stats for this questionUpgrade

Community answers

No answers contributed by the community yet.

Related courses

Course

SQL Interview Prep Course

Prepare for SQL interviews with lessons on joins, aggregations, and window functions, then practice real SQL interview questions in an interactive editor with expert solutions.

Course

Data Science Interview Prep

Land your dream data science role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Learn from mock interviews, frameworks, and advice from senior candidates. Practice statistics, experimentation, coding, SQL, machine learning, behavioral interviews, and more.