alittlegeek-CSDN博客

转载 TWITTER SDE 电面面经

在网上看到twitter的招聘信息后直接投了简历。Twitter的效率很高，三天后就收到了邮件，要求进行在线编程测试。测试内容只有两道算法题，要求在一个小时内完成。因为在lintcode 上做过大量类似题目，所以只花了半个小时就完成了这套测试。两天后，接到了twitter的电面电话。面试官主要对简历上的项目进行了简单了解然后进行了算法考察。这一轮整个面试过程一共45分钟。面试中遇到

2017-11-06 23:12:33 341

转载 Lintcode159 Find Minimum in Rotated Sorted Array solution 题解

【题目描述】Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.NoticeYou may assume no duplicate exists in the

2017-11-05 22:31:38 207

转载 Lintcode158 Two Strings Are Anagrams solution 题解

【题目描述】Write a methodanagram(s,t)to decide if two strings are anagrams or not.写出一个函数anagram(s, t)判断两个字符串是否可以通过改变字母的顺序变成一样的字符串。【题目链接】www.lintcode.com/en/problem/two-strings-are-anagrams/【题目解析】可建立一个长度为2

2017-11-04 23:47:06 171

转载 Lintcode157 Unique Characters solution 题解

【题目描述】Implement an algorithm to determine if a string has all unique characters.实现一个算法确定字符串中的字符是否均唯一出现。【题目链接】www.lintcode.com/en/problem/unique-characters/【题目解析】可以用HashMap或者数组来记录字符是否已经出现过，由于本题无须获取重复字

2017-11-02 23:17:31 163

转载 Lintcode156 Merge Intervals solution 题解

【题目描述】Given a collection of intervals, merge all overlapping intervals.给出若干闭合区间，合并所有重叠的部分。【题目链接】www.lintcode.com/en/problem/merge-intervals/【题目解析】此题可先将目标区间数组按X轴从小到大排序。例如：[2,3] [1,2] [3,9] ->[1,2] [2

2017-11-01 15:26:41 238

转载 Lintcode155 Minimum Depth of Binary Tree solution 题解

【题目描述】Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.给定一个二叉树，找出其最小深度。二叉树的最小深度为根节点到最近叶子

2017-10-31 21:37:03 119

转载 Lintcode154 Regular Expression Matching solution 题解

【题目描述】Implement regular expression matching with support for'.'and'*'.'.' Matches any single character. '*' Matches zero or more of the preceding element.The matching should cover theentireinput s

2017-10-30 19:33:11 217

转载 Lintcode153 Combination Sum II solution 题解

【题目描述】Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number inCmay only be used once in the combinatio

2017-10-30 19:32:16 188

转载 GOOGLE SDE 电面面经

我在Google的这次面试持续了一个多月，虽然最后以失败告终，但是客观评价我觉得总体上面试难度不大，面试结束后我的自我感觉还不错，没想到最后挂掉了。可能因为一些其他的因素导致我落选了吧，我很想再打电话过去问问原因。我进行了三轮电话面试，每轮的面试官都会出一道算法题。大部分人的电面都是2轮，但是因为我挂了一轮，HR给我加面了一轮电面。无奈最后还是挂掉了。电面1先是进行了自我介绍，

2017-10-30 19:31:16 853

转载 Lintcode152 Combinations solution 题解

【题目描述】Given two integersnandk, return all possible combinations of k numbers out of 1 ...n.组给出两个整数n和k，返回从1......n中选出的k个数的组合。【题目链接】www.lintcode.com/en/problem/combinations/【题目解析】先枚举第一个数，然后枚举一个比第一个数大的

2017-10-27 23:46:56 160

转载 Lintcode151 Best Time to Buy and Sell Stock III solution 题解

【题目描述】Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find themaximumprofit. You may complete at mosttwotransactions.NoticeYou may not enga

2017-10-26 22:57:58 138

转载 Lintcode150 Best Time to Buy and Sell Stock II solution 题解

【题目描述】Say you have an array for which theith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy

2017-10-25 22:53:44 115

alittlegeek的博客