#2065Medium~35 min

Maximum Path Quality of a Graph

Time O(\ · Space V\ · Official statement on LeetCode

Solutions

// Time:  O(|V| + |E| + 4^(maxTime/min(times))) = O(|V| + |E| + 4^10)
// Space: O(|V| + |E|)

class Solution {
public:
    int maximalPathQuality(vector<int>& values, vector<vector<int>>& edges, int maxTime) {
        vector<vector<pair<int, int>>> adj(size(values));
        for (const auto& edge : edges) {
            adj[edge[0]].emplace_back(edge[1], edge[2]);
            adj[edge[1]].emplace_back(edge[0], edge[2]);
        }
        return iter_dfs(values, adj, maxTime);
    }

private:
    int iter_dfs(const vector<int>& values,
                 const vector<vector<pair<int, int>>>& adj,
                 int maxTime) {

        vector<int> lookup(size(values));
        vector<unordered_set<int>> lookup2(size(values));
        int result = 0;
        vector<tuple<int, int, int, int, int>> stk = {{1, 0, -1, maxTime, 0}};
        while (!empty(stk)) {
            auto [step, u, v, time, total] = stk.back(); stk.pop_back();
            if (step == 1) {
                if (++lookup[u] == 1) {
                    total += values[u];
                }
                if (!u) {
                    result = max(result, total);
                }
                stk.emplace_back(4, u, -1, -1, -1);
                for (const auto& [v, t] : adj[u]) {
                    if (lookup2[u].count(v) || time < t) {  // same directed edge won't be visited twice
                        continue;
                    }
                    stk.emplace_back(3, u, v, -1, -1);
                    stk.emplace_back(1, v, -1, time - t, total);
                    stk.emplace_back(2, u, v, -1, -1);
                }
            } else if (step == 2) {
                lookup2[u].emplace(v);
            } else if (step == 3) {
                lookup2[u].erase(v);
            } else if (step == 4) {
                --lookup[u];
            }
        }
        return result;
    }
};


// Time:  O(|V| + |E| + 4^(maxTime/min(times))) = O(|V| + |E| + 4^10)
// Space: O(|V| + |E|)
class Solution2 {
public:
    int maximalPathQuality(vector<int>& values, vector<vector<int>>& edges, int maxTime) {
        vector<vector<pair<int, int>>> adj(size(values));
        for (const auto& edge : edges) {
            adj[edge[0]].emplace_back(edge[1], edge[2]);
            adj[edge[1]].emplace_back(edge[0], edge[2]);
        }
        vector<int> lookup(size(values));
        vector<unordered_set<int>> lookup2(size(values));
        int result = 0;
        dfs(values, adj, 0, maxTime, 0, &lookup, &lookup2, &result);
        return result;
    }

private:
    void dfs(const vector<int>& values,
             const vector<vector<pair<int, int>>>& adj,
             int u, int time, int total,
             vector<int> *lookup,
             vector<unordered_set<int>> *lookup2,
             int *result) {

        if (++(*lookup)[u] == 1) {
            total += values[u];
        }
        if (!u) {
            *result = max(*result, total);
        }
        for (const auto& [v, t] : adj[u]) {
            if ((*lookup2)[u].count(v) || time < t) {  // same directed edge won't be visited twice
                continue;
            }
            (*lookup2)[u].emplace(v);
            dfs(values, adj, v, time - t, total, lookup, lookup2, result);
            (*lookup2)[u].erase(v);
        }
        --(*lookup)[u];
    }
};

// Time:  O(|V| + |E| + 4^(maxTime/min(times))) = O(|V| + |E| + 4^10)
// Space: O(|V| + |E|)
class Solution3 {
public:
    int maximalPathQuality(vector<int>& values, vector<vector<int>>& edges, int maxTime) {
        vector<vector<pair<int, int>>> adj(size(values));
        for (const auto& edge : edges) {
            adj[edge[0]].emplace_back(edge[1], edge[2]);
            adj[edge[1]].emplace_back(edge[0], edge[2]);
        }
        vector<int> lookup(size(values));
        vector<unordered_set<int>> lookup2(size(values));
        return dfs(values, adj, 0, maxTime, 0, &lookup, &lookup2);
    }

private:
    int dfs(const vector<int>& values,
            const vector<vector<pair<int, int>>>& adj,
            int u, int time, int total,
            vector<int> *lookup,
            vector<unordered_set<int>> *lookup2) {

        if (++(*lookup)[u] == 1) {
            total += values[u];
        }
        int result = !u ? total : 0;
        for (const auto& [v, t] : adj[u]) {
            if ((*lookup2)[u].count(v) || time < t) {  // same directed edge won't be visited twice
                continue;
            }
            (*lookup2)[u].emplace(v);
            result = max(result, dfs(values, adj, v, time - t, total, lookup, lookup2));
            (*lookup2)[u].erase(v);
        }
        --(*lookup)[u];
        return result;
    }
};

Beginner Explanation

What is Maximum Path Quality of a Graph?

Maximum Path Quality of a Graph (LeetCode #2065) is a Medium problem that primarily trains depth first search.

How to think about it

Restate the goal in your own words before coding.
Work a tiny example by hand so the invariant becomes obvious.
Identify the pattern — this problem aligns with dfs backtracking.
Only then translate the idea into code.

Why this problem matters

It sits in the sweet spot of interview difficulty: multiple valid approaches, clear trade-offs. Official solution notes mention: + 4^10)_.

AlgoForge explanations are original teaching notes. Always open the official problem statement on LeetCode for constraints and examples.

Interview Walkthrough

Interview approach for Maximum Path Quality of a Graph

Opening (30–60 seconds)

Clarify inputs/outputs and edge cases (empty input, single element, duplicates, overflow).
State a brute force so the interviewer knows you can solve it naively.
Propose the optimal direction tied to dfs backtracking.

Core solution narrative

Define the state you track (pointers, DP cell, set membership, stack top, etc.).
Explain the transition when you process the next element.
Call out time (O() and space (V) before coding.
Code cleanly; narrate variable names.

What interviewers listen for

Correctness on edge cases
Complexity honesty
Ability to discuss trade-offs (e.g., hash map space vs. sort + two pointers)

Follow-up questions they may ask

Can you solve it with less memory?
What if the input stream is infinite / doesn't fit in RAM?
How would tests look for adversarial inputs?

Optimized Approach

Optimized solution notes

The reference solutions on AlgoForge target *O(* time and *V* space.

Pattern focus: dfs backtracking

Use the pattern as a checklist:

dfs backtracking — confirm the invariant holds after each step

Multiple methods appear in the source solutions — compare them and explain when each is preferable.

Implementation tips

Prefer readable names over micro-optimizations in interviews.
Extract helpers only when they clarify (e.g., expand-around-center, DFS visit).
After AC-level logic, re-scan for off-by-one and null checks.

Complexity Analysis

Complexity

Measure	Bound
Time	O(
Space	V

How to justify this in an interview

Time: count loops, map/set operations, and recursive branching; state average vs worst case if relevant.
Space: include hash maps, recursion stack, and output allocation when the problem asks for it.

If your implementation differs from the reference, re-derive big-O from your code — never memorize a complexity you cannot defend.

Common Mistakes

Common mistakes on Maximum Path Quality of a Graph

Skipping edge cases — empty collections, single-element inputs, max constraints.
Wrong invariant for dfs backtracking — updating state too early or too late.
Mutating input unexpectedly when the problem forbids it.
Off-by-one in windows, ranges, or binary search bounds.
Ignoring overflow / precision for integer arithmetic problems.
Overengineering — jumping to an advanced structure when a simpler approach works.

Alternative Approaches

Alternatives

The source file includes more than one method. Compare:

Primary optimized path — best complexity for typical interviews.
Secondary approach — often brute force, sorting-based, or space-optimized variant.

Practice articulating when you would pick each (constraints, readability, follow-ups).

Edge Cases

Edge cases checklist

Minimum input size
Maximum input size / time limits
Duplicates and already-sorted input
Negative numbers / zeros (if applicable)
Disconnected structures (graphs/trees)
Single path vs branching recursion depth

Pattern Recognition

Spotting this pattern

Signal phrases that point to dfs backtracking:

Sorted input or ability to sort without changing the answer class
Need for contiguous subarray / substring → consider sliding window
Need for O(1) membership → hash set/map
Optimal substructure + overlapping subproblems → DP
Connectivity / components → graph DFS/BFS or Union-Find

Primary topics: depth first search.

Follow-up Interview Questions

Follow-ups

How does the solution change if the input is a stream?
Can you solve it in-place?
What if duplicates must be handled differently?
How would you parallelize the approach?
Design tests that would break a buggy implementation.

Practice Recommendations

What to practice next

Re-solve Maximum Path Quality of a Graph in a second language (cpp, python).
Drill 3–5 more problems tagged depth first search.
Teach the solution out loud in under 5 minutes.
Add this problem to your revision calendar in 3 days and 14 days.

Visualization

Conceptual diagram for Maximum Path Quality of a Graph: show input structure (depth first search), highlight the moving parts of the dfs backtracking approach, and annotate each step with the maintained invariant and complexity.

Study checklist

Read the official problem statement on LeetCode
Solve on paper / whiteboard first
Implement the dfs backtracking approach
Verify edge cases from the checklist
State time and space complexity aloud
Compare with the AlgoForge reference solution
Schedule a revision session

Revision notes

Maximum Path Quality of a Graph (#2065) — Medium. Pattern: dfs backtracking. Complexity: O(\ time / V\ space. Re-derive the invariant before coding.

FAQs

What is the time complexity of Maximum Path Quality of a Graph?+

The reference solutions aim for O(\ time and V\ space. Always re-derive complexity from the code you write in the interview.

What pattern does Maximum Path Quality of a Graph use?+

It primarily maps to dfs backtracking, within the broader topic of depth first search.

Is Maximum Path Quality of a Graph good for interviews?+

Yes — as a Medium problem it is a solid practice target. Pair it with related problems in the same pattern family for spaced repetition.

Where can I read the official statement?+

Open the official LeetCode page for constraints and examples: https://leetcode.com/problems/maximum-path-quality-of-a-graph/

#	Title	Difficulty	Topics
113	Path Sum II	Medium	depth first search
199	Binary Tree Right Side View	Medium	depth first search
236	Lowest Common Ancestor of a Binary Tree	Medium	depth first search
247	Strobogrammatic Number II	Medium	depth first search
250	Count Univalue Subtrees	Medium	depth first search
364	Nested List Weight Sum II	Medium	depth first search
366	Find Leaves of Binary Tree	Medium	depth first search
417	Pacific Atlantic Water Flow	Medium	depth first search