Home Problem Set Companies Projects Live Arena Contribute

ME

Loading Question...

Count Route Cycles - De Shaw Interview Question | Codinzhub

Home Problem Set Companies Projects Live Arena Contribute

ME

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.

Constraints:

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

Loading...

Run code to see test results

00:00 / 69:42

Count Route Cycles

HardMed•886 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.

Constraints:

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

HardMed•886 views

Time Complexity

Space Complexity

Asked at

AD

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

Complex Number Class - IndiaMART

IndiaMART • Pending

Minimum Merge Conflicts

Amazon • Pending

MovieDB(MERN): Actor Follow - Notification System amazon-web-development-ai-based-online-assesment

Amazon • Pending

Word Search II - Code with cisco - CwC 26

Code with cisco - CwC 26 • Pending

Optimal Seed Influencers

Code with cisco - CwC 26 • Pending

Last updated Jun 2026