Merge branch 'main' into main

Author: samarthswami1016

solution/2400-2499/2419.Longest Subarray With Maximum Bitwise AND/README.md

@@ -217,6 +217,51 @@ var longestSubarray = function (nums) {
 };
 ```
 
+#### C#
+
+```cs
+public class Solution {
+    public int LongestSubarray(int[] nums) {
+        int mx = nums.Max();
+        int ans = 0, cnt = 0;
+        foreach (int x in nums) {
+            if (x == mx) {
+                ans = Math.Max(ans, ++cnt);
+            } else {
+                cnt = 0;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+#### PHP
+
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function longestSubarray($nums) {
+        $mx = max($nums);
+        $ans = 0;
+        $cnt = 0;
+
+        foreach ($nums as $x) {
+            if ($x == $mx) {
+                $ans = max($ans, ++$cnt);
+            } else {
+                $cnt = 0;
+            }
+        }
+
+        return $ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2400-2499/2419.Longest Subarray With Maximum Bitwise AND/README_EN.md

@@ -215,6 +215,51 @@ var longestSubarray = function (nums) {
 };
 ```
 
+#### C#
+
+```cs
+public class Solution {
+    public int LongestSubarray(int[] nums) {
+        int mx = nums.Max();
+        int ans = 0, cnt = 0;
+        foreach (int x in nums) {
+            if (x == mx) {
+                ans = Math.Max(ans, ++cnt);
+            } else {
+                cnt = 0;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+#### PHP
+
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function longestSubarray($nums) {
+        $mx = max($nums);
+        $ans = 0;
+        $cnt = 0;
+
+        foreach ($nums as $x) {
+            if ($x == $mx) {
+                $ans = max($ans, ++$cnt);
+            } else {
+                $cnt = 0;
+            }
+        }
+
+        return $ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2400-2499/2419.Longest Subarray With Maximum Bitwise AND/Solution.cs

@@ -0,0 +1,14 @@
+public class Solution {
+    public int LongestSubarray(int[] nums) {
+        int mx = nums.Max();
+        int ans = 0, cnt = 0;
+        foreach (int x in nums) {
+            if (x == mx) {
+                ans = Math.Max(ans, ++cnt);
+            } else {
+                cnt = 0;
+            }
+        }
+        return ans;
+    }
+}

solution/2400-2499/2419.Longest Subarray With Maximum Bitwise AND/Solution.php

@@ -0,0 +1,21 @@
+class Solution {
+    /**
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function longestSubarray($nums) {
+        $mx = max($nums);
+        $ans = 0;
+        $cnt = 0;
+
+        foreach ($nums as $x) {
+            if ($x == $mx) {
+                $ans = max($ans, ++$cnt);
+            } else {
+                $cnt = 0;
+            }
+        }
+
+        return $ans;
+    }
+}

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

@@ -160,6 +160,38 @@ function doesValidArrayExist(derived: number[]): boolean {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn does_valid_array_exist(derived: Vec<i32>) -> bool {
+        derived.iter().fold(0, |acc, &x| acc ^ x) == 0
+    }
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number[]} derived
+ * @return {boolean}
+ */
+var doesValidArrayExist = function (derived) {
+    return derived.reduce((acc, x) => acc ^ x) === 0;
+};
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public bool DoesValidArrayExist(int[] derived) {
+        return derived.Aggregate(0, (acc, x) => acc ^ x) == 0;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -161,6 +161,38 @@ function doesValidArrayExist(derived: number[]): boolean {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn does_valid_array_exist(derived: Vec<i32>) -> bool {
+        derived.iter().fold(0, |acc, &x| acc ^ x) == 0
+    }
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number[]} derived
+ * @return {boolean}
+ */
+var doesValidArrayExist = function (derived) {
+    return derived.reduce((acc, x) => acc ^ x) === 0;
+};
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public bool DoesValidArrayExist(int[] derived) {
+        return derived.Aggregate(0, (acc, x) => acc ^ x) == 0;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -0,0 +1,5 @@
+public class Solution {
+    public bool DoesValidArrayExist(int[] derived) {
+        return derived.Aggregate(0, (acc, x) => acc ^ x) == 0;
+    }
+}

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

@@ -0,0 +1,7 @@
+/**
+ * @param {number[]} derived
+ * @return {boolean}
+ */
+var doesValidArrayExist = function (derived) {
+    return derived.reduce((acc, x) => acc ^ x) === 0;
+};

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

@@ -0,0 +1,5 @@
+impl Solution {
+    pub fn does_valid_array_exist(derived: Vec<i32>) -> bool {
+        derived.iter().fold(0, |acc, &x| acc ^ x) == 0
+    }
+}