Home Problem Set Companies Projects Live Scene Contribute

Loading Question...

Count Route Cycles - De Shaw Interview Question | Codinzhub

Home Problem Set Companies Projects Live Scene Contribute

Count Route Cycles

Given a tree with colored nodes, determine the number of distinct perfect route cycles that can be formed by adding an edge between two nodes of different colors.

Example 1:

Input:[6,[1,2,2,1,5],[2,3,4,5,6],[0,1,1,1,0,0]]

Output:3

Constraints:

1 ≤ tree_nodes ≤ 10^5
1 ≤ m < 10^5
0 ≤ colors[i] < 1

solution.cpp

Run code to see test results

00:00 / 69:42

Count Route Cycles

HardMed•1,103 views

Given a tree with colored nodes, determine the number of distinct perfect route cycles that can be formed by adding an edge between two nodes of different colors.

Example 1:

Input:[6,[1,2,2,1,5],[2,3,4,5,6],[0,1,1,1,0,0]]

Output:3

Constraints:

1 ≤ tree_nodes ≤ 10^5
1 ≤ m < 10^5
0 ≤ colors[i] < 1

HardMed•1,103 views

Time Complexity

Space Complexity

Asked at

De Shaw

Author: Amit Dayal

Software Engineer

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

Reviewed by Senior Engineers

GitHub LinkedIn

Up Next

Qualcomm Online Assessment NIT Bhopal

Qualcomm • Pending

Flag Suspicious API Requests - Salesforce Online Assessment TIET

Salesforce • Pending

Salesforce Cloud Storage - Salesforce Online Assessment TIET

Salesforce • Pending

Salesforce Opportunity Code - Salesforce Online Assessment TIET

Salesforce • Pending

Maximum Throughput After Scaling - Atlassian Intern Online Assessment IIT BHU

Atlassian • Pending

Last updated Aug 2026