I think the players belong to slow, mainly not very skilled master these algorithms. So I think I though easy to write bug, but it is written for a bit.
On one side there are two issues could not answer, one is only allowed to be left to the lower right on down the right dp, and then find the maximum and is a multiple of 100, this can open a multi-dimensional representation of the remainder, plus the maximum time to discuss the remainder, 100 will not be very slow *
dp [i] [j] [k] to the remainder of the i-th row j-th column is the maximum value of k
There is a Chinese dictionary tree, gbk is three bytes, so it separately, otherwise the tree too, then you can become 256 tree, but also how to optimize this, I feel it with map
Two faces was the worst, could not answer all the (personal problems, but there is also a bit noisy interviewer, I did not repeat a question
Although the freshman curriculum design has been red-black trees, AVL but I did not understand before, there is no comparison, just know that probably thinking, so my resume this one have been removed, to avoid being asked again, the specific reasons See also this blog , I also learn about
I urge the interviewer also afraid that I might cheat it, in fact, I find him a better strategy might be a hint to exist on the momentum, ask questions, although not difficult, but think about or do
The first is a string and b, a length 10W, 5W length b, a character can be changed, asking whether there is a pattern string b
Enumeration in the past on it, hash and exkmp can be. I thought hash indeed, is more than log, but did not think ah exkmp
Analyzing this point is the hash of the first half and enumeration string is not equal to b, can be extended kmp o (1) the determination, made twice as long as before and the like, too strong @ BIU brother
There is a stack of several such vectors selected from the selected mold in which the maximum
@ Green jacket grandfather up on the second, I was no idea, because I had also thought of the convex hull, but that can not explain, and I still think the previous question. So this is not a skip it and not to think
Grandpa drew a map, in fact, the convex hull of the process is to put some certainly do not contribute to vector deleted, then you can take in diameter, so how do the convex hull of the vectors it, to sort the polar angle, and then change the next board like emmmmm I really dish
The next question is relatively simple, it is to find value range exist
Quickly thought of the half, but the right is not incremented ah, but if there is a negative interval it, enumerate the left point, but the value is only 1w, so they are actually the same problem more than it, the same as the remainder are placed in a bucket, because there are positive and negative, so is the need 2w buckets, and a value as long as there are two or more numbers 1w there is a difference, the output of all sections
No momentum is the key to the failure of this interview, but I really feel entitled to think more can do, and not an interviewer Dan, I'm really too dishes