Add solution #1169

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,162 LeetCode solutions in JavaScript
+# 1,163 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -910,6 +910,7 @@
 1161|[Maximum Level Sum of a Binary Tree](./solutions/1161-maximum-level-sum-of-a-binary-tree.js)|Medium|
 1162|[As Far from Land as Possible](./solutions/1162-as-far-from-land-as-possible.js)|Medium|
 1163|[Last Substring in Lexicographical Order](./solutions/1163-last-substring-in-lexicographical-order.js)|Hard|
+1169|[Invalid Transactions](./solutions/1169-invalid-transactions.js)|Medium|
 1189|[Maximum Number of Balloons](./solutions/1189-maximum-number-of-balloons.js)|Easy|
 1200|[Minimum Absolute Difference](./solutions/1200-minimum-absolute-difference.js)|Easy|
 1206|[Design Skiplist](./solutions/1206-design-skiplist.js)|Hard|

solutions/1169-invalid-transactions.js

@@ -0,0 +1,46 @@
+/**
+ * 1169. Invalid Transactions
+ * https://leetcode.com/problems/invalid-transactions/
+ * Difficulty: Medium
+ *
+ * A transaction is possibly invalid if:
+ * - the amount exceeds $1000, or;
+ * - if it occurs within (and including) 60 minutes of another transaction with the same name in
+ *   a different city.
+ *
+ * You are given an array of strings transaction where transactions[i] consists of comma-separated
+ * values representing the name, time (in minutes), amount, and city of the transaction.
+ *
+ * Return a list of transactions that are possibly invalid. You may return the answer in any order.
+ */
+
+/**
+ * @param {string[]} transactions
+ * @return {string[]}
+ */
+var invalidTransactions = function(transactions) {
+  const parsed = transactions.map(t => {
+    const [name, time, amount, city] = t.split(',');
+    return { name, time: Number(time), amount: Number(amount), city };
+  });
+
+  const invalid = new Set();
+
+  for (let i = 0; i < parsed.length; i++) {
+    const current = parsed[i];
+    if (current.amount > 1000) {
+      invalid.add(i);
+    }
+
+    for (let j = 0; j < parsed.length; j++) {
+      const other = parsed[j];
+      if (i !== j && current.name === other.name
+          && Math.abs(current.time - other.time) <= 60 && current.city !== other.city) {
+        invalid.add(i);
+        invalid.add(j);
+      }
+    }
+  }
+
+  return [...invalid].map(index => transactions[index]);
+};