Two Sigma logoTwo Sigma
Coding·60 minMembers

Maximum Product Path in a Complete Directed Graph

Members only

Given a complete directed graph with positive edge weights, find the no-repeated-node path that maximizes the product of edge weights. The candidate recognized the exponential nature and considered lo...

RS
DS
graph
bitmask
dp
math
hard
Frequency
Single report
Last asked
2025-10-09
Stage
onsite-coding

Log in to continue reading the full content

Comments

Sign in to join the discussion
Loading...