z***m
发帖数: 1602 | 1 背景： EE通信PHD，转行的，接近4年通信chip公司经验。
我都是直接找朋友要的recruiter的email，发信过去，然后他们约了时间随便聊聊就安
排店面。也有内推的，反应慢一些，但也有反应。
店面
F: add two binary string, follow up是任意进制 （最多到16进制），第一次面，脑
子不灵，加上用collabedit时把网页调成125%,改code是两行叠一起了，没法看。就没
有时间做第二题了。
本以为妥妥悲剧了，结果国人小哥直接防水让onsite，感谢感谢。
L：又是一个中国小哥，
1.maximum depth of tree 热身
2.find number in rotated sorted array
3.把一个数，比如24，写成factor的乘积组合， 2*12， 2*2*3，。。。。（这道本来
不要求，只要说思路，但是我边说思路变写，很快就写完了）
onsite
F：1.find bad version, 比如isgood(version 1) = true, isgood(version 30) =
false, 找出第一个出错的... 阅读全帖 |
|
p*****2
发帖数: 21240 | 2
是4不象，哈哈。
val res = io.Source.fromURL(url)(io.Codec.UTF8).mkString
val deals = parse(res).extract[List[DealMeta]]
.filter(_.customer_taxonomy_hierarchy.getOrElse(List.empty[Taxonomy]).
exists(_.isGoods))
for(i<-deals) yield {
val taxonomy = i.customer_taxonomy_hierarchy.get
.filter(_.isGoods)
.map(_.category.get)
.groupBy(identity)
.mapValues(_.size)
.toList
.sortBy(- _._2)
val epoch = (List(DateTime.now, new DateTime(... 阅读全帖 |
|
I**A
发帖数: 2345 | 3 45分钟，问了三道题目
（1）Give some scenarios where you might favor O(n^2) algorithm over a O(nlg
(n)) one
（2）Implement an algorithm int removeDuplicate(char[] s)
For instance change ”abbcccdda” to “abcda” and return 4(the number of
characters deleted).
（3）Implement an algorithm to check whether brace expressions are valid or
not
boolean isGood(String s, String braces); //assume braces are valid,{}[]()
题目超级简单
可是CODE第三题的时候犯了两个小的超级低级的错误
interviewer一问，我立刻就明白了忘了check。。。
郁闷死 |
|
s*********h
发帖数: 58 | 4 Have you tried other brand formula, like allimentum(spell is not right here)
. We used it for my son when he was 1-month old. His eczema was much better
. Now he outgrow it. Don't feel sad if you can't breastfeed your baby. It
isgood for both mom and baby. I went through the same thing. Now I think my
husband made correct decision. |
|
h*****0
发帖数: 4889 | 5 我觉得这种写法不好。应该加个函数isGood()之类的（自动转换也是调用函数了的，效
率一样），好读多了。 |
|
t****t
发帖数: 6806 | 6 Usually it is used in context such as
while (cin>>something) {
...
};
as opposed to
while (cin) { // while (cin.isgood())
...
}
In fact, std::basic_ios has a lot of members to check state, such as
good(), eof(), fail(), bad(). You can call them explicitly if you want
to do that (actually bool(cin) == !cin.fail()). But usually this is not
correct:
while (cin) { // or while (!cin.fail())
cin>> something;
...
}
check C++ FAQ lite. |
|
l*******G
发帖数: 1191 | 7 Chapra book of vba isgood |
|
|
