注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
本帖专精airbnb了
另外有两帖(面试经验谈(facebook,airbnb,google,linkedin,amazon))
http://www.1point3acres.com/bbs/ ... D311%26sortid%3D311
FB 面经 phone & onsite 攻略 附录题库呦
http://www.1point3acres.com/bbs/thread-191077-1-1.html
ab家,主力难点在算法 & coding。
算法 & coding
phone 一轮coding, 线上写code,然后compile 然后跑实例。
写不完code或者实例结果不对,都很可能挂掉。
他家的难度一般都是在leetcode hard level。之前出面经题的概率挺大,但按lz最近的体会,他家新增了不少新题或者实战题目。
附录airbnb题库. 准备他家的coding, 要增加胜率就只能把能见的机经都刷到吐。
leetcode 上hard的题目也要多练习。 lz结束leetcode 第四轮后, 基本hard的题目都可以12分钟左右,写完bug free的code。
lz非大牛,只发现出苦力这一条路了。 他家一轮面试45分钟。时间还是很紧的。遇到新题目,理解想思路要花5~10分钟。
和考官交流要5~10 分钟。 跑测试,至少要5分钟。所以只能努力提速了。 大家也加油。
Design : 请参考fb的design区块和下面的题库
基本相通
http://www.1point3acres.com/bbs/thread-191077-1-1.html
Culture fit:
他家这个很有意思,会有两轮。
通过只有一个技巧, 他家很有前景,你很喜欢他家的服务,他家的服务能让人更好的感受local的文化。
常见问题多练习,参考附录题库。
Backgroud:
这个也没啥,自己的project和经验要准备好,常见问题多看看。
他家的面试难度,主要在coding,其他轮感觉还ok。lz最后fail在了design。 coding 倒是遇到两新题,都解完了,coding的feedback 也不错。
也没啥可惜的了。lz尽力了。
=============================题库了=============================
From Glassdoor: 1. Given a list ofstrings, return all pairs of strings that can make a palindrome. 高频 2. TextJustification, Alien Dictionary 3. How fast canyou parse strings? The problem I was giveninvolved a bunch of ugly string data parsing and using a heuristic to modifythe data in a certain way. It was an easy problem, but they wanted a fullyworking solution within the short time limit. I couldn't finish it in time.Pick a language that has as little verbosity as possible and don't botherengaging with the interviewer because they don't care to speak with you. Theyjust want to see how fast you can code. 4. Write a CSV parser. Parse an escaped string into csvformat. 高频 5. Return the coins combination with the minimum number ofcoins.Time complexity O(MN), where M is the target value and N is the number ofdistinct coins. Space complexity O(M). 6. I had a phone screen question involving examination ofsubsets. 7. Check top 10 questions on leetcode 11. Boggle implementation (word search I, II) 12. Given a dictionary, and a matrix of letters, find all thewords in the matrix that are in the dictionary. (Going across, down ordiagonally)
- What SQL columns you should index and how would you change the indexing in different lookup scenarios?
- What can you teach me in a few minutes?
- find all the combinations of a string in lowercase and uppercase. For example, string "ab" -> "ab", "Ab", "aB", "AB". So, you will have 2^n (n = number of chars in the string) output strings. The goal is for you to test each of these string and see if it match a hidden string。
- Implement a simple regex parser which, given a string and a pattern, returns a booleanindicating whether the input matches the pattern. By simple, we mean that the regex can only contain special character: * (star), . (dot), + (plus). The star means what you'd expect, that there will be zero or more of previous character in that place in the pattern. The dot means any character for that position. The plus means one or more of previous character in that place in the pattern.
- Tell me about why you want to work here.
- Find all words from a dictionary that are x edit distance away.
- Store a set of sudden-death tournament results in a compact format (eg. a bit array) and a set of predicted match results (also in a bit array). Score the predictions, giving one point per correctly guessed match, without unpacking the bit array into a more convenient format (ie. you have to traverse the tree in-place).
20. Lots of treequestions (implement a BST, score sudden-death tournament results with a minimalbinary tree data structure, encode an alien dictionaryusing a tree and then produce a dictionary using topological traversal), and a"rebuild Twitter from the ground up" scaling/architecture question.
- Describe what happens when you enter a url in the web browser
- Sort a list of numbers in which each number is at a distance k from its actual position
- You have a plain with lots of rectangles on it, find out how many of them intersect
- Binary search tree
From MITBBS
edit distance alien dictionary,我还被问了两轮这题。。。
还有meetingroom2 电面二话不说上来就做题
一个餐馆,菜单上各种食物价格如下
A, $ X.XX
B, $ Y.YY
C, $ Z.ZZ
D, $ ...
问现在一个人有一定数额的钱,比如 $MM.MM,如何点菜才能把钱全部花完?
面试官要求列出所有可能的组合
我用了recursive的方法,写出来了
但是在比较 floatnumber的时候,细节没有处理好
直接比较 X.XX ==Y.YY 会出现错误,所以必须要做差来比较
经面试官提醒改了过来
然后周一被通知挂了
这题除了用recursive方法,有更好的解法吗?DP?
From 一亩三分地
|