New
The Learning module is now live
See what's new
×
Question Bank
Learning
NEW
Pricing
Blog
Forum
HOT
JobRadar
Description
Solution
Discussion
Submissions
Ask AI
Question Bank
Robinhood
Coding Question
AI Insights
Quick Summary
Find the simple path with the maximum product of edge multipliers from a start node to an end node in a directed graph.
Each node can be visited at most once along the chosen path.
Return -1 if no valid path exists between the specified nodes.
What This Tests
Graph representation and traversal techniques
Backtracking and recursive state management
Handling non-additive path metrics (products instead of sums)
Constraint-based pathfinding with cycle avoidance
Common Patterns
Graph Traversal
DFS/BFS
Backtracking
Collapse
Hint 1
Hint 2
What Interviewers May Ask Next
Accepted
2.8k
/5.6k
Acceptance Rate
49.0%
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Qwen
Qwen3.7-Flash
0/2000
Auto
Debug
Run
Submit
Test Cases
Input
n =
edges =
start =
end =
Output
Expected
