!!!Interview

Facebook interview - Move all zeroes to end of array

Given an array of random numbers, Push all the zero’s of a given array to the end of the array. For example, if the given arrays is {1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0}, it should be changed to {1,
yuanhsh·2015-03-19 03:00

英文自我介绍范例

It is really my honor to have this opportunity for a interview, I hope i can make a good performance
jis117·2015-03-18 17:00

Google Interview - 从海量数据中找出中位数

有几百亿的整数，分布的存储到几百台通过网络连接的计算机上，你能否开发出一个算法和系统，找出这几百亿数据的中值？就是在一组排序好的数据中居于中间的数。显然，一台机器是装不下所有的数据，也尽量少用网络带宽。我的算法训练挺少的，只能自己谈些自己的心得。1.获得题目，要仔细研读，迅速转化为数学模型。混乱 -->有序 ， 局部-->整体。大问题化解为小问题来求解。这时，我们的思路 大概就是出来了
yuanhsh·2015-03-18 12:00

Google Interview - 从海量数据中找出中位数

有几百亿的整数，分布的存储到几百台通过网络连接的计算机上，你能否开发出一个算法和系统，找出这几百亿数据的中值？就是在一组排序好的数据中居于中间的数。显然，一台机器是装不下所有的数据，也尽量少用网络带宽。我的算法训练挺少的，只能自己谈些自己的心得。1.获得题目，要仔细研读，迅速转化为数学模型。混乱 -->有序 ， 局部-->整体。大问题化解为小问题来求解。这时，我们的思路 大概就是出来了
yuanhsh·2015-03-18 12:00

Amazon interview Questions Cheatsheet

From: http://techinterviewsolutions.net/2012/08/13/amazon-interview-questions-cheatsheet/ List Intersection
yuanhsh·2015-03-18 01:00

Amazon interview Questions Cheatsheet

From: http://techinterviewsolutions.net/2012/08/13/amazon-interview-questions-cheatsheet/ List Intersection
yuanhsh·2015-03-18 01:00

Amazon interview Questions Cheatsheet

阅读更多From:http://techinterviewsolutions.net/2012/08/13/amazon-interview-questions-cheatsheet/ListIntersectionProblemGiventhat
yuanhsh·2015-03-18 01:00

DropBox Interview - Repeating Pattern Match

You are given a pattern, such as "abab". You are also given a string, example "redblueredblue". You need to write a program that tells whether the string follows the given pattern
yuanhsh·2015-03-16 00:00

DropBox Interview - Repeating Pattern Match

You are given a pattern, such as "abab". You are also given a string, example "redblueredblue". You need to write a program that tells whether the string follows the given pattern
yuanhsh·2015-03-16 00:00

Google Interview - Find Meeting Point (Manhattan distance)

I. Manhattan distanceIn a city there are N persons. A person can walk only horizontally or vertically. Find a point that minimizes the sum of distances all persons walk to the point.This is called the
yuanhsh·2015-03-16 00:00

Google Interview - Find Meeting Point (Manhattan distance)

I. Manhattan distanceIn a city there are N persons. A person can walk only horizontally or vertically. Find a point that minimizes the sum of distances all persons walk to the point.This is called the
yuanhsh·2015-03-16 00:00

Linkedin Interview - K closest points

Find the K closest points to the origin in a 2D plane, given an array containing N points.   Max Heap: O(NlogN) Selection Algorithm: O(N) 下面给出基于Max Heap的实现。 /* public class Point { pub
yuanhsh·2015-03-16 00:00

Linkedin Interview - Sum of NestedInteger

Given a nested list of integers, returns the sum of all integers in the list weighted by their depth  For example, given the list {{1,1},2,{1,1}} the function should return 10 (four 1's at depth
yuanhsh·2015-03-16 00:00

INTERVIEW: YARCDATA ON BIG DATA AND SEMANTIC WEB

11August2013 by IanJacobs |Postedin: Interviews, SemanticWebIrecentlyspokewithShoaibMufti,YarcDataVicePresidentofR
Airship·2015-03-14 15:00

Interview Question List 2

Facebook实际题目 1. 把一个binary tree变成double linked list。 也是写一个recursive in-order traversal, update pointer 的时候稍微有点tricky. 2. 第二题是经典的计算 x/y 不用 division operator. 我说用 log 和 exp, 他说可以。又问这些也不能用怎么办。 提示了一下 x,
yuanhsh·2015-03-14 00:00

Interview Question List 2

Facebook实际题目 1. 把一个binary tree变成double linked list。 也是写一个recursive in-order traversal, update pointer 的时候稍微有点tricky. 2. 第二题是经典的计算 x/y 不用 division operator. 我说用 log 和 exp, 他说可以。又问这些也不能用怎么办。 提示了一下 x,
yuanhsh·2015-03-14 00:00

Interview Question List 2

阅读更多Facebook实际题目1.把一个binarytree变成doublelinkedlist。也是写一个recursivein-ordertraversal,updatepointer的时候稍微有点tricky.2.第二题是经典的计算x/y不用divisionoperator.我说用log和exp,他说可以。又问这些也不能用怎么办。提示了一下x,y都是正整数的话，从x减去y一直减到0,看要减
yuanhsh·2015-03-14 00:00

Interview Question List 1

阅读更多DataStructures1.Integer-findnumberof1s-nextlargestsmaller-smallestlargernumber-determineifispalindrom-itoa,atoi-add2numbersw/ousing+orarithmeticoperators-implement*,-,/usingonly+-findmaxoftwonumbe
yuanhsh·2015-03-14 00:00

Interview Question List 1

Data Structures   1. Integer - find number of 1s - next largest smaller - smallest larger number - determine if is palindrom - itoa, atoi - add 2 numbers w/o using + or arithmetic
yuanhsh·2015-03-14 00:00

Interview Question List 1

Data Structures   1. Integer - find number of 1s - next largest smaller - smallest larger number - determine if is palindrom - itoa, atoi - add 2 numbers w/o using + or arithmetic
yuanhsh·2015-03-14 00:00

Facebook interview - Prime Number Combination Product

给一个质数数组，返回所有可能的product，顺序不管 比如给 [2,3,5] 返回 [2,3,5,6,10,15,30] 数组中的数如果有重复则需要去重，不允许用set。 比如给 [2,2,2] 返回 [2,4,8]，顺序不用管。   public List<Integer> combinePrimeProduct(int[] primes) { Arrays
yuanhsh·2015-03-13 00:00

Facebook interview - Prime Number Combination Product

给一个质数数组，返回所有可能的product，顺序不管 比如给 [2,3,5] 返回 [2,3,5,6,10,15,30] 数组中的数如果有重复则需要去重，不允许用set。 比如给 [2,2,2] 返回 [2,4,8]，顺序不用管。   public List<Integer> combinePrimeProduct(int[] primes) { Arrays
yuanhsh·2015-03-13 00:00

Cracking the coding interview（中文版）

谷歌面试官经典作品(CTCI)目录1.1判断一个字符串中的字符是否唯一1.2字符串翻转1.3去除字符串中重复字符1.8利用已知函数判断字符串是否为另一字符串的子串2.1从链表中移除重复结点2.2实现一个算法从一个单链表中返回倒数第n个元素2.3给定链表中间某结点指针，删除链表中该结点2.4求由两个链表结点组成的数之和2.5给定一个循环链表，实现一个算法返回这个环的开始结点3.1如何只用一个数组实现
guang09080908·2015-03-09 20:00

一次谷歌面试趣事

本文是从 AGoogleInterviewingStory 这篇文章翻译而来。        很多年前我进入硅谷人才市场，当时是想找一份高级工程师的职位。
千岁千岁·2015-03-06 14:57

一次谷歌面试趣事

本文是从 AGoogleInterviewingStory 这篇文章翻译而来。        很多年前我进入硅谷人才市场，当时是想找一份高级工程师的职位。
千岁千岁·2015-03-06 14:57

Print a Binary Tree Vertical Order (column wise)

This is a Facebook interview question.
yuanhsh·2015-03-06 13:00

Print a Binary Tree Vertical Order (column wise)

This is a Facebook interview question.
yuanhsh·2015-03-06 13:00

Amazon Interview - Longest Repeated Substring

Givenatextstring,find LongestRepeatedSubstring inthetext.IftherearemorethanoneLongestRepeatedSubstrings,getanyoneofthem.LongestRepeatedSubstringinGEEKSFORGEEKSis:GEEKS LongestRepeatedSubstringinAAAAA
yuanhsh·2015-02-28 15:00

Amazon Interview - Longest Repeated Substring

Given a text string, find Longest Repeated Substring in the text. If there are more than one Longest Repeated Substrings, get any one of them. Longest Repeated Substring in GEEKSFORGEEKS is
yuanhsh·2015-02-28 15:00

[待续]Bloomberg Interview - Find Airport Path

Good day I just got a question which is the following  you have an vector like this  [JFK, LXA, SNA, RKJ, LXA, SNA] each 2 group define a route. so, JFK -> LXA SNA ->
yuanhsh·2015-02-28 15:00

[待续]Bloomberg Interview - Find Airport Path

阅读更多GooddayIjustgotaquestionwhichisthefollowingyouhaveanvectorlikethis[JFK,LXA,SNA,RKJ,LXA,SNA]each2groupdefinearoute.so,JFK->LXASNA->RKJLXA->SNAFindthepathfromdeparturetodestination.note:departureand
yuanhsh·2015-02-28 15:00

[待续]Bloomberg Interview - Find Airport Path

GooddayIjustgotaquestionwhichisthefollowing youhaveanvectorlikethis [JFK,LXA,SNA,RKJ,LXA,SNA] each2groupdefinearoute.so, JFK->LXA SNA->RKJ LXA->SNA Findthepathfromdeparturetodestination.note:departure
yuanhsh·2015-02-28 15:00

CC150 Arrays and Strings 1.1 ~ 1.3 Unique Characters, Reverse String, IsPermutation

解答如下：publicclassstringUniqueChar{ //askyourintervieweriftheinputstringisASCIIorUnicod
feliciafay·2015-02-23 15:00

interview recall

给一个unsorted  positiveintegerarray,没有duplicate,输出是一个integer和这个integer后面第一个大于该integer的那个数，这道题可以用stack来做，代码如下：#include #include using namespace std; const int maxn = 100; int a[maxn],b[maxn]; stack as
minglotus·2015-02-23 12:00

Facebook interview - Dot Product of Sparse Vector

Whatisamemory-efficientwaytostoreavectorofintegers?Follow-upquestion:usingyourproposeddatastructure,findanalgorithmwithconstantmemoryusagetocalculatethedotproductoftwovectors. 有两个很大的稀疏向量，问怎么存储和算他们的dot
yuanhsh·2015-02-22 03:00

Facebook interview - Dot Product of Sparse Vector

What is a memory-efficient way to store a vector of integers? Follow-up question: using your proposed data structure, find an algorithm with constant memory usage to calculate the dot product of two v
yuanhsh·2015-02-22 03:00

Facebook phone interview

OnlineRound2codingquestionsweregiven,andthetimewas75minutes.1.Therearentreesinacircle.Eachtreehasafruitvalueassociatedwithit.Abirdcansitonatreefor0.5secandthenhehastomovetoaneighbouringtree.Ittakesthe
yuanhsh·2015-02-22 03:00

Facebook phone interview

Online Round2 coding questions were given, and the time was 75 minutes.1. There are n trees in a circle. Each tree has a fruit value associated with it. A bird can sit on a tree for 0.5 sec and then h
yuanhsh·2015-02-22 03:00

Some Google Interview Questions

GoogleInterviewQuestions:SoftwareEngineerWhyaremanholecoversround?
yuanhsh·2015-02-22 03:00

Some Google Interview Questions

阅读更多GoogleInterviewQuestions:SoftwareEngineerWhyaremanholecoversround?
yuanhsh·2015-02-22 03:00

Some Google Interview Questions

Google Interview Questions: Software Engineer Why are manhole covers round?
yuanhsh·2015-02-22 03:00

Facebook的一些面试题

YouwillbeaskedtocodeusingaWhiteboardasopposedtoyourcomputer–thereforepracticeonpaperafewtimesbeforetheinterviewifyou
yuanhsh·2015-02-22 02:00

Facebook的一些面试题

YouwillbeaskedtocodeusingaWhiteboardasopposedtoyourcomputer–thereforepracticeonpaperafewtimesbeforetheinterviewifyou
yuanhsh·2015-02-22 02:00

Facebook的一些面试题

using a Whiteboard as opposed to your computer – therefore practice on paper a few times before the interview
yuanhsh·2015-02-22 02:00

Facebook的一些面试题

using a Whiteboard as opposed to your computer – therefore practice on paper a few times before the interview
yuanhsh·2015-02-22 02:00

Java实现二叉树

java实现二叉树 代码如下： package com.huawei.interview; public class Node { public int
bystander_·2015-02-21 19:00

Book List

++EffectiveC++MoreEffectiveC++深度探索C++对象模型|C++标准程序库-自修教程与参考手册STL源码剖析EffectiveSTL编程之美CrackingtheCodingInterviewGoogleC
u011331383·2015-02-20 19:00

纹理合成

OCTOBER23,2014Whatinthispostisactuallypartofmycomputationalphotographyhomework,becauseI’mrecentlypreparingforinterviews
todayq·2015-02-13 09:00

Google Interview - Celebrity Problem

Celebrityproblem:Youhavearoomwithnpeople.Acelebritywalksin.Everyoneknowsthecelebrity,thecelebrityknowsnoone.Non-celebritiesmay/maynotknowanyoneintheroom.Giveanalgorithmtofindthecelebrity.Discussthecom
yuanhsh·2015-02-06 03:00

Google Interview - Celebrity Problem

Celebrityproblem:Youhavearoomwithnpeople.Acelebritywalksin.Everyoneknowsthecelebrity,thecelebrityknowsnoone.Non-celebritiesmay/maynotknowanyoneintheroom.Giveanalgorithmtofindthecelebrity.Discussthecom
yuanhsh·2015-02-06 03:00
上一页 89 90 91 92 93 94 95 96 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他