Add solution #1449

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,307 LeetCode solutions in JavaScript
+# 1,308 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1106,6 +1106,7 @@
 1446|[Consecutive Characters](./solutions/1446-consecutive-characters.js)|Easy|
 1447|[Simplified Fractions](./solutions/1447-simplified-fractions.js)|Medium|
 1448|[Count Good Nodes in Binary Tree](./solutions/1448-count-good-nodes-in-binary-tree.js)|Medium|
+1449|[Form Largest Integer With Digits That Add up to Target](./solutions/1449-form-largest-integer-with-digits-that-add-up-to-target.js)|Hard|
 1450|[Number of Students Doing Homework at a Given Time](./solutions/1450-number-of-students-doing-homework-at-a-given-time.js)|Easy|
 1451|[Rearrange Words in a Sentence](./solutions/1451-rearrange-words-in-a-sentence.js)|Medium|
 1455|[Check If a Word Occurs As a Prefix of Any Word in a Sentence](./solutions/1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.js)|Easy|

solutions/1449-form-largest-integer-with-digits-that-add-up-to-target.js

@@ -0,0 +1,39 @@
+/**
+ * 1449. Form Largest Integer With Digits That Add up to Target
+ * https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target/
+ * Difficulty: Hard
+ *
+ * Given an array of integers cost and an integer target, return the maximum integer you can
+ * paint under the following rules:
+ * - The cost of painting a digit (i + 1) is given by cost[i] (0-indexed).
+ * - The total cost used must be equal to target.
+ * - The integer does not have 0 digits.
+ *
+ * Since the answer may be very large, return it as a string. If there is no way to paint any
+ * integer given the condition, return "0".
+ */
+
+/**
+ * @param {number[]} cost
+ * @param {number} target
+ * @return {string}
+ */
+var largestNumber = function(cost, target) {
+  const maxDigits = new Array(target + 1).fill('0');
+  maxDigits[0] = '';
+
+  for (let current = 1; current <= target; current++) {
+    for (let digit = 1; digit <= 9; digit++) {
+      const prev = current - cost[digit - 1];
+      if (prev >= 0 && maxDigits[prev] !== '0') {
+        const candidate = digit + maxDigits[prev];
+        if (candidate.length > maxDigits[current].length
+            || (candidate.length === maxDigits[current].length && candidate > maxDigits[current])) {
+          maxDigits[current] = candidate;
+        }
+      }
+    }
+  }
+
+  return maxDigits[target];
+};