feat: add solutions to lc problems: No.2681,2683 (doocs#1324)

* No.2681.Power of Heroes
* No.2683.Neighboring Bitwise XOR

Author: yanglbme

solution/2600-2699/2681.Power of Heroes/README.md

@@ -148,6 +148,24 @@ func sumOfPower(nums []int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function sumOfPower(nums: number[]): number {
+    const mod = 10 ** 9 + 7;
+    nums.sort((a, b) => a - b);
+    let ans = 0;
+    let p = 0;
+    for (let i = nums.length - 1; i >= 0; --i) {
+        const x = BigInt(nums[i]);
+        ans = (ans + Number((x * x * x) % BigInt(mod))) % mod;
+        ans = (ans + Number((x * BigInt(p)) % BigInt(mod))) % mod;
+        p = Number((BigInt(p) * 2n + x * x) % BigInt(mod));
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2600-2699/2681.Power of Heroes/README_EN.md

@@ -121,6 +121,24 @@ func sumOfPower(nums []int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function sumOfPower(nums: number[]): number {
+    const mod = 10 ** 9 + 7;
+    nums.sort((a, b) => a - b);
+    let ans = 0;
+    let p = 0;
+    for (let i = nums.length - 1; i >= 0; --i) {
+        const x = BigInt(nums[i]);
+        ans = (ans + Number((x * x * x) % BigInt(mod))) % mod;
+        ans = (ans + Number((x * BigInt(p)) % BigInt(mod))) % mod;
+        p = Number((BigInt(p) * 2n + x * x) % BigInt(mod));
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2600-2699/2681.Power of Heroes/Solution.ts

@@ -0,0 +1,13 @@
+function sumOfPower(nums: number[]): number {
+    const mod = 10 ** 9 + 7;
+    nums.sort((a, b) => a - b);
+    let ans = 0;
+    let p = 0;
+    for (let i = nums.length - 1; i >= 0; --i) {
+        const x = BigInt(nums[i]);
+        ans = (ans + Number((x * x * x) % BigInt(mod))) % mod;
+        ans = (ans + Number((x * BigInt(p)) % BigInt(mod))) % mod;
+        p = Number((BigInt(p) * 2n + x * x) % BigInt(mod));
+    }
+    return ans;
+}

solution/2600-2699/2683.Neighboring Bitwise XOR/README.md

@@ -141,6 +141,18 @@ func doesValidArrayExist(derived []int) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function doesValidArrayExist(derived: number[]): boolean {
+    let s = 0;
+    for (const x of derived) {
+        s ^= x;
+    }
+    return s === 0;
+}
+```
+
 ### **...**
 
 ```

solution/2600-2699/2683.Neighboring Bitwise XOR/README_EN.md

@@ -113,6 +113,18 @@ func doesValidArrayExist(derived []int) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function doesValidArrayExist(derived: number[]): boolean {
+    let s = 0;
+    for (const x of derived) {
+        s ^= x;
+    }
+    return s === 0;
+}
+```
+
 ### **...**
 
 ```

solution/2600-2699/2683.Neighboring Bitwise XOR/Solution.ts

@@ -0,0 +1,7 @@
+function doesValidArrayExist(derived: number[]): boolean {
+    let s = 0;
+    for (const x of derived) {
+        s ^= x;
+    }
+    return s === 0;
+}