Skip to main content
All Questions

In a complete directed graph with positive edge weights, find a path that visits no node twice and maximises the product of its edge weights.

Unlock detailed company stats for this questionUpgrade
A complete directed graph on n nodes has a positive weight on every edge. Write code to find a path that visits no node twice and whose edge weights have the largest possible product.

Community answers

No answers contributed by the community yet.

Related questions

In a random graph on n nodes where each edge exists independently with probability p, find the expected distance between two nodes, both mathematically and with code.

Related courses

Course

SQL Interview Prep Course

Prepare for SQL interviews with lessons on joins, aggregations, and window functions, then practice real SQL interview questions in an interactive editor with expert solutions.

Course

Data Science Interview Prep

Land your dream data science role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Learn from mock interviews, frameworks, and advice from senior candidates. Practice statistics, experimentation, coding, SQL, machine learning, behavioral interviews, and more.