Leetcode 1449. Form Largest Integer With Digits That Add up to Target

Given costs for digits 1–9 and a total budget target, return the largest possible positive integer (as a string) whose digits' costs sum exactly to target, or "0" if impossible. This is an exact-knapsack dynamic programming problem: maximize the number (length) of digits and then pick the lexicographically/largest numeric arrangement (prefer higher digits) while ensuring feasibility for the remaining cost.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1449. Form Largest Integer With Digits That Add up to Target

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact