Hit Counter - Amazon Top Interview Questions


Problem Statement :


Implement a hit counter which keeps track of number of the number of hits in the last 60 seconds.

add(int timestamp) which adds timestamp in seconds in the hit counter
count(int timestamp) which returns the number of hits that have been made in the last 60 seconds, given the current time is timestamp.
You can assume that the timestamps passed into add and count are monotonically increasing.

Constraints

n ≤ 100,000 where n is the number of calls that are made to add and count

Example 1

Input

methods = ["constructor", "add", "add", "count", "add", "count"]
arguments = [[], [10], [40], [40], [70], [100]]`

Output

[None, None, None, 2, None, 2]

Explanation

We create a HitCounter
We add timestamp 10 to the data structure
We add timestamp 40 to the data structure
We count the number of timestamps that are within last 60 seconds of 40. There's 10 and 40 so we 
return 2
We add timestamp 70 to the data structure
We count the number of timestamps that are within last 60 seconds of 100. There's 40 and 70 so we return 2


Solution :



title-img 




                        Solution in C++ :

class HitCounter {
    public:
    vector<int> v;
    HitCounter() {
    }

    void add(int timestamp) {
        v.push_back(timestamp);
    }

    int count(int timestamp) {
        return v.end() - lower_bound(v.begin(), v.end(), timestamp - 60);
    }
};
                    




                        Solution in Python : 
                            
class HitCounter:
    def __init__(self):
        self.q = deque()

    def _cleanup(self, timestamp):
        while self.q and timestamp - self.q[0] > 60:
            self.q.popleft()

    def add(self, timestamp):
        self.q.append(timestamp)

    def count(self, timestamp):
        self._cleanup(timestamp)
        return len(self.q)


View More Similar Problems

Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →

Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →

Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →

Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →

No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →

Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →