Mode: On-Campus OA Date: 2026-11-02

You are given a directed weighted graph with N nodes and M edges. Each edge connects

…

Access the full question

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

Ending preview

…

Therefore, the answer is 1.

solution.cpp

Loading code editor...

Run code to see test results

00:00 / 69:42

Graph – Count Paths with Even Weight Sum 3rd-section-question2 HiLabs - IIT, Kharagpur

MediumMed•105 views•FTE

Mode: On-Campus OA Date: 2026-11-02

You are given a directed weighted graph with N nodes and M edges. Each edge connects

…

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

Ending preview

…

Therefore, the answer is 1.

MediumMed•105 viewsOn-CampusFTE

Asked at