Available question text
Given n nodes initially connected by the directed path 0→1→...→n-1, process incremental additions of forward edges (u→v with u<v) and after each addition report the shortest path length from 0 to n-1. The core challenge is maintaining/updating the shortest-path distance in this DAG under up to 500 edge insertions efficiently.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3243. Shortest Distance After Road Addition Queries I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source