How should I practice Maximum Time Required to Transfer Data?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Rippling online assessment problems in FastPrep.

Is Maximum Time Required to Transfer Data associated with Rippling?

FastPrep tags this as a Rippling online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · Tree

Maximum Time Required to Transfer Data

Learn this problem

● Medium

RipplingNEW GRADOA

Problem statement

A server network is represented as a tree of g_nodes servers indexed from 1 to g_nodes. It has g_nodes - 1 edges, where the ith edge connects servers g_from[i] and g_to[i]. The transfer time between any two connected servers is 1 unit.

Given the graph g, find the maximum time taken to transfer data between any two servers in the system.

Function

maximumTimeRequiredToTransferData(g_nodes: int, g_from: int[], g_to: int[]) → int

Examples

Example 1

g_nodes = 3g_from = [1, 2]g_to = [2, 3]return = 2

The longest path is from server 1 to server 3. It contains two edges, so the maximum transfer time is 2.

Example 2

g_nodes = 5g_from = [1, 1, 1, 5]g_to = [5, 3, 2, 4]return = 3

A longest path is 4 → 5 → 1 → 2 (or it may end at server 3). It contains three edges, so the maximum transfer time is 3.