Count magic edges in a tree
Filed under Sprinklr
The question
Given a tree with node values from 1 to 3, find the count of magic edges where removing an edge results in two components whose product of node values are not divisible by 6.
No write-up yet. Related questions below have one.
Related Sprinklr questions
Collected from public candidate posts and coding forums. Updated Nov 2026.