b*********n
发帖数: 464 | |
c*****o
发帖数: 178 | 2 can you post the question here? Thanks! |
b*********n
发帖数: 464 | 3 totally there are 3 buffet puzzles, but I am not quite understanding the
first one. The links to the other two are:
http://www.facebook.com/careers/puzzles.php?puzzle_id=11
http://www.facebook.com/careers/puzzles.php?puzzle_id=1
【在 c*****o 的大作中提到】
: can you post the question here? Thanks!
|
z*****k
发帖数: 57 | 4 我做过facebull，没有通过。
可能是我的算法太简单了，就是简单的dfs加prune。
【在 b*********n 的大作中提到】
: totally there are 3 buffet puzzles, but I am not quite understanding the
: first one. The links to the other two are:
: http://www.facebook.com/careers/puzzles.php?puzzle_id=11
: http://www.facebook.com/careers/puzzles.php?puzzle_id=1
|
b***e
发帖数: 1419 | 5 That one is NPC, equivalent to TSP. I didn't understand, for big time,
why facebook is so stupid.
【在 z*****k 的大作中提到】
: 我做过facebull，没有通过。
: 可能是我的算法太简单了，就是简单的dfs加prune。
|
b*********n
发帖数: 464 | 6 for NPC problems, a small optimization may cause big difference in
performance. they probably want to see what optimization you can do. I think
it takes a long time for figure out a good optimization.
【在 b***e 的大作中提到】
: That one is NPC, equivalent to TSP. I didn't understand, for big time,
: why facebook is so stupid.
|
b***e
发帖数: 1419 | 7 But dude, that's the very damn problem. Say, even if I got a smart
approximation, why the hell do I tell you? I'll publish a paper and
earn
myself fame and fortune.
What's more, the funny thing is that, facebook's "puzzles" are all about
different forms of TSP or some NPC shit. What do they expect? People
to
solve these problems? People who are not familiar with the NPC
definition
to come up with a smart solution so that they can exploit? Man, I
cannot
figure this out.
Well, even taking a
【在 b*********n 的大作中提到】
: for NPC problems, a small optimization may cause big difference in
: performance. they probably want to see what optimization you can do. I think
: it takes a long time for figure out a good optimization.
|
a********a
发帖数: 219 | 8 不要老是觉得别人stupid。
不要认为他们是想窃取别人的成果，NPC问题都研究很多年了，不可能靠业余人士有改
善。这种题才能看出非职业人士的发散思维。普通题普通人都做烂了。都能作出来的题
怎么有考察意义。
同样，这种题对于职业研究算法的phd或者搞奥赛的也是没有意义的。但这些是少数群
体，可以忽略不计。
【在 b***e 的大作中提到】
: But dude, that's the very damn problem. Say, even if I got a smart
: approximation, why the hell do I tell you? I'll publish a paper and
: earn
: myself fame and fortune.
: What's more, the funny thing is that, facebook's "puzzles" are all about
: different forms of TSP or some NPC shit. What do they expect? People
: to
: solve these problems? People who are not familiar with the NPC
: definition
: to come up with a smart solution so that they can exploit? Man, I
|
z*****k
发帖数: 57 | 9 我看了一些facebull的讨论，有些算法可以在几十秒时间内解出超过一百个点的完全图
，相当惊人。
【在 a********a 的大作中提到】
: 不要老是觉得别人stupid。
: 不要认为他们是想窃取别人的成果，NPC问题都研究很多年了，不可能靠业余人士有改
: 善。这种题才能看出非职业人士的发散思维。普通题普通人都做烂了。都能作出来的题
: 怎么有考察意义。
: 同样，这种题对于职业研究算法的phd或者搞奥赛的也是没有意义的。但这些是少数群
: 体，可以忽略不计。
|
l***i
发帖数: 1309 | 10 For sophie and facebull, there are many people submitted successful solution
already, and the puzzle master themselves have their version of solutions.
Proof of NP-hardness does not stop people from looking for heuristics and
approximation solutions. sophie has a dynamic programming algorithm runs in
O(2^n*n^2) solution, which is way better than O(n!). facebull is more tricky
, and I don't see a dynamic programming solution, but some heuristic and
pruning should get you there. And those problems |
|
|
R***r
发帖数: 120 | |
b***e
发帖数: 1419 | 12 Did I "always" felt other people stupid? Well, count it in my post. I
only felt facebook puzzles being VERY stupid.
【在 a********a 的大作中提到】
: 不要老是觉得别人stupid。
: 不要认为他们是想窃取别人的成果，NPC问题都研究很多年了，不可能靠业余人士有改
: 善。这种题才能看出非职业人士的发散思维。普通题普通人都做烂了。都能作出来的题
: 怎么有考察意义。
: 同样，这种题对于职业研究算法的phd或者搞奥赛的也是没有意义的。但这些是少数群
: 体，可以忽略不计。
|
b***e
发帖数: 1419 | 13 Yea, that's what I'm talking about. So facebook will take the solutions
for free and patent them?
solution
solutions.
and
runs in
tricky
and
significance
won't go
point.
【在 l***i 的大作中提到】
: For sophie and facebull, there are many people submitted successful solution
: already, and the puzzle master themselves have their version of solutions.
: Proof of NP-hardness does not stop people from looking for heuristics and
: approximation solutions. sophie has a dynamic programming algorithm runs in
: O(2^n*n^2) solution, which is way better than O(n!). facebull is more tricky
: , and I don't see a dynamic programming solution, but some heuristic and
: pruning should get you there. And those problems
|
b***e
发帖数: 1419 | |
H*M
发帖数: 1268 | 15 support!
【在 b***e 的大作中提到】
: Dude, I already did.
|
r********t
发帖数: 395 | 16 do I need to take buffet-level puzzles? Can I do simple ones to move forward
with the facebook recruiting?
【在 b*********n 的大作中提到】
: 有人搞定了吗？想了一晚上，没有结果
|
l***i
发帖数: 1309 | 17 I am not sure but even if you solved all puzzles, they might not hire you.
forward
【在 r********t 的大作中提到】
: do I need to take buffet-level puzzles? Can I do simple ones to move forward
: with the facebook recruiting?
|
r********t
发帖数: 395 | 18 I have a question on facebull
does the result consist of all input compounds? all output compounds?
or both require all input compounds and all output compounds |
g******o
发帖数: 208 | 19 I think the point to have you do puzzle is to pre-screen.
They only ask you to solve puzzle if your resume does not show proven
programming skills.
The thing I don't like about the puzzle is there is no specification of the
input.
But as you can reduce the problem to TSP, you can bet the input is not large
.
I only tried sophia, and n<=25 is good enough for the test cases.
【在 b***e 的大作中提到】
: That one is NPC, equivalent to TSP. I didn't understand, for big time,
: why facebook is so stupid.
|
