Add solution #2698

Author: JoshCrozier

README.md

@@ -582,6 +582,7 @@
 2693|[Call Function with Custom Context](./2693-call-function-with-custom-context.js)|Medium|
 2694|[Event Emitter](./2694-event-emitter.js)|Medium|
 2695|[Array Wrapper](./2695-array-wrapper.js)|Easy|
+2698|[Find the Punishment Number of an Integer](./2698-find-the-punishment-number-of-an-integer.js)|Medium|
 2703|[Return Length of Arguments Passed](./2703-return-length-of-arguments-passed.js)|Easy|
 2704|[To Be Or Not To Be](./2704-to-be-or-not-to-be.js)|Easy|
 2705|[Compact Object](./2705-compact-object.js)|Medium|

solutions/2698-find-the-punishment-number-of-an-integer.js

@@ -0,0 +1,45 @@
+/**
+ * 2698. Find the Punishment Number of an Integer
+ * https://leetcode.com/problems/find-the-punishment-number-of-an-integer/
+ * Difficulty: Medium
+ *
+ * Given a positive integer n, return the punishment number of n.
+ *
+ * The punishment number of n is defined as the sum of the squares of all integers i such that:
+ * - 1 <= i <= n
+ * - The decimal representation of i * i can be partitioned into contiguous substrings such that
+ *   the sum of the integer values of these substrings equals i.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var punishmentNumber = function(n) {
+  function canPartition(num, target, start) {
+    if (!target && start === num.length) {
+      return true;
+    } else if (start >= num.length) {
+      return false;
+    }
+    for (let i = start, sum = 0; i < num.length; i++) {
+      sum = sum * 10 + +num[i];
+      if (sum > target) {
+        break;
+      } else if (canPartition(num, target - sum, i + 1)) {
+        return true;
+      }
+    }
+
+    return false;
+  }
+
+  let result = 0;
+  for (let i = 1; i <= n; i++) {
+    if (canPartition((i * i).toString(), i, 0)) {
+      result += i * i;
+    }
+  }
+
+  return result;
+};