A classic interview question - JobHunting版 - 未名存档

本页内容为未名空间相应帖子的节选和存档，一周内的贴子最多显示50字，超过一周显示500字访问原贴

JobHunting版 - A classic interview question

相关主题
● a job opportunity
● 几道老题的解答
● (Update 2)Feedback call? 不会专门打电话根我说没戏了吧？
● 请教，背景调查中这样一句话
● 讨论几个面试题
● RF & MICROWAVE ELECTRICAL ENGINEER
● 银行职位 Sr Production Anlytc Anlyst (转载)
● 招人，automation systems engineer (转载)
● [合集] capital one 居然说不给办H-1B了
● Google电话面试题目

相关话题的讨论汇总
话题: classic话题: question话题: interview

进入JobHunting版参与讨论

1

(共1页)

c*****e 发帖数: 210	1 Given N points in a place with their (x,y) co-ordinates. Find two points with least distance between them. How?
D******n 发帖数: 2836	2 http://en.wikipedia.org/wiki/Closest_pair_of_points_problem 【在 c*****e 的大作中提到】 : Given N points in a place with their (x,y) co-ordinates. Find two points : with least distance between them. : How?

1

(共1页)

进入JobHunting版参与讨论

相关主题
● Google电话面试题目
● 报个微软的Offer
● 看一道面试题
● 怀疑我opt 申请上的姓和名颠倒了，，怎么查啊？
● 再讨论一个面试难题
● 请教一个数论的问题
● yahoo面试题
● 题目来啦
● 再来题目
● another google interview question:

相关话题的讨论汇总
话题: classic话题: question话题: interview