Add solution #1380

Author: JoshCrozier

README.md

@@ -142,6 +142,7 @@
 1351|[Count Negative Numbers in a Sorted Matrix](./1351-count-negative-numbers-in-a-sorted-matrix.js)|Easy|
 1356|[Sort Integers by The Number of 1 Bits](./1356-sort-integers-by-the-number-of-1-bits.js)|Easy|
 1360|[Number of Days Between Two Dates](./1360-number-of-days-between-two-dates.js)|Easy|
+1380|[Lucky Numbers in a Matrix](./1380-lucky-numbers-in-a-matrix.js)|Easy|
 1472|[Design Browser History](./1472-design-browser-history.js)|Medium|
 1598|[Crawler Log Folder](./1598-crawler-log-folder.js)|Easy|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|

solutions/1380-lucky-numbers-in-a-matrix.js

@@ -0,0 +1,22 @@
+/**
+ * 1380. Lucky Numbers in a Matrix
+ * https://leetcode.com/problems/lucky-numbers-in-a-matrix/
+ * Difficulty: Easy
+ *
+ * Given an m x n matrix of distinct numbers, return all lucky numbers
+ * in the matrix in any order.
+ *
+ * A lucky number is an element of the matrix such that it is the minimum
+ * element in its row and maximum in its column.
+ */
+
+/**
+ * @param {number[][]} matrix
+ * @return {number[]}
+ */
+var luckyNumbers  = function(matrix) {
+  const min = matrix.map(row => Math.min(...row));
+  const max = matrix[0].map((_, i) => Math.max(...matrix.map(row => row[i])));
+
+  return min.filter(value => max.includes(value));
+};