谷歌Onsite+题目分类总结

下面的有些是截前辈面经跟LZ一样的

上半场三个

第1轮，很Nice的国人

怎么爬网页纪录网页里的http link

DSF VS BSF

LZ碰到的100+个面试官，最喜欢的，没有之一。

第2轮，烙印

getList()

正确输入：{“a”, “b”, “w”} ->{“Ra”, “Rb”, “Rw”}

错误输入：{“a”, “m”, “w”}->{}有错即空

要求实现

getCorrectList() {“a”, “m”, “w”}->{“Ra”,“Rw”}

即返回正确部分

O(n)->O(log(n)

逐个发请求 VS Binary Search， worst case

三哥好像不知道最坏的情况复杂度是NLogN 。LZ说从Root到Leaf是LogN，每个发一次是N。

然后他说，Worse than N。超级鄙视他。

第3轮，白人

A->B, C

B->D

D->F

Graph->标准拓扑排序

A->B->C->D->F, A->B->D->F->C

追问有环

中场吃饭，国人帅哥陪吃。谷歌的饭实在不行呀。

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

补充内容 (2017-1-19 18:05):
HC没过，等一年，HR说Design不行，就是最后一轮挂了。感觉运气很重要，如果是第一个哥们考设计，估计就过了。不过这次的算法是比上次做得好，上次都没有送HC。Good Luck[/i][/i][/i]

"Google _ LeetCode OJ.pdf" 这不就是leetcode 网站的总结吗，楼主 还我一升米！

补充内容 (2017-1-3 12:34):
多谢 忆梦前尘 :-)

yangzhit 发表于 2016-12-4 16:57
第2轮：有个API对于正确输入，输入a, 返回 Ra；输入b, 返回Rb；输入{a, b},返回{Ra, Rb}。如果输入错误{a,b ...

第二题最直接的就是输入过一遍吧 O(n). a返回RA就加入结果里, b返回Rb就加入, m没返回,就不加.. 最后返回就好了吧.???

要是想加快,可以binary search.  左边一半search, 右边一半search,要是返回的非空, 就加结果里. 要是空的, 就继续2分.. 总复杂度O(logn)吧

对么..?

Hash Table

288. Unique Word Abbreviation Easy
463. Island Perimeter
447. Number of Boomerangs
247. Strobogrammatic Number II Medium
246. Strobogrammatic Number Easy
274. H-Index
422. Valid Word Square Hard
389. Find the Difference Easy
340. Longest Substring with At Most K Distinct Characters Hard
314. Binary Tree Vertical Order Traversal Medium
266. Palindrome Permutation Easy

Topological Sort

444. Sequence Reconstruction medium
329. Longest Increasing Path in a Matrix Hard
269. Alien Dictionary Hard
210. Course Schedule II

MATH
369. Plus One Linked List Medium
66. Plus One Easy
248. Strobogrammatic Number III
247. Strobogrammatic Number II Medium
246. Strobogrammatic Number Easy
231. Power of Two Easy
415. Add Strings
400. Nth Digit Easy 一亩三分地
397. Integer Replacement Medium
391. Perfect Rectangle
368. Largest Divisible Subset Medium
360. Sort Transformed Array Medium
357. Count Numbers with Unique Digits Medium
356. Line Reflection Medium
326. Power of Three Easy
313. Super Ugly Number Medium
279. Perfect Squares Medium
224. Basic Calculator Hard
166. Fraction to Recurring Decimal Medium

STRING
459. Repeated Substring Pattern
271. Encode and Decode Strings Medium
422. Valid Word Square Hard
409. Longest Palindrome Easy
408. Valid Word Abbreviation Easy
345. Reverse Vowels of a String Easy
340. Longest Substring with At Most K Distinct Characters Hard
293. Flip Game Easy
249. Group Shifted Strings Easy
214. Shortest Palindrome Hard
159. Longest Substring with At Most Two Distinct Characters Hard
158. Read N Characters Given Read4 II - Call multiple times Hard
157. Read N Characters Given Read4
139. Word Break Medium
28. Implement strStr()

Binary Indexed Tree
308. Range Sum Query 2D - Mutable Hard
307. Range Sum Query - Mutable
303. Range Sum Query - Immutable
315. Count of Smaller Numbers After Self
218. The Skyline Problem Hard


Backtracking
37. Sudoku Solver
36. Valid Sudoku
411. Minimum Unique Word Abbreviation Hard
320. Generalized Abbreviation Medium
288. Unique Word Abbreviation
294. Flip Game II Medium
425. Word Squares Hard
401. Binary Watch Easy
357. Count Numbers with Unique Digits Medium
351. Android Unlock Patterns Medium
216. Combination Sum III
212. Word Search II Hard
140. Word Break II Hard
139. Word Break
44. Wildcard Matching Hard
40. Combination Sum II
39. Combination Sum
22. Generate Parentheses Medium
17. Letter Combinations of a Phone Number Medium
10. Regular Expression Matching Hard

这周就面啦。 多谢信息。

Trie
208. Implement Trie (Prefix Tree) Medium
17. Letter Combinations of a Phone Number
425. Word Squares Hard
212. Word Search II Hard
79. Word Search
421. Maximum XOR of Two Numbers in an Array Medium
336. Palindrome Pairs Hard
212. Word Search II Hard


Greedy
406. Queue Reconstruction by Height Medium
402. Remove K Digits Medium
358. Rearrange String k Distance Apart Hard
330. Patching Array Hard
321. Create Maximum Number Hard
316. Remove Duplicate Letters Hard
253. Meeting Rooms II  Medium
44. Wildcard Matching Hard


Bit Manipulation
421. Maximum XOR of Two Numbers in an Array Medium
411. Minimum Unique Word Abbreviation Hard
401. Binary Watch Easy
397. Integer Replacement Medium
393. UTF-8 Validation Medium
389. Find the Difference Easy
318. Maximum Product of Word Lengths Medium
231. Power of Two Easy

题目不难啊 求第二轮详细 没太看懂

同问第二题，没看懂，多谢楼主