How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a Medium difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at Akuna Capital.

What role is this question designed for?

This question is commonly asked for Data Scientist candidates at Akuna Capital during technical interviews.

Compute delivery order via BFS

Last updated: Mar 29, 2026

Quick Overview

This question evaluates proficiency in graph algorithms and shortest-path reasoning, multi-criteria ordering and tie-breaking, and analysis of time and space complexity while handling unreachable nodes.

Akuna Capital

Aug 10, 2025, 12:00 AM

Data Scientist

Technical Screen

Coding & Algorithms

A city road network is an unweighted, undirected graph G(V, E) with a depot node s and D delivery requests located at nodes r1..rD, each with an integer priority p and a unique ID. Produce the service order that sorts deliveries by increasing shortest-hop distance from s, breaking ties by higher priority first, then by smaller ID. Design an algorithm that runs in O(V+E + D log D) by performing a BFS from s to compute distances and then sorting the requests by (distance asc, priority desc, ID asc). Explain correctness, handle unreachable nodes, and provide pseudocode.

Comments (0)

Loading comments...

Browse More Questions

More Coding & Algorithms•More Akuna Capital•More Data Scientist•Akuna Capital Data Scientist•Akuna Capital Coding & Algorithms•Data Scientist Coding & Algorithms