Loading Question...

Shortest Path Queries in a Weighted Graph - Juspay Hiring Challenge 2026 - Juspay Hiring Challenge Interview Question | Codinzhub

You are given an undirected weighted graph with N vertices (numbered from 1 to N)

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

solution.cpp

Run code to see test results

00:00 / 69:42

Shortest Path Queries in a Weighted Graph - Juspay Hiring Challenge 2026

HardMed•527 views

You are given an undirected weighted graph with N vertices (numbered from 1 to N)

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Unlock the full statement, examples, constraints, and solution guidance.

HardMed•527 views

Asked at

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.

Reviewed by Senior Engineers

Morgan Stanley • Pending

Morgan Stanley • Pending

Accenture • Pending

Morgan Stanley • Pending

Morgan Stanley • Pending

Last updated Sep 2026