Puzzle Master
Browse more Celebrities / Public Figures
Affiliation:
Facebook
Location:
Palo Alto, CA, 94301
Birthday:
December 24, 1997

Information

Detailed Info

Website:
http://www.facebook.com/jobs_puzzles
Personal Information:
Small, fuzzy, curious.
Personal Interests:
Puzzles, hiding existence from humans, finding ways to type faster with no hands or fingers.

Contact Info

Email:
Displaying 3 of 13 notes

Mini-Feed

Displaying 5 stories
.
August 28

Puzzle Master wrote on their own wall.

8:14am
August 27

Puzzle Master wrote on their own wall.

5:43pm

Puzzle Master discussed Small World question on their discussion board.

5:39pm
August 25

Puzzle Master wrote a note.

9:43pm
New Puzzle: It's A Small World
It is a small world after all! The newest puzzle to join our ranks is a snack sized puzzle that should provide an afternoon or three of enjoyment.
Continue Reading...
August 21

Puzzle Master wrote on their own wall.

3:01pm

Facebull -- NP-hard?

2 posts by 1 person. Updated 10 hours ago.

Java

14 posts by 4 people. Updated on Aug 28, 2008 at 3:45 PM.

Small World question

3 posts by 2 people. Updated on Aug 27, 2008 at 6:08 PM.
Displaying 5 of 113 wall posts.
Illze wrote at 11:07am on August 28th, 2008
where do i find the puzzles on this page
Puzzle Master wrote at 8:14am on August 28th, 2008
That is correct, treat the latitude and longitude as Cartesian coordinates, even though the world is round. This works for city or continent scoped data sets, although it is not strictly correct for the global case.
Animesh wrote at 11:03pm on August 27th, 2008
For the small world problem, you have mentioned to assume that the world is flat. Does that mean that two places with co-ordinate values 0,170 and 0,0 will have more distance among them than places with co-ordinate values 0,50 and 0,0?

On globe, the first pair will be close together than second pair.
Puzzle Master wrote at 5:43pm on August 27th, 2008
The runtime is the expected runtime, not the worst case. In the case of our puzzles, the runtimes are more guidelines than hard rules. It's just that a puzzle that has an O(n^2) algorithm will be unlikely to complete in the given time. Best of luck and puzzle on!
Zhaosheng wrote at 5:18pm on August 27th, 2008
for the small world problem, is there algorithm can promise better than O(n^2). I can just think about some optimization but can not prove the time complexity is better. Just want to know yes or no. THANKS

Fans

6 of 467 fans
Prakash
Noelle
Paul
Gustavo
Joanne
Colin