Home Problem Set Companies Projects Contribute Requests

Loading Question...

Minimum Path Length Visiting Required Nodes Pace Stock Broking - IIT, Delhi Online Assessment | Codinzhub

CodinzHub

Home Problem Set Companies Projects Contribute Requests

Minimum Path Length Visiting Required Nodes Pace Stock Broking - IIT, Delhi

Mode: On-Campus Exam Pattern: 4 coding, 90mins OA Date: 2026-10-08

Minimum Path Length Visiting Required Nodes

You

…

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

…

1 <= mustVisit[i] <= n All elements in mustVisit are unique.

solution.cpp

Loading code editor...

Run code to see test results

00:00 / 69:42

Minimum Path Length Visiting Required Nodes Pace Stock Broking - IIT, Delhi

MediumMed•110 views•FTE

Mode: On-Campus Exam Pattern: 4 coding, 90mins OA Date: 2026-10-08

Minimum Path Length Visiting Required Nodes

You

…

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

…

1 <= mustVisit[i] <= n All elements in mustVisit are unique.

MediumMed•110 viewsOn-CampusFTE

Asked at

Pace Stock Broking

Minimum Path Length Visiting Required Nodes Pace Stock Broking - IIT, Delhi

Minimum Path Length Visiting Required Nodes

Access the full question

Minimum Path Length Visiting Required Nodes Pace Stock Broking - IIT, Delhi

Minimum Path Length Visiting Required Nodes

Access the full question

Published by Codinzhub

More from Pace Stock Broking

Number of Ways to Form Target String Pace Stock Broking - IIT, Delhi

Count Exactly Overlapping Components Pace Stock Broking - IIT, Delhi

Nearest City Sharing Coordinate Pace Stock Broking - IIT, Delhi