Contact: Post by robertengle » Fri Dec 05, 2014 9:52 am 简单的 if n even then n = n/2, if n odd then n = 3*n-1; 终止条件是 n==1; there is overflow find min and max in an array. 有一个算法: compare arr[i], arr[i+1] -> tmin, tmax compare min, tmin compare max, tmax Snake and ledder: arc-->dest need how many dices? (dice:1-6) 在x,y平面上有一些正方形的房子. 如果用它top, down, left, righ(data type: float)来描述这些房子的话, down永远是0 (房子不会在天上); 接着把所有房子的正方形涂黑,要我list 黑色区域的顶点 [contour following] Topological sort. a. 他说不用,就考虑lock - unlock状态,假设每个卡有一个id d. 假设这个人的卡丢了, etc. 整个过程我都在见招拆招(所以feedback可能不会很好). 如果一开始把所有东西都考虑一遍一步到位就好了. An arbitrary tree. split it into as many subtrees as you can. the number of nodes of the subtree must be even. [nodes with even #nodes in the subtree can be the root of an even-subtree] ============================================================================== Return random node of a list, what if it can be modified concurrently[?]. 1k Ads, how to make it only appear once across all servers, no master server.
Read full article from Google面经总结 - quant365.com
No comments:
Post a Comment