Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3543. Maximum Weighted K-Edge Path
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.