Shared Interest
Shared Interest is a Wolverine_trading coding interview problem. Given a graph of friends (nodes 1..friends_nodes) with weighted edges representing interests, determine which friend pairs share the maximum number of interests. From those pairs, return the largest product of their node labels. A concise interview question focused on graph-based relationships.
Example
Unlock to view complete problem details
and practice with sample input/output
Was this article helpful?
View Test Cases & Run Code requires membership
Input Variables
Execution Result:
