Add solution #1738

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,511 LeetCode solutions in JavaScript
+# 1,512 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1339,6 +1339,7 @@
 1735|[Count Ways to Make Array With Product](./solutions/1735-count-ways-to-make-array-with-product.js)|Hard|
 1736|[Latest Time by Replacing Hidden Digits](./solutions/1736-latest-time-by-replacing-hidden-digits.js)|Easy|
 1737|[Change Minimum Characters to Satisfy One of Three Conditions](./solutions/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.js)|Medium|
+1738|[Find Kth Largest XOR Coordinate Value](./solutions/1738-find-kth-largest-xor-coordinate-value.js)|Medium|
 1748|[Sum of Unique Elements](./solutions/1748-sum-of-unique-elements.js)|Easy|
 1749|[Maximum Absolute Sum of Any Subarray](./solutions/1749-maximum-absolute-sum-of-any-subarray.js)|Medium|
 1752|[Check if Array Is Sorted and Rotated](./solutions/1752-check-if-array-is-sorted-and-rotated.js)|Easy|

solutions/1738-find-kth-largest-xor-coordinate-value.js

@@ -0,0 +1,37 @@
+/**
+ * 1738. Find Kth Largest XOR Coordinate Value
+ * https://leetcode.com/problems/find-kth-largest-xor-coordinate-value/
+ * Difficulty: Medium
+ *
+ * You are given a 2D matrix of size m x n, consisting of non-negative integers. You are also
+ * given an integer k.
+ *
+ * The value of coordinate (a, b) of the matrix is the XOR of all matrix[i][j] where
+ * 0 <= i <= a < m and 0 <= j <= b < n (0-indexed).
+ *
+ * Find the kth largest value (1-indexed) of all the coordinates of matrix.
+ */
+
+/**
+ * @param {number[][]} matrix
+ * @param {number} k
+ * @return {number}
+ */
+var kthLargestValue = function(matrix, k) {
+  const rows = matrix.length;
+  const cols = matrix[0].length;
+  const xorValues = new Array(rows * cols);
+  const prefixXor = Array.from({ length: rows + 1 }, () => Array(cols + 1).fill(0));
+
+  let index = 0;
+  for (let i = 1; i <= rows; i++) {
+    for (let j = 1; j <= cols; j++) {
+      prefixXor[i][j] = prefixXor[i-1][j] ^ prefixXor[i][j-1]
+        ^ prefixXor[i-1][j-1] ^ matrix[i-1][j-1];
+      xorValues[index++] = prefixXor[i][j];
+    }
+  }
+
+  xorValues.sort((a, b) => b - a);
+  return xorValues[k-1];
+};