b***z
发帖数: 2723 | 1 The Society of Automotive Engineers (SAE) has established a numerical code
system for grading motor oils according to their viscosity characteristics.
SAE viscosity gradings include the following, from low to high viscosity: 0,
5, 10, 15, 20, 25, 30, 40, 50 or 60. The numbers 0, 5, 10, 15 and 25 are
suffixed with the letter W, designating their "winter" (not "weight") or
cold-start viscosity, at lower temperature. The number 20 comes with or
without a W, depending on whether it is being used to ... 阅读全帖 |
|
m*****a
发帖数: 374 | 2 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
若干HP G6-1D60US LAPTOP receipt for easy rebate
由于限定了1 per name/address/household，所以出让若干张receipt。凭着receipt
no.， 可以做staples easy rebate, 选择面值50的check, prepaid visa card or
staples GC，
需要的条件：此期间你没从staples买到HP Notebook PC ending with the suffix "US
".，比较熟悉staples easy rebate，一个地址只做一个rebate。
单张面值:
50
可接受价格(必须明码标价！):
45
另外，你可以把receipt加到你的普通staples账户里(350)
物品新旧要求:
邮寄方式要求:
email code
买卖双方谁承担邮寄损失(Required if not code only):
before me after you
付款方式说明:
BOA, non-cc paypal
其他... 阅读全帖 |
|
p*****u
发帖数: 21812 | 3 rebate name: $50 (U.S) easy/mail-in rebate when you purchase a qualifying HP
Notebook PC ending with the suffix "US".
rebate amount: $50
rebate limit: no limit (如果因为被怀疑是reseller,因而没拿到rebate后果自负)
ask for $40 (BOA)
(I will provide easy rebate ID, rebate offer number and product SN for rebat
e submission). |
|
n******m
发帖数: 1551 | 4 我是从staples网站上订的G72-B66，昨天收到的，但是我到网上去submit rebate，它
就报错，不让我提交。
Please come back when you have received your purchase.
You will need the serial number from the product you ordered to submit this
rebate. Please come back when you receive the product for offer 3286058 - $
50 (U.S) easy/mail-in rebate when you purchase a qualifying HP Pavilion
notebook PC ending with the suffix "US"..
If you would like to submit another rebate from this order, click the '
Submit Rebate' button below.
实际上我都已经拿到电脑了，or... 阅读全帖 |
|
c*****n
发帖数: 4880 | 5 To sign up for and use Amazon Student, you must (1) have an Amazon.com
account, (2) be a college student actively enrolled in at least one course
at a college geographically located in one of the 50 United States or the
District of Columbia, (3) be able to provide proof of enrollment upon
request and (4) have a valid e-mail address that contains the domain suffix
.edu. We may accept or refuse membership in our sole discretion. We may ask
you to furnish documentation supporting your eligibility. ... 阅读全帖 |
|
c***u
发帖数: 4107 | 6 严重搭车请教:
我买了2台HP suffix-US的电脑, 一台17寸, 一台15寸, 同时都是同一个easy rebate(
rebate号码一模一样).
请问, 我输入easy rebate的时候, 正好把2个SN输入反了.
(也就是17寸的receipt number, 输入了15寸的SN; 然后15存到receipt, 输入了17寸的
SN).
请问, 这样情况下, HP/staples的easy rebate有问题吗? |
|
c***u
发帖数: 4107 | 7 就是staples买的HP suffix US的笔记本, 那个rebate, 虽然是unlimited for
customer/address. 但是会不会一个地址submit了N个以后(N>10), 他们说是"resell/
bulk"(或者其他理由)给拒了 |
|
r******l
发帖数: 1118 | 8 网上给我以下信息，但是没有给出填写Serial Number的地方。
Staples Easy Rebates®- Serial Number Required
Please come back when you have received your purchase.
You will need the serial number from the product you ordered to submit this
rebate. Please come back when you receive the product for offer 3290496 - $
50 (U.S) easy/mail-in rebate when you purchase a qualifying HP Notebook PC
ending with the model suffix "US"..
If you would like to submit another rebate from this order, click the '
Submit Rebate' butto... 阅读全帖 |
|
o********n
发帖数: 1060 | 9 网上填的时候，没机会输入sn。。。填了order number和rebate offer number 就出现
下面这个：
Staples Easy Rebates®- Serial Number Required
Please come back when you have received your purchase.
You will need the serial number from the product you ordered to submit this
rebate. Please come back when you receive the product for offer 3291014 - $
50 (U.S) easy/mail-in rebate when you purchase a qualifying HP Notebook PC
ending with the model number suffix "US"..
If you would like to submit another rebate from this order, cl... 阅读全帖 |
|
t*****y
发帖数: 8155 | 10 有人遇到过吗？
You will need the serial number from the product you ordered to submit this
rebate. Please come back when you receive the product for offer 3292296 - $
50 (U.S) easy/mail-in rebate when you purchase a qualifying HP Notebook PC
ending with the suffix "US".. |
|
n****b
发帖数: 744 | 11 Chosen Women Choosing Chinese Men
A tradition of love?
by Jocelyn Eikenburg
Are you Jewish?" I am asked. This is not new to me. I hear this all the time
because my last name ends in "burg," a common Jewish suffix.
So I wasn't surprised when I heard it from Arnold, a new friend of mine from
the local gym in Cleveland Heights, Ohio. He knew my last name because I
had handed him my business card weeks before. And he was, after all, as bold
as the espresso in the coffee shop where I met him.
When he... 阅读全帖 |
|
c**i
发帖数: 6973 | 12 Ben Bland, Israelis Kibbutzniks Give Vietnamese Farmworkers Lessons in How
Milk it; A businesswoman has enlisted unlikely help for high-tech dairy.
Financial Times, Mar 18, 2011.
http://www.ft.com/cms/s/0/7ee50218-50c7
-11e0-9227-00144feab49a.html
My comment:
(a) dairying (n): "the business of operating a dairy"
All definitions are from www.m-w.com, except (c).
(b) kibbutznik (n; Yiddish kibutsnik, from kibuts kibbutz (from Modern
Hebrew qibbūṣ) + -nik, agent suffix): "a member of a kibbut... 阅读全帖 |
|
j**l
发帖数: 2911 | 13 好像是编程珠玑的一章，用了suffix array |
|
f*********5
发帖数: 576 | 14 这么老的帖子都被你翻出来了？
这个题有更好的方法可以用Generalized suffix tree。
但是LCA的O（1）算法恐怕不太好写。。 |
|
j***r
发帖数: 69 | 15 我提供一个思路：
先把这个问题简化为---判断substr是否是str的一个suffix. 这个可以用 Dynamic
Programming 在 O(mn)的时间完成。剩下的就容易了。 |
|
z********y
发帖数: 109 | 16 haha
看错了。这个可以用suffix tree做吧 |
|
t******e
发帖数: 1293 | 17 2.Wildcard string matching
非suffix tree，而用递归的代码，希望有帮助
这个题目有几个变种：
第一个变种：类似DOS文件名的Wildcard string matching，代码在
http://xoomer.virgilio.it/acantato/dev/wildcard/wildmatch.html
他们能做到的是满足以下条件的match
# Character matching is case insensitive.
# The metacharacter '*' matches any sequence of zero or more characters.
For instance "*.ZIP" matches ".zip", "A*.bbb" matches "A.bbb" or "Axyz.BBB".
# The metacharacter '?' matches exactly one character unless that character
is a period ('.').
# File name matching |
|
a*****e
发帖数: 51 | 18 What does 'the smallest window' mean? Dose it mean that within this window, every unique words appear? If it is the case, then the following solution attacks:
Build a suffix tree for the text, each node contains a link list of
positions of the corresponding words in ascending order. So you would have something like:
Node1: 4->12->27->30->...
Node2: 14->22->37->40->...
Node3: 2->5->12->28->...
.
Node M: 12->13->27->32->... M be the #of unique words
Maintain a variable MinD for the current minimu |
|
b******7
发帖数: 79 | 19 Given a dictionary, and k characters, please find the longest word containg
the k characters. The ordering of these k characters does not matter and it
is not necessary they appear in the word continuously.
You preprocess the dictonary such that each time the query can be processed
efficiently for any given k characters.
以前的解use suffix tree or assign a int values to each character. None of
them work well.
不知道哪位能有什么高见呢？请赐教！ |
|
g*******y
发帖数: 1930 | 20 呵呵，发现我说错了。这题用suffix tree好像不是很适合呢
就DP做吧 |
|
|
z*f
发帖数: 293 | 22 来自主题: JobHunting版 - 新鲜面试题 为什么SUFFIX TREE 不行？ |
|
b***e
发帖数: 1419 | 23 来自主题: JobHunting版 - 新鲜面试题 suffix tree 是干连续的, 子序列不灵. |
|
k***e
发帖数: 556 | 24 来自主题: JobHunting版 - 新鲜面试题 不是很明白你的解法，有如下问题：
For the first 7 chars in the url, we will do the full subsequence
construct. This way, the explosion is controlled within 2^7 = 128,
which is probably fine.
这个2^7是怎么来的啊？
对于使用trie,我的问题是如果开头就是*应该怎么匹配?
关于使用wildcard ? 来匹配一个字符,在algorithm on strings, trees and
sequences中有一个简单的使用suffix trie的算法,复杂度将是
km, k指?的数目,m是src string的长度
而本题是用*匹配,复杂度应该更高 |
|
|
k***e
发帖数: 556 | 26 最简单的n^2，用类似radix tree？
即使nlogn好像也要借助suffix array，也不trivial
靠 谁考这个我当场和他拼了
血溅五步 哈哈
out |
|
k***e
发帖数: 556 | 27 那里傻x老印太多
上次有道题要用suffix tree才能做，我就写了一下大概的方法
结果一个老印居然鄙视我 说应该写出code来
无语中 |
|
i****h
发帖数: 321 | 28 第一题可以用generalized suffix tree
但是onsite应该不会要求写这么复杂的程序吧。
for
be |
|
r**u
发帖数: 1567 | 29 第一个就是suffix tree吧
them.
last |
|
m*****f
发帖数: 1243 | 30 no, suffix tree will be too expensive ba...
should be Rabin-Karp algorithm. |
|
g*******y
发帖数: 1930 | 31 I think
suffix tree can achieve O(k^2*n)
Rabin-Karp can achieve O(k*n^2)
where
k = # of strings
n = length of string
so, depending on which parameter is larger, you can have different choice. |
|
A*******k
发帖数: 72 | 32 generally true. but the suffix approach can achieve kn (instead of k^2*n) if
the pre-process is a little smarter |
|
T*****J
发帖数: 193 | 33 呵呵， 已经很详细了， 多谢分享！
说过，真正的牛人太多了，不过有很多不常来这里或者不常发言。这个版上我印象最深
的是两个牛人，blaze和algorithmics。我只不过是经常没事喜欢回帖子而已，偶尔蒙
对几道题。。。
两个小时就头昏脑胀想睡觉了，做题兴趣来了可以搞一整天甚至加个通宵。所以经验也
没多少，就是多做题，多想题。同时一边做题，一边总结和学习。
题，后来就没碰了。我上个暑假花时间把CLRS基本看完了一遍，上学期又修了系里的算
法课，其他的书我只完整看过Programming Interview Expose,不过这个比较简单。一
直觉得没时间看Prog. Pearl，不过觉得有时间看一下还是很不错的。
的题都做不出来。。。
本版泡了几个月每天check一下有没有什么有趣的题目，等等。
multilevel hash”, "构建BST达到logn加速搜索"，等等，以后可以应用很多次的。如
果遇到以前没学过的话题，比如suffix tree, KD-tree等等，可以当作一个topic去学
。另外分冶和动态也是要必须搞熟的两种太有用处的解题思路。 |
|
k*i
发帖数: 220 | 34 等的就是高人你。
好有启发性，我慢慢研究，不懂再问。
common anceaster).
Obviously, if you are looking at a specific suffix, you can get a pointer to
the corresponding leaf node in O(1) time.
appear at same position |
|
g*****u
发帖数: 298 | 35 比如pattern为www.i*a*c.com，那么应该找到www.icabc.com, www.isdfac.com,...
怎么建立index及search呢？我想用suffix tree，但是具体算法应该怎样写呢？ |
|
|
m******9
发帖数: 968 | 37 如果对方要求写这个，我猜想 要么觉得candidate是牛人，要么就是故意想整死对方 |
|
|
g*******y
发帖数: 1930 | 39 还留作业？
也是amazon吗？
第二个题好像用第一题的函数复杂度还有些高，应该换一种方法，从中间往前后两个方
向开始比较，用suffix tree做的话是最优解，但是这个又不可能写code。 |
|
g*******y
发帖数: 1930 | 40 再说说附加的有些有用的东西可以学学：
trie,
suffix tree,
bit operations(推荐一个stanford的网页)
more hashing techniques:{dynamic hashing, extensible hashing, 还有个分级的
hashing不知道正规叫法叫什么}
backtracking
欢迎补充
排序什么这类基础问题就假定大家都会了，你要不会或者不熟可以去看看把基础打牢)
是至少弄懂明白个意思/思路，面试考到的机会不大就是了，不要求你能写出来code来(
不过要是遇到bt的公司然后RBT的code也别来怪我啊，呵呵)，14的思想值得学习和体会
，14都属于比较进阶一点的内容了，涉及到的面试题也算是难度等级较高的题目了
常重要，非常有用
是有些用处的，对于一些large scale题或者涉及到数据库实现的，19 20看看结论就好
了，从没看面试题目中出现过，21呢是高级进阶的东西，你如果学会了正好遇上用武之
地能说一说也会是很impressive的
coding？22肯定要熟悉的，23 24 25很少见到有直接考的(见过一道care |
|
w******k
发帖数: 917 | 41 网上见过这么多考题
还真没见过KMP, BM之类的string matching算法的
suffix tree就更不用说了
有谁见过考得么？ |
|
w******k
发帖数: 917 | 42 这个是说个suffix tree的idea
没法写code的吧 |
|
r****o
发帖数: 1950 | 43 3. 一道字典题目。 随即给出7个不同的字母，然后给一个字典，找出字典中长度为2-7
的由这7个字母组成的所有单词。字母不重复
请问这一题是要用suffix tree吗？
4. 一道简单的两个日志文件记录了登陆的UserID，找出昨天登陆今天没登陆的。
这一题是编程还是linux command? |
|
|
P********l
发帖数: 452 | 45 Depends.
suppose there are 1,000 words in the dictionary.
If the telephone number is only 3 digits, you can transform the numbers into
words and lookup the dictionary
to see if it is there. Because there are only 3**3 = 27 kinds of combination
. no pre prcessing needed.
If the telephone is 10 digits, the corresponding space of words is too large
. you have to invert index the
dictionary by telephone numbers. Build a suffix tree and you can directly
lookup the numbers. |
|
j**l
发帖数: 2911 | 46 被面到的概率大么？
是递归还是动态规划？要用到trie或者suffix tree么？
谁有简洁清晰的思路？ |
|
a*u
发帖数: 97 | 47 又查了下，brute force就是n^2lgn, 但是现在有improved O（nlgn）算法，也有exact
bound n的算法了。恩
) |
|
s******t
发帖数: 2374 | 48 你这个问题是不是programming pearls的题目？ |
|
i****h
发帖数: 321 | 49 如果要O(n1+n2)得到，是不是只有suffix tree的方法啊？谢谢。 |
|
|
