由买买提看人间百态

boards

本页内容为未名空间相应帖子的节选和存档,一周内的贴子最多显示50字,超过一周显示500字 访问原贴
JobHunting版 - Google Phone Interview
相关主题
[合集] google interview question继续贴几个题目
限时2分钟请教一个算法题
这题怎么做?discuss an array rearrange question
Google电面题2轮Amazon电面
comparisionamazon电面 + facebook 电面
bloomberg面试经历请问一下最大增长子序列的O(nLogk)算法
微软一个面试题ms onsite 杯具,攒rp发面经
一朋友被Google的电面干掉了 (转载)请教一道题目!
相关话题的讨论汇总
话题: my话题: given话题: answer话题: google话题: interview
进入JobHunting版参与讨论
1 (共1页)
c********a
发帖数: 16
1
1. Research topic
2. Algorithms questions
(1) Given an arry of integers, how to find the maximum and mininum?
My first answer is 2N comparisons. Then the interviewer asked how to
improve the number of comparisions.
(2) Given two sorted arrays of size m and n respectively. How to merge them
together? Write the code.
My answer is m + n. Then he asked what happen if m >> n.
My answer is interting the n numbers to the larger array by binary search
.
The complexity is O(nlog m).
(3) How to d
1 (共1页)
进入JobHunting版参与讨论
相关主题
请教一道题目!comparision
数组里面找数个出现了奇数次的整数,怎么找?bloomberg面试经历
请教大家一道“Programming Pearls" 上面的题目微软一个面试题
anybody remember this question?? (about sorting)一朋友被Google的电面干掉了 (转载)
[合集] google interview question继续贴几个题目
限时2分钟请教一个算法题
这题怎么做?discuss an array rearrange question
Google电面题2轮Amazon电面
相关话题的讨论汇总
话题: my话题: given话题: answer话题: google话题: interview