Add solution #3481

JoshCrozier · JoshCrozier · commit 3e3be10fd0e6 · 2025-07-24T00:48:59.000-05:00
diff --git a/README.md b/README.md
@@ -2708,6 +2708,7 @@
 3464|[Maximize the Distance Between Points on a Square](./solutions/3464-maximize-the-distance-between-points-on-a-square.js)|Hard|
 3466|[Maximum Coin Collection](./solutions/3466-maximum-coin-collection.js)|Medium|
 3476|[Maximize Profit from Task Assignment](./solutions/3476-maximize-profit-from-task-assignment.js)|Medium|
+3481|[Apply Substitutions](./solutions/3481-apply-substitutions.js)|Medium|
 
 ## License
 
diff --git a/solutions/3481-apply-substitutions.js b/solutions/3481-apply-substitutions.js
@@ -0,0 +1,35 @@
+/**
+ * 3481. Apply Substitutions
+ * https://leetcode.com/problems/apply-substitutions/
+ * Difficulty: Medium
+ *
+ * You are given a replacements mapping and a text string that may contain placeholders
+ * formatted as %var%, where each var corresponds to a key in the replacements mapping.
+ * Each replacement value may itself contain one or more such placeholders. Each placeholder
+ * is replaced by the value associated with its corresponding replacement key.
+ *
+ * Return the fully substituted text string which does not contain any placeholders.
+ */
+
+/**
+ * @param {string[][]} replacements
+ * @param {string} text
+ * @return {string}
+ */
+var applySubstitutions = function(replacements, text) {
+  const replacementMap = new Map(replacements);
+  const cache = new Map();
+
+  return text.replace(/%([A-Z])%/g, (match, key) => helper(key));
+
+  function helper(key) {
+    if (cache.has(key)) {
+      return cache.get(key);
+    }
+
+    const value = replacementMap.get(key);
+    const result = value.replace(/%([A-Z])%/g, (match, innerKey) => helper(innerKey));
+    cache.set(key, result);
+    return result;
+  }
+};
