Maximum Path Quality of a Graph: coding question

Available question text

Find the maximum sum of unique node values collectible by any walk that starts and ends at node 0 within a given time budget on a weighted undirected graph — you may revisit nodes but each node's value is counted at most once. The core challenge is exploring time-constrained walks (maxTime ≤ 100 and node degree ≤ 4) to maximize unique-node coverage under travel-cost limits.

Continue with questions that share topics or the same question type.

Maximum Candies You Can Get from Boxes
Coding · Array · Breadth-First Search · Graph Theory
Alien Dictionary
Coding · Array · Breadth-First Search · Depth-First Search
Beautiful Arrangement
Coding · Array · Backtracking · Bit Manipulation
Design Excel Sum Formula
Coding · Array · Design · Graph Theory

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Amazon
Leetcode 2065. Maximum Path Quality of a Graph
Reported Nov 10, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

Nutanix
Maximum Path Quality of a Graph
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source
Nutanix
Maximum Path Quality of a Graph
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source

Available question text

Maximum Path Quality of a Graph

Available question text

Related questions

Maximum Path Quality of a Graph

Available question text

Related questions