面试准备
文章平均质量分 57
议题一玩到
硅谷码农
展开
-
#LeetCode#SubSets & SubSetsII
Subsets:Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.原创 2014-09-24 16:46:49 · 939 阅读 · 0 评论 -
#面经准备#RSA EMC
下周有RSA的面试, 发现几个面经,总结一下。What kind of security tests can be performed for a web application? how to come up a idea to make a JVM machine runs faster? -------------------------原创 2015-06-06 04:43:53 · 814 阅读 · 0 评论 -
#leetcode#Text Justification
L家高频题....毫无头绪, 学习了code ganker大神的解法,做了适当注释package TextJustification;import java.util.*;public class Solution { public ArrayList fullJustify(String[] words, int L) { ArrayList res = new ArrayL原创 2015-06-11 09:12:15 · 559 阅读 · 0 评论 -
#L面经#同主题阅读:L面经
original link: http://www.mitbbs.com/article_t/JobHunting/32742215.html转载 2014-07-28 07:43:43 · 1710 阅读 · 0 评论 -
#OOD#Parking Lot停车场设计
http://www.delbertbao.net/2011/12/06/object-oriented-design-part-1/http://stackoverflow.com/questions/764933/amazon-interview-question-design-an-oo-parking-lot原创 2015-01-30 09:58:01 · 8918 阅读 · 0 评论 -
#Google面经#
原链接: http://www.mitbbs.com/article_t/JobHunting/33218429.htmlGoogle电面:LC 340Onsite:很诡异的onsite1. 印度。给一个xxx{xxx}xxx{xx}字符串,括号里面每次只能选一个字符,要求给出所有可能组合。貌似不难,但是代码量很大,写的很屎。2. 老中。先一个detect转载 2016-09-03 08:10:14 · 670 阅读 · 0 评论 -
#leetcode#38. Count and Say
The count-and-say sequence is the sequence of integers with the first five terms as following:1. 12. 113. 214. 12115. 1112211 is read off as "one 1" or 11.11 is read o原创 2017-06-14 16:07:12 · 459 阅读 · 0 评论 -
#leetcode#Ugly Numbers 2
Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first原创 2017-06-10 15:12:52 · 323 阅读 · 0 评论 -
#leetcode#500 Keyboard Row
Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below.Example 1:Input: ["Hello", "Alaska", "Da原创 2017-06-11 11:13:55 · 316 阅读 · 0 评论 -
#leetcode#547. Friend Circles
There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of C, the原创 2017-06-14 15:29:28 · 521 阅读 · 0 评论 -
#leetcode#130. Surrounded Regions
iven a 2D board containing'X'and'O'(theletterO), capture all regions surrounded by'X'.A region is captured by flipping all'O's into'X's in that surrounded region.For example,X X X原创 2017-08-21 09:12:05 · 354 阅读 · 1 评论 -
#Company List#Startup
【 以下文字转载自 JobHunting 讨论区 】发信人: myukulele (ukulele), 信区: JobHunting标 题: 再分享两个startup list发信站: BBS 未名空间站 (Wed Feb 18 00:48:54 2015, 美东)http://sharespost.com/sharespost-100/list/https://equi转载 2015-06-05 01:35:47 · 519 阅读 · 0 评论 -
#面试准备#算法笔记
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/Index of /teaching/algorithms/notesParent Directory0-cover.pdf00-intro.pdf01-recursion.pdf02-fft.pdf03-backtracking.pdf04-fastexpo.pd转载 2015-06-05 01:55:09 · 676 阅读 · 0 评论 -
#面试准备#Bug Free
【 以下文字转载自 JobHunting 讨论区 】发信人: DAOLAIAMENG (熊熊), 信区: JobHunting标 题: interview心得:我是如何做到bug free的发信站: BBS 未名空间站 (Sat Oct 25 16:53:23 2014, 美东)看到版上很多水平不错的同胞,经常因为一些bug而没拿到offer,非常可惜。分享一下,如何转载 2015-06-05 01:36:36 · 940 阅读 · 0 评论 -
[bit manipulation] 关于位操作的一些博客
参加了meetqun的leetcode刷题活动,原创 2014-09-27 06:13:45 · 1171 阅读 · 0 评论 -
#F面经#f design question 总结
这里原帖地址: http://www.mitbbs.com/article_t/JobHunting/32492515.html以下为转载内容===========================我是分割线==================稍微总结一下1. 入门级的news feedhttp://www.quora.com/What-are-best-prac转载 2014-07-28 07:21:42 · 960 阅读 · 0 评论 -
#综合面经#同主题阅读:四个月骑驴找马终于结束,发面经回馈本版
http://www.mitbbs.com/article_t1/JobHunting/32824165_0_1.html从7月份到现在,磕磕盼盼终于拿到了FB的offer,准备从了。就此做个总结,希望能对还在找工作的朋友们有所帮助...准备: lc(没刷完,但是有些高频题做了好几遍,还有水中的鱼的博客),cc150(先刷了一遍,然后又看了好几遍,反复看了书中的一些不错转载 2015-01-11 16:09:18 · 1500 阅读 · 0 评论 -
#面试准备#Behavior Question
原帖链接: http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=106072&extra=page%3D1%26filter%3Dsortid%26sortid%3D192%26sortid%3D192 Emmon1990 发表于 2014-10-11 01:57:03 | 只看该作者转载 2015-01-06 03:51:20 · 1893 阅读 · 0 评论 -
#面试准备#System Design
原帖地址:http://www.mitbbs.com/article_t1/JobHunting/32777529_0_1.html发信人: flamingos (flamingos), 信区: JobHunting标 题: 我的System Design总结发信站: BBS 未名空间站 (Mon Sep 8 02:49:55 2014, 美东)我的面试也结束了 因转载 2015-01-06 03:43:55 · 1689 阅读 · 0 评论 -
#面试准备# 8个月从CS菜鸟到拿到Google Offer的经历+内推
8个月从CS菜鸟到拿到Google Offer的经历+内推http://blog.csdn.net/fightforyourdream/article/details/17094127http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=77453&page=1&authorid=103773投了肯定有10转载 2015-01-06 07:12:09 · 1787 阅读 · 0 评论 -
#leetcode#HouseRobber
House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is tha原创 2015-04-30 16:19:50 · 413 阅读 · 0 评论 -
#leetcode#Isomorphic Strings
Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with anot原创 2015-05-04 23:27:07 · 628 阅读 · 0 评论 -
#leetcode# Sort Colors
http://blog.csdn.net/linhuanmars/article/details/24286349Code ganker大神的第二种思路是怎么想到的?...原创 2015-05-28 11:25:04 · 662 阅读 · 0 评论 -
#note#Cracking the coding interview
Big O analysis of recursion: Try to remember this pattern. When you have a recursive function that makes multiple calls, the runtime will often (but not always) look like O(branche's depth), wher...原创 2019-01-09 07:55:59 · 167 阅读 · 0 评论