- 博客(17)
- 收藏
- 关注
转载 Facebook SDE onsite面经
前不久参加了Facebook的SDE面试,很遗憾失败了,不过还是有些经验能分享的。这次面试一共面试了4轮。Onsite1一面还比较顺利,先是让我进行了自我介绍,然后谈了谈之前的项目经历,后面就直接进行coding了。1.电话号码排列 - 给定一个数字字符串,返回数字可能代表的所有可能的字母组合。一面结束随后便被通知可以进行第二轮面试了。Onsite2
2017-05-23 12:37:04
1278
转载 新鲜出炉,Amazon SDE 面经(电面+Onsite)
刚刚参加完Amazon的面试,来写一下自己的面试过程。我申请的是SDE-1的职位。面试流程是2轮电面,4轮Onsite.一开始是电面。第一轮 电面 1翻转字符串 reverse words in a string。LintCode原题:http://www.lintcode.com/en/problem/reverse-words-in-a-string/参考答案:
2017-05-21 10:52:52
10288
1
转载 Lintcode24 LFU Cache solution 题解
【题目描述】LFU (Least Frequently Used) is a famous cache eviction algorithm.For a cache with capacity k, if the cache is full and need to evict a key in it, the key with the lease frequently used wil
2017-04-16 20:52:38
973
转载 Lintcode22 Flatten List solution 题解
【题目描述】Given a list, each element in the list can be a list or integer. flatten it into a simply list with integers.Notice:If the element in the given list is a list, it can contain list to
2017-04-14 19:26:49
429
转载 Lintcode20 Dices Sum solution 题解
【题目描述】Throw n dices, the sum of the dices' faces is S. Given n, find the all possible value of S along with its probability.Notice:You do not care about the accuracy of the result, we will
2017-04-13 13:04:32
739
转载 Lintcode18 Subsets II solution 题解
【题目描述】Given a list of numbers that may has duplicate numbers, return all possible subsetsNotice:Each element in a subset must be in non-descending order.The ordering between two subsets is
2017-04-13 13:01:46
307
转载 Lintcode17 Subsets solution 题解
【题目描述】Given a set of distinct integers, return all possible subsets.Notice:Elements in a subset must be in non-descending order;The solution set must not contain duplicate subsets.给定一个
2017-04-11 11:49:49
227
转载 Lintcode16 Permutations II solution 题解
【题目描述】Given a list of numbers with duplicate number in it. Find all unique permutations.给出一个具有重复数字的列表,找出列表所有不同的排列。【题目链接】http://www.lintcode.com/en/problem/permutations-ii/【题目解析
2017-04-10 17:40:32
322
转载 Lintcode15 Permutations solution 题解
【题目描述】Given a list of numbers, return all possible permutations.Notice:You can assume that there is no duplicate numbers in the list.给定一个数字列表,返回其所有可能的排列。注意:你可以假设没有重复数字。【题目链接】
2017-04-10 17:38:58
350
转载 Lintcode14 First Position of Target Solution 题解
【题目描述】For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity.If the target number does not exist in the array, retu
2017-04-08 19:09:55
392
转载 Lintcode13 strStr solution 题解
【题目描述】For a given source string and a target string, you should output the first index(from 0) of target string in source string.If target does not exist in source, just return -1.对于一个
2017-04-07 16:05:04
298
转载 Lintcode12 Min Stack solution 题解
【题目描述】Implement a stack with min() function, which will return the smallest number in the stack.It should support push, pop and min operation all in O(1) cost.Notice:min operation will
2017-04-07 16:03:44
232
转载 Lintcode11 Search Range in Binary Search Tree solution 题解
【题目描述】Given a string and an offset, rotate string by offset. (rotate from left to right)给定一个字符串和一个偏移量,根据偏移量旋转字符串(从左向右旋转)【题目链接】http://www.lintcode.com/en/problem/rotate-string/
2017-04-05 12:44:20
250
转载 Lintcode9 Fizz Buzz solution 题解
【题目描述】Given number n. Print number from 1 to n. But:when number is divided by 3, print "fizz".when number is divided by 5, print "buzz".when number is divided by both 3 and 5, prin
2017-04-05 12:42:42
261
转载 Lintcode8 Rotate String solution 题解
【题目描述】Given a string and an offset, rotate string by offset. (rotate from left to right)给定一个字符串和一个偏移量,根据偏移量旋转字符串(从左向右旋转)【题目链接】http://www.lintcode.com/en/problem/rotate-string/
2017-04-05 12:41:20
506
转载 Lintcode7 Binary Tree Serialization solution 题解
【题目描述】Merge two given sorted integer array A and B into a new sorted integer array.合并两个排序的整数数组A和B变成一个新的数组。【题目链接】http://www.lintcode.com/en/problem/merge-two-sorted-arrays/【题目
2017-04-02 08:38:50
220
翻译 Lintcode6 Merge Two Sorted Arrays solution 题解
【题目描述】Merge two given sorted integer array A and B into a new sorted integer array.合并两个排序的整数数组A和B变成一个新的数组。【题目链接】http://www.lintcode.com/en/problem/merge-two-sorted-arrays/【题目
2017-04-01 18:51:25
481
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人