Careercup

Careercup - Google面试题 - 5424071030341632

2014-05-08 22:55 题目链接 原题： Given a list of strings. Produce a list of the longest common suffixes. If it asks for longest common substring, then building a suffix tree should be the way to go. But
·2015-10-30 13:08

Careercup - Google面试题 - 6331648220069888

2014-05-08 22:27 题目链接 原题： What's the tracking algorithm of nearest location to some friends that are located in a grid region? 题目：在一个格点坐标的地图里，如何追踪到一个朋友附近最近的地标？ 解法：我都不知道怎么翻译，这又是“Guy”出的一道莫名其妙的题目。
·2015-10-30 13:07

Careercup - Google面试题 - 5692127791022080

代码： 1 // http://www.careercup.com/question?id=569
·2015-10-30 13:07

Careercup - Google面试题 - 5162732873580544

2014-05-08 08:26 题目链接 原题： Given a preorder traversal, create a binary search tree in optimized time 题目：给定一个二叉搜索树的前序遍历，请重建这棵树。要求最优化算法。 解法1：这人每次出题都要求“最优算法”，自己写的代码却实在让人汗颜，让人觉得这家伙就是懒得思考，想从别人那儿问答案。前
·2015-10-30 13:06

Careercup - Google面试题 - 5765091433644032

2014-05-08 09:32 题目链接 原题： Given a binary tree, how would you copy it from one machine to the other, assume you have a flash drive. I believe we should write the binary tree to file and have the ot
·2015-10-30 13:06

Careercup - Google面试题 - 4847954317803520

2014-05-08 21:33 题目链接 原题： largest number that an int variable can fit given a memory of certain size 题目：给定特定内存大小，请问int型的变量能表示的最大整数是多少？ 解法：这个“Guy”出的题目总是这样表意不清。特定大小的内存是什么意思？他要说的是字长吧？16位int占两字节，32
·2015-10-30 13:06

Careercup - Google面试题 - 5727310284062720

2014-05-06 14:04 题目链接 原题： given an 2D matrix M, is filled either using X or O, you need to find the region which is filled by O and surrounded by X and fill it with X. example 1: X X X X
·2015-10-30 13:05

Careercup - Google面试题 - 4699414551592960

2014-05-06 13:34 题目链接 原题： we have a random list of people. each person knows his own height and the number of tall people in front of him. write a code to make the equivalent queue. for example
·2015-10-30 13:05

Careercup - Google面试题 - 4877486110277632

2014-05-08 05:16 题目链接 原题： Given a circle with N defined points and a point M outside the circle, find the point that is closest to M among the set of N. O(LogN) 题目：给定一个圆上的N个点，和一个在这个圆外部的点。请找出这N个点
·2015-10-30 13:05

Careercup - Google面试题 - 6407924087783424

2014-05-07 15:17 题目链接 原题： Given an array of n elements (a1,a2,..ai,...,an). You are allow to chose any index i and j, such that (i!=j) and allow to perform increment operation on ai = ai+1 and dec
·2015-10-30 13:05

Careercup - Google面试题 - 6283958983589888

2014-05-06 11:31 题目链接 原题： Find the k-th Smallest Element in Two Sorted Arrays. I followed the algorithm from this post, http://leetcode.com/2011/01/find-k-th-smallest-element-in-union-of.html Bu
·2015-10-30 13:04

Careercup - Google面试题 - 6271724635029504

2014-05-06 13:23 题目链接 原题： Finding a pair of elements from two sorted lists(or array) for which the sum of the elements is a certain value. Anyway solution that can do better than O(a.length + b.le
·2015-10-30 13:04

Careercup - Google面试题 - 5634470967246848

2014-05-06 07:11 题目链接 原题： Find a shortest path in a N*N matrix maze from (0,0) to (N,N), assume 1 is passable, 0 is not, 3 is destination, use memorization to cache the result. Here is my code. I
·2015-10-30 13:03

Careercup - Google面试题 - 5724823657381888

2014-05-06 06:37 题目链接 原题： Given an array of (unsorted) integers, arrange them such that a < b > c < d > e... etc. 题目：给定一个无序的数组，调整元素顺序，使得数组满足a < b > c < d > e ... 这种形式。 解
·2015-10-30 13:03

Careercup - Google面试题 - 5898529851572224

2014-05-06 07:56 题目链接 原题： Flatten an iterator of iterators in Java. If the input is [ [1,2], [3,[4,5]], 6], it should return [1,2,3,4,5,6]. Implement hasNext() and next(). Note that the inner iter
·2015-10-30 13:03

Careercup - Google面试题 - 6332750214725632

2014-05-06 10:18 题目链接 原题： Given a set of intervals, find the interval which has the maximum number of intersections (not the length of a particular intersection). So if input (1,6) (2,3) (4,11), (
·2015-10-30 13:03

Careercup - Google面试题 - 6253551042953216

2014-05-06 01:49 题目链接 原题： Modify the following code to add a row number for each line is printed public class Test { public static void main(String [] args){ printParenthesis(
·2015-10-30 13:02

Careercup - Google面试题 - 4807591515389952

2014-05-06 00:45 题目链接 原题： What would happen if you have only one server for a web cache (a web browser cache whose key is url and value is the loaded content of the webpage) but huge numbers of cl
·2015-10-30 13:02

Careercup - Google面试题 - 5661939564806144

2014-05-06 01:40 题目链接 原题： Give a N*N matrix, print it out diagonally. Follow up, if it is a M*N matrix, how to print it out. Example: 1 2 3 4 5 6 7 8 9 print: 1 2 4 3 5 7 6 8
·2015-10-30 13:02

Careercup - Google面试题 - 4716965625069568

2014-05-06 00:17 题目链接 原题： Given a 2-D matrix represents the room, obstacle and guard like the following (0 is room, B->obstacle, G-> Guard): 0 0 0 B G G B 0 0 calculate the steps f
·2015-10-30 13:02

Careercup - Google面试题 - 4857362737266688

2014-05-04 00:10 题目链接 原题： Write a function return an integer that satisfies the following conditions: 1) positive integer 2) no repeated digits, eg., 123 (valid), 122 (invalid) 3) incrementa
·2015-10-30 13:01

Careercup 论坛上较有意思的题目整理

# 数据结构类 ### 线段树 segment tree http://www.careercup.com/question?
·2015-10-30 12:42

[CareerCup] 13.3 Virtual Functions 虚函数

 13.3HowdovirtualfunctionsworkinC++? 这道题问我们虚函数在C++中的工作原理。虚函数的工作机制主要依赖于虚表格vtable，即VirtualTable。当类中定义了虚函数时，一个虚表格就建立了用来保存该类的虚函数的地址。此时编译器Compiler也会在该类中增加一个虚指针vptr(VirtualPointer)，用来指向虚表格。当一个虚函数在派生类中没有被重写时
Grandyang·2015-10-30 06:00

[CareerCup] 13.2 Compare Hash Table and STL Map 比较哈希表和Map

 13.2CompareandcontrastahashtableandanSTLmap.Howisahashtableimplemented?Ifthenumberofinputsissmall,whichdatastructureoptionscanbeusedinsteadofahashtable? 这道题让我们比较哈希表和STL中的map数据结构，在遇到这道题之前，我一直以为map就是c+
Grandyang·2015-10-30 05:00

[CareerCup] 13.1 Print Last K Lines 打印最后K行

 13.1WriteamethodtoprintthelastKlinesofaninputfileusingC++. 这道题让我们用C++来打印一个输入文本的最后K行，最直接的方法是先读入所有的数据，统计文本的总行数，然后再遍历一遍打印出最后K行。这个方法需要读两遍文件，我们想使用一种更简便的方法，只需要读取一遍文本就可以打印出最后K行，这里我们使用一个循环数组CircularArray，原理是
Grandyang·2015-10-29 12:00

[CareerCup] 12.6 Test an ATM 测试一个自动取款机

 12.6HowwouldyoutestanATMinadistributedbankingsystem? 这道题问我们如何来测试一个自动取款机，我们首先要询问下列问题：-谁来使用这些ATM？回答可能是任何人，或者是盲人，或者是其他什么答案。-这些ATM用来干什么？回答可能是取钱，汇款，查余额等。-我们用什么工具来测试？我们能接触到代码吗，还是只有ATM机子？一旦我们搞清楚了上述问题，我们可以将测
Grandyang·2015-10-28 11:00

Careercup - Microsoft面试题 - 23123665

2014-05-12 07:44 题目链接 原题： Given an array having 16000 unique integers, each lying within the range 1<x<20000, how do u sort it. U can load only 1000 numbers at a time in memory. 题目：一个数组里有1
·2015-10-27 14:58

Careercup - Microsoft面试题 - 24313662

代码： 1 // http://www.careercup.com/question?id=24313662 2 #include <iostream
·2015-10-27 14:57

Careercup - Microsoft面试题 - 24308662

2014-05-12 07:31 题目链接 原题： I have heard this question many times in microsoft interviews. Given two arrays find the intersection of those two arrays. Besides using hash table can we attain the same
·2015-10-27 14:57

Careercup - Microsoft面试题 - 5799446021406720

2014-05-12 07:17 题目链接 原题： Given below is a tree/trie A B c D e F a<b<e<>>c<>d<f<>>> above string represents the following trie/tree (visualize)
·2015-10-27 14:56

Careercup - Microsoft面试题 - 6751316000899072

2014-05-12 07:10 题目链接 原题： Write a thread safe data structure such that there could be only one writer at a time but there could be n readers reading the data. You can consider that incrementing or
·2015-10-27 14:56

Careercup - Microsoft面试题 - 5917873302142976

2014-05-12 06:56 题目链接 原题： A link list contains following elements struct node{ int data; node* next; node* random; } Given head of such a linked list write a function who
·2015-10-27 14:56

Careercup - Microsoft面试题 - 5672369481842688

代码： 1 // http://www.careercup.com/question?id=5672369481842688
·2015-10-27 14:56

Careercup - Microsoft面试题 - 4639756264669184

2014-05-12 06:42 题目链接 原题： Write your own regular expression parser for following condition: az*b can match any string that starts with and ends with b and 0 or more Z's between. for e.g. azb,
·2015-10-27 14:55

Careercup - Microsoft面试题 - 5485521224597504

2014-05-12 06:19 题目链接 原题： Given an input list of lists.. flatten the list. For e.g. {{1,2}, {3}, {4,5}} ... Output should be {1, 2, 3, 4, 5} 题目：给定一个二维数组，把它展开成一维数组。 解法：之前做了一道题，把维度不定的数组展开成一维数
·2015-10-27 14:55

Careercup - Microsoft面试题 - 5204967652589568

2014-05-11 23:57 题目链接 原题： 9 identical balls. one ball is heavy. find the heavy ball with only 2 measurements ........ dead easy. 题目：9个看起来一样的球，其中有一个偏重。给定一个不能给出具体重量，但可以比较轻重的天平，称2次找出那个重球。 解法：9个球三等
·2015-10-27 14:54

Careercup - Microsoft面试题 - 5700293077499904

2014-05-12 00:02 题目链接 原题： For a given map (ie Bing map) given longitude/latitude/ how would you design the system so that when map longitudeDelta/latitdueDelta changed you add additional pins on m
·2015-10-27 14:54

Careercup - Microsoft面试题 - 5188169901277184

2014-05-12 06:12 题目链接 原题： Write a function to retrieve the number of a occurrences of a substring(even the reverse of a substring) in a string without using the java substring() method. Ex: 'd
·2015-10-27 14:54

Careercup - Microsoft面试题 - 5175246478901248

2014-05-11 23:52 题目链接 原题： design an alarm clock for a deaf person. 题目：为聋人设计闹钟？ 解法：聋人听不见，那么闪光、震动都可行。睡着的人也看不见光，所以震动应该是更靠谱的。个人觉得做成手表戴在手上的时候，才能保证震动有用。这样，睡觉的时候就得戴着手表了。 代码： 1 // http://www.careerc
·2015-10-27 14:53

[CareerCup] 3.4 Towers of Hanoi 汉诺塔

  3.4 In the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order of si
·2015-10-27 11:56

[CareerCup] 12.5 Test a Pen 测试一支笔

 12.5Howwouldyoutestapen? 这道题让我们测试一支笔，我们需要问面试官许多问题来理解"who,what,where,when,howandwhy"，比如我们可以这样：面试官：你怎样测试一支笔？候选人：谁将要使用这笔？面试官：儿童候选人：有意思，那么他们用来干什么呢，是写字，画画，还是做别的？面试官：画画候选人：很棒，在什么上呢，纸，布上还是墙上？面试官：布上候选人：不错，笔头
Grandyang·2015-10-27 10:00

专访左程云：5年刷题大牛分享算法学习之道

最开始是把能找到的所有这方面的书全部看懂，并且实现了好几遍，然后开始刷LeetCode和CareerCup这两个网站上的题，去网上搜各种各样的分析文章，总之是把一切有关代码面试的东西都搜来学习。
u013050857·2015-10-26 15:00

careercup sumarry

http://www.foreverpostcard.com/2014/08/summary-of-ctci.html
u012175043·2015-10-26 14:00

[CareerCup] 12.4 Test a Webpage 测试一个网页

 12.4Howwouldyouloadtestawebpagewithoutusinganytesttools? 这道题问我们如何不用任何测试工具来加载测试一个网页。加载测试可以用来验证一个网站应用的最大操作容量和跟性能有关的瓶颈。同样，也可以测试应用在加载对不同情况的响应。对于家在测试，我们首先要来认证和性能密切相关的一些指标，比如：-响应时间-吞吐量-资源利用率-系统可以承受的最大加载量然后
Grandyang·2015-10-26 09:00

[CareerCup] 12.3 Test Move Method in a Chess Game 测试象棋游戏中的移动方法

 12.3Wehavethefollowingmethodusedinachessgame:booleancanMoveTo(intx,inty).ThismethodispartofthePiececlassandreturnswhetherornotthepiececanmovetoposition(x,y).Explainhowyouwouldtestthismethod. 这道题让我们测试
Grandyang·2015-10-25 09:00

[CareerCup] 12.2 Find the Reason of Crash 找到程序崩溃的原因

 12.2Youaregiventhesourcetoanapplicationwhichcrasheswhenitisrun.Afterrunningittentimesinadebugger,youfinditnevercrashesinthesameplace.Theapplicationissinglethreaded,andusesonlytheCstandardlibrary.What
Grandyang·2015-10-24 11:00

[CareerCup] 12.1 Find Mistakes 找程序错误

 12.1Findthemistake(s)inthefollowingcode:unsignedinti; for(i=190;i>=0;--i) printf("%d\n",i); 这道题让我们找出给定的简短的程序的错误，这里共有两处错误：1.无符号整型永远大于0，所以i>=0没有意义2.打印无符号整型要用%u正确代码参见下方： unsignedinti; for(i=190;i>0;-
Grandyang·2015-10-23 07:00

[CareerCup] 11.8 The Rank of Number 数的排行

 11.8Imagineyouarereadinginastreamofintegers.Periodically,youwishtobeabletolookuptherankofanumberx(thenumberofvalueslessthanorequaltox).Implementthedatastructuresandalgorithmstosupporttheseoperations.
Grandyang·2015-10-22 11:00

《产品经理面试宝典》丨NOTES

作者简介GayleLaakmannMaDowell是CareerCup.com的创始人兼CEO。曾在微软、苹果与谷歌担任软件工程师。作为
少穻·2015-10-20 21:42

[CareerCup] 11.7 Tower of People in Circus 马戏团的人塔

 11.7Acircusisdesigningatowerroutineconsistingofpeoplestandingatoponeanother'sshoulders.Forpracticalandaestheticreasons,eachpersonmustbebothshorterandlighterthanthepersonbelowhimorher.Giventheheightsa
Grandyang·2015-10-19 12:00
上一页 2 3 4 5 6 7 8 9 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他