登录

    热带雨林电面过经

    oldfatcrab
    1451
    2
    先吐槽一下。。。我这双擤鼻涕用的眼睛。。。每次都把上面的“猎头”看成“猪头”。。。

    电话面试理论时长1小时,其实50分钟

    本来该show up的是一个烙印,可能一下抽不开身临时找了另外一个印度小哥来面(所以电话打进来已经迟了5分多钟),这个印度小哥完全没有印度口音(我的印度口音可能都比这个印度小哥要重,没办法以前在三哥圈里混的还不错),后来看LinkedIn应该就是湾区长大的ABI,非常nice一个面试官吧,谆谆善诱不断鼓励的那种,我也是非常狗屎运了。。。

    anyway进入正式的面试过程:

    本帖隐藏的内容需要论坛积分高于188才可浏览
    点击前往一亩三分地论坛查看 >>


    两天后HR发来邮件安排onsite行程。。。

    照例贴一下我自己总结的复习资料吧,基本也就过了一遍,题目太多也就没再去划重点了,大家凑合看:



    • 进来一个矩阵的数字,找出所有的重复数字。

    • BQ: how to calculate the risk of your project? deadline快到了,项目还有一堆todo,怎么办?+ 给一个partially sorted array, 判断是否能做一次swap变成有序(返回1),或者一次翻转子array变成有序(返回2),如果不能就返回0。

    • Intro + concept + Resume/project + OOD: tracking design, BQ: miss deadline

    • Meeting Room II + Symmetric Tree

    • Word Break

    • merge two sorted array + return top k elements, BQ: proud project + learn new skill during a project

    • reverse linked list + find pair add up to x in bst + BQ: unclear requirement.

    • BQ + Find sibling of node in a binary tree

    • 螺旋打印矩阵的那道

    • K Closest Points to Origin

    • LRU cache + BQ: disambiguate

    • OOP design. 设计linux find function

    • LRU + Design system find friends

    • Intro + Binary Tree Right Side View + Find K Pairs With Smallest Sums

    • Restore g/ Validate gIP address

    • Concatenated Words + Word Break II

    • round robin scheduling () ,已知CPU的slot time,和每个task的execution time,使用round robin的算法把所有的task跑完,follow-up把arrival time, turn around time打印出来

    • Find length of longest subsequence of one string which is substring of another string (geeksforgeeks.org)

    • BQ: conflict with superior + Spiral Matrix g(with variation)

    • BQ: Most challenging + 大概意思就是公司员工要找车位,然后两两可以组成一个pair, 组成pair的要求是员工A要从parking spot (a -> b), 员工B要从parking spot(b -> a). 要设计一个api, 能够找出所有的pair。 我设计的input就是 a list of employees, output就是a list of string array, string array contains 2 elements which are the names of the two employees in a pair. 感觉算法部分不是很常规,要clarify是不是找出一个合理的解就行了还是要找所有可能的pair, 如果最后没有形成pair的employee要怎么处理。还有要注意design上很多细节的东西。

    • BQ: Most challenging / accomplishment + 输入一个数组A, 输入一个数组B, 将B内元素按照A进行排序, A 中不包括的使用原来的序列。

    • BQ + Merge Intervals

    • Intersection of Two Arrays + Find Union and Intersection of two unsorted arrays

    • BQ: Amazon always based on customer experience, do you have this experience? How to persuade your coworkers to implement your suggestions? What’s the most challenge thing in your work? how to improve your system? What do you learn from your work? + Find the Celebrity (要clarify)

    • Valid Sudoku + Find peak + design action bidding system,怎么存数据

    • Previous project + Merge 2 Sorted Array + Valid Parentheses

    • Same Tree + Robber

    • Implement Trie

    • BQ: Difficulty? Solve problem for customer? + Divide Two Integers

    • BQ: Why Amazon? Proud project? + Sliding Window Median

    • BQ: Most challenge? Miss deadline? + OOD 设计一个locker & package pickup系统 系统必须可以用包裹id去知道在哪个locker 还要可以检查出哪些locker 是空的 (每个locker跟包裹之间还有尺寸的限制)

    • BST Node Distance + Longest Path on the Tree

    • Intro + Project + Restore IP Address + Concatenated Words

    • BQ: Most challenge? Manage change way of working? + Sort an array according to the order defined by another array (geeksforgeeks.org)

    • BQ: Introduction + Proud project + extra-cirricular thing + persuade manager + deadline + miss deadline? Valid Anagram

    • OOD: Shuffle Poker (Shuffle an Array, from random import shuffle)

    • BQ + Number of Islands

    • BQ + Coin Change g(variation: output coin values)

    • BQ: Why Amazon? How meet deadline? Most innovative in project? + Word Break

    • Find the missing number in Arithmetic Progression (geeksforgeeks.org)

    • BQ: Conflicts with colleagues? unexpected obstacle? Two Sum in BST

    • BQ + Data Structure (BST vs Hashtable) + Unique Path II

    • BQ Projects + dig deep and find solution, result + simplify a complex problem + how to keep up-to-date in tech, 2nd Largest Int in Array + this a file, sum up all integers in each line, there are other letters, should skip.

    • BQ + Implement HashMap

    • BQ + N-Queens

    • BQ + Find duplicate number + K-closest Point

    • K-smallest in BST + 给定一个排序好的一个长度为n的数组,数组从1开始增,每次增加1,现在假设这个数组里有个数是重复了,也就是说a[n-1] = n-1,请找出这个重复数,算是一个简单的二分法吧,logn的做法可以找到。

    • Resume + BQ + Search 2D array

    • Number of Islands g(redefined connection)

    • BQ: intro + most challenge + Group Anagrams

    • BQ + Log Sorting + Two-Sum Closest to Target

    • BQ + Two Sum Unique Pairs + Alien Dictionary



    热带雨林BQ总结传送门:1point3acres.com

    从上面来看我觉得问的比较多的是most challenging/proud project,miss deadline,why Amazon,conflict with colleagues

    最后,音乐转专业混码农不易,求米求祝福,也祝大家找工顺利
    2条回复
    热度排序

    发表回复