diff --git a/solution/2600-2699/2683.Neighboring Bitwise XOR/README.md b/solution/2600-2699/2683.Neighboring Bitwise XOR/README.md
index 304d374be5a98..0503b372ae1e6 100644
--- a/solution/2600-2699/2683.Neighboring Bitwise XOR/README.md	
+++ b/solution/2600-2699/2683.Neighboring Bitwise XOR/README.md	
@@ -43,7 +43,7 @@ tags:
 <pre><strong>输入：</strong>derived = [1,1,0]
 <strong>输出：</strong>true
 <strong>解释：</strong>能够派生得到 [1,1,0] 的有效原始二进制数组是 [0,1,0] ：
-derived[0] = original[0] ⊕ original[1] = 0 ⊕ 1 = 1 
+derived[0] = original[0] ⊕ original[1] = 0 ⊕ 1 = 1
 derived[1] = original[1] ⊕ original[2] = 1 ⊕ 0 = 1
 derived[2] = original[2] ⊕ original[0] = 0 ⊕ 0 = 0
 </pre>
@@ -164,4 +164,30 @@ function doesValidArrayExist(derived: number[]): boolean {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Counting
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function doesValidArrayExist(derived: number[]): boolean {
+    return derived.reduce((a, b) => a + b, 0) % 2 === 0;
+}
+```
+
+#### JavaScript
+
+```js
+function doesValidArrayExist(derived: number[]): boolean {
+    return derived.reduce((a, b) => a + b, 0) % 2 === 0;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->
diff --git a/solution/2600-2699/2683.Neighboring Bitwise XOR/README_EN.md b/solution/2600-2699/2683.Neighboring Bitwise XOR/README_EN.md
index 9c28e18331126..99101d56d5715 100644
--- a/solution/2600-2699/2683.Neighboring Bitwise XOR/README_EN.md	
+++ b/solution/2600-2699/2683.Neighboring Bitwise XOR/README_EN.md	
@@ -43,7 +43,7 @@ tags:
 <strong>Input:</strong> derived = [1,1,0]
 <strong>Output:</strong> true
 <strong>Explanation:</strong> A valid original array that gives derived is [0,1,0].
-derived[0] = original[0] &oplus; original[1] = 0 &oplus; 1 = 1 
+derived[0] = original[0] &oplus; original[1] = 0 &oplus; 1 = 1
 derived[1] = original[1] &oplus; original[2] = 1 &oplus; 0 = 1
 derived[2] = original[2] &oplus; original[0] = 0 &oplus; 0 = 0
 </pre>
@@ -165,4 +165,30 @@ function doesValidArrayExist(derived: number[]): boolean {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Counting
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function doesValidArrayExist(derived: number[]): boolean {
+    return derived.reduce((a, b) => a + b, 0) % 2 === 0;
+}
+```
+
+#### JavaScript
+
+```js
+function doesValidArrayExist(derived: number[]): boolean {
+    return derived.reduce((a, b) => a + b, 0) % 2 === 0;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->
diff --git a/solution/2600-2699/2683.Neighboring Bitwise XOR/Solution2.js b/solution/2600-2699/2683.Neighboring Bitwise XOR/Solution2.js
new file mode 100644
index 0000000000000..e8841b8a96be1
--- /dev/null
+++ b/solution/2600-2699/2683.Neighboring Bitwise XOR/Solution2.js	
@@ -0,0 +1,3 @@
+function doesValidArrayExist(derived: number[]): boolean {
+    return derived.reduce((a, b) => a + b, 0) % 2 === 0;
+}
diff --git a/solution/2600-2699/2683.Neighboring Bitwise XOR/Solution2.ts b/solution/2600-2699/2683.Neighboring Bitwise XOR/Solution2.ts
new file mode 100644
index 0000000000000..e8841b8a96be1
--- /dev/null
+++ b/solution/2600-2699/2683.Neighboring Bitwise XOR/Solution2.ts	
@@ -0,0 +1,3 @@
+function doesValidArrayExist(derived: number[]): boolean {
+    return derived.reduce((a, b) => a + b, 0) % 2 === 0;
+}