Available question text
Given a DAG with weighted directed edges and integers k and t, find the maximum total weight strictly less than t of any path that uses exactly k edges. This is a bounded DP/knapsack-style search over k steps and nodes (with sums capped by t) to track which path-weight totals are achievable.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Maximum Path Quality of a Graph
Coding · Array · Backtracking · Graph Theory
- Maximum Path Sum with Conditional Node Processing
Coding
- Maximum Sum Leaf to Root Path in Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3543. Maximum Weighted K-Edge Path
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source