feat: enable new langs (#42491)

Enable italian and portuguese

curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md

@@ -0,0 +1,85 @@
+---
+id: 5900f37d1000cf542c50fe8f
+title: 'Problem 16: Power digit sum'
+challengeType: 5
+forumTopicId: 301791
+dashedName: problem-16-power-digit-sum
+---
+
+# --description--
+
+2<sup>15</sup> = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
+
+What is the sum of the digits of the number 2<sup><code>exponent</code></sup>?
+
+# --hints--
+
+`powerDigitSum(15)` should return a number.
+
+```js
+assert(typeof powerDigitSum(15) === 'number');
+```
+
+`powerDigitSum(15)` should return 26.
+
+```js
+assert.strictEqual(powerDigitSum(15), 26);
+```
+
+`powerDigitSum(128)` should return 166.
+
+```js
+assert.strictEqual(powerDigitSum(128), 166);
+```
+
+`powerDigitSum(1000)` should return 1366.
+
+```js
+assert.strictEqual(powerDigitSum(1000), 1366);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function powerDigitSum(exponent) {
+
+  return true;
+}
+
+powerDigitSum(15);
+```
+
+# --solutions--
+
+```js
+function powerDigitSum(exponent) {
+  const bigNum = [1];
+  let sum = 0;
+
+  for (let i = 1; i <= exponent; i++) {
+    let count = bigNum.length + 1;
+    let overflow = 0;
+    for (let j = 0; j < count; j++) {
+      let digit = bigNum[j] || 0;
+      digit = 2 * digit + overflow;
+
+      if (digit > 9) {
+        digit -= 10;
+        overflow = 1;
+      } else {
+        overflow = 0;
+      }
+
+      bigNum[j] = digit;
+    }
+  }
+
+  bigNum.forEach(function(num) {
+    return sum += num;
+  });
+
+  return sum;
+}
+```