LeetCode 933: Number of Recent Calls Solution

Master LeetCode problem 933 (Number of Recent Calls), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

933. Number of Recent Calls

Easy

Design Queue Data Stream

Problem Explanation

Explanation:

We can use a queue to keep track of the requests within the time frame of 3000 milliseconds.
When a new request comes in, we remove all requests outside the time frame from the front of the queue.
We add the new request to the back of the queue and return the size of the queue, which represents the number of requests within the time frame. Solution:

Solution Code

class RecentCounter {
    Queue<Integer> requests;

    public RecentCounter() {
        requests = new LinkedList<>();
    }

    public int ping(int t) {
        while (!requests.isEmpty() && requests.peek() < t - 3000) {
            requests.poll();
        }
        requests.offer(t);
        return requests.size();
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 933 (Number of Recent Calls)?

This page provides optimized solutions for LeetCode problem 933 (Number of Recent Calls) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 933 (Number of Recent Calls)?

The time complexity for LeetCode 933 (Number of Recent Calls) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 933 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 933 in Java, C++, or Python.

Back to LeetCode Solutions