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.