Add solution #359

Author: JoshCrozier

README.md

@@ -347,6 +347,7 @@
 356|[Line Reflection](./solutions/0356-line-reflection.js)|Medium|
 357|[Count Numbers with Unique Digits](./solutions/0357-count-numbers-with-unique-digits.js)|Medium|
 358|[Rearrange String k Distance Apart](./solutions/0358-rearrange-string-k-distance-apart.js)|Hard|
+359|[Logger Rate Limiter](./solutions/0359-logger-rate-limiter.js)|Easy|
 363|[Max Sum of Rectangle No Larger Than K](./solutions/0363-max-sum-of-rectangle-no-larger-than-k.js)|Hard|
 365|[Water and Jug Problem](./solutions/0365-water-and-jug-problem.js)|Medium|
 367|[Valid Perfect Square](./solutions/0367-valid-perfect-square.js)|Easy|

solutions/0359-logger-rate-limiter.js

@@ -0,0 +1,35 @@
+/**
+ * 359. Logger Rate Limiter
+ * https://leetcode.com/problems/logger-rate-limiter/
+ * Difficulty: Easy
+ *
+ * Design a logger system that receives a stream of messages along with their timestamps.
+ * Each unique message should only be printed at most every 10 seconds (i.e. a message
+ * printed at timestamp t will prevent other identical messages from being printed until
+ * timestamp t + 10).
+ *
+ * All messages will come in chronological order. Several messages may arrive at the same timestamp.
+ *
+ * Implement the Logger class:
+ * - Logger() Initializes the logger object.
+ * - bool shouldPrintMessage(int timestamp, string message) Returns true if the message should
+ *   be printed in the given timestamp, otherwise returns false.
+ */
+
+var Logger = function() {
+  this.messageTimestamps = new Map();
+};
+
+/**
+ * @param {number} timestamp
+ * @param {string} message
+ * @return {boolean}
+ */
+Logger.prototype.shouldPrintMessage = function(timestamp, message) {
+  const nextAllowed = this.messageTimestamps.get(message) || 0;
+  if (timestamp >= nextAllowed) {
+    this.messageTimestamps.set(message, timestamp + 10);
+    return true;
+  }
+  return false;
+};