## Recent Interview Questions

More Questions »- 0of 0 votes
Given a binary matrix, count the number of square that can be formed by all 0s

- 0of 0 votes
given a string p, called order, such as abc, means a in front of b, and so on

given a second string s, to determine whether it is follow the order of p, return boolean,

example If aaa return true,

If cba is false

If aaxyc is true, the letters that have not been seen in the order are skipped

- 2of 2 votes
Find whether string S is periodic.

Periodic indicates S = nP.

e.g.

S = "ababab", then n = 3, and P = "ab"

S = "xxxxxx", then n = 1, and P = "x"

S = "aabbaaabba", then n = 2, and P = "aabba"

follow up:

Given string S, find out the P (repetitive pattern) of S.

- 1of 1 vote
Design a hit counter which counts the number of hits received in the past 5 minutes.

Each function accepts a timestamp parameter (in seconds granularity) and you may assume that calls are being made to the system in chronological order (ie, the timestamp is monotonically increasing). You may assume that the earliest timestamp starts at 1.

Example:

HitCounter counter = new HitCounter();

// hit at timestamp 1.

counter.hit(1);

// hit at timestamp 2.

counter.hit(2);

// hit at timestamp 3.

counter.hit(3);

// get hits at timestamp 4, should return 3.

counter.getHits(4);

// hit at timestamp 300.

counter.hit(300);

// get hits at timestamp 300, should return 4.

counter.getHits(300);

// get hits at timestamp 301, should return 3.

counter.getHits(301);

Follow-up:

Due to latency, several hits arrive roughly at the same time and the order of timestamps is not guaranteed chronological.

Follow up 2:

What if the number of hits per second could be very large? Does your design scale?

- 0of 0 votes
Given a string as a datastream Iterator<Character>, find the length of the longest substring without repeating characters

public String longestUniqueChars(Iterator<Character> chars)