From 06e1245cfa2aa01b6d007a802dc6611e464000c8 Mon Sep 17 00:00:00 2001
From: Abhishek Tripathi <42455093+abhishektripathi66@users.noreply.github.com>
Date: Tue, 1 Oct 2024 19:30:27 +0530
Subject: [PATCH] Create RecentCounter.java

---
 Leetcode/RecentCounter.java | 36 ++++++++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100644 Leetcode/RecentCounter.java

diff --git a/Leetcode/RecentCounter.java b/Leetcode/RecentCounter.java
new file mode 100644
index 0000000..04875cf
--- /dev/null
+++ b/Leetcode/RecentCounter.java
@@ -0,0 +1,36 @@
+/**
+
+933. Number of Recent Calls
+Solved
+Easy
+Topics
+Companies
+You have a RecentCounter class which counts the number of recent requests within a certain time frame.
+
+Implement the RecentCounter class:
+
+RecentCounter() Initializes the counter with zero recent requests.
+int ping(int t) Adds a new request at time t, where t represents some time in milliseconds, and returns the number of requests that has happened in the past 3000 milliseconds (including the new request). Specifically, return the number of requests that have happened in the inclusive range [t - 3000, t].
+It is guaranteed that every call to ping uses a strictly larger value of t than the previous call.
+
+  *//
+
+class RecentCounter {
+    private static final int[] records = new int[10000]; //
+    private int start;
+    private int end;
+
+    public RecentCounter() {        
+        start = 0;
+        end = 0;
+    }
+    
+    public int ping(int t) {
+        while (start < end && (t - records[start] > 3000)) { 
+            start++; // if the difference in time is greater than 3000ms, 
+            // than increase the value of start unitl it's equal or less than 3000ms.
+        }
+        records[end++] = t; // Inserting the current time at the end
+        return end - start; // Returning the answer including the element added just now.
+    }
+}