← Traveloka questions

Path existence between nodes based on GCD threshold

Filed under Traveloka

The question

Given N nodes where any two nodes are connected if the GCD of their values exceeds a threshold T, answer Q queries determining if a path exists between two given nodes.

No write-up yet. Related questions below have one.

Related Traveloka questions

Collected from public candidate posts and coding forums. Updated Nov 2026.