Home Problem Set Companies Projects Contribute Requests

Loading Question...

Shortest Path with Conditional Edge Weights - UIDAI Interview Question | Codinzhub

CodinzHub

Home Problem Set Companies Projects Contribute Requests

Shortest Path with Conditional Edge Weights

Given an undirected graph where all edges initially have weight 1, you need to find the shortest

…

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.

Ending preview

…

If a node is unreachable, return -1 for that node.

solution.cpp

Run code to see test results

00:00 / 69:42

Shortest Path with Conditional Edge Weights

MediumMed•433 views

Given an undirected graph where all edges initially have weight 1, you need to find the shortest

…

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.

Ending preview

…

If a node is unreachable, return -1 for that node.

MediumMed•433 views

Asked at

UIDAI

Author: Amit Dayal

Software Engineer

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

Reviewed by Senior Engineers

GitHub

Up Next

Eternal Online Assessment - IIT Bombay

Eternal • Pending

Swapped Neighbour Scans Inmobi Online Assessment - IIT Kanpur 24th September

Inmobi • Pending

Peak Profit Window Inmobi Online Assessment - IIT Kanpur 24th September

Inmobi • Pending

Cold Start Inmobi Online Assessment - IIT Kanpur 24th September

Inmobi • Pending

Bank Transactions Squarepoint Capital - IIT Kanpur 26th September

Squarepoint Capital • Pending

Last updated Sep 2026