โ† ServiceNow questions

Shortest path between 2 points in 2-D space in O(log N) time

Filed under ServiceNow

Find the shortest path or distance between two points in a 2-D space with O(log N) time complexity.

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

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