m***i
发帖数: 2480 | 1 you need to assume L >> the length of one word.
assume the previous i-1 lines are already good. to process line i, find the
i*L + i-1 character,
+ if the character is a space, replace it with "line break"
+ otherwise, find the first space before the character (say it is at
position x), replace the space with "line break" and insert i*L + i-1 - x
spaces into line i. This is basically changing a number of space character
to two spaces.
Not sure how to deal with the last line. |
|
x***n
发帖数: 70 | 2 第二题用栈来解决好像很容易。不过可能跟上面说的递归的算法是一样的。
public class patternMatch {
static java.util.Stack stackS = new java.util.Stack
>();
static java.util.Stack stackP = new java.util.Stack
>();
static void initStack( char [] s, char [] p ) {
for( char s1 : s ) {
stackS.add(s1);
}
for( char p1 : p ) {
stackP.add(p1);
}
}
static boolean is_match_stack( char [] s, char [] p) {
while( (!stackS... 阅读全帖 |
|
x***n
发帖数: 70 | 3 第二题用栈来解决好像很容易。不过可能跟上面说的递归的算法是一样的。
public class patternMatch {
static java.util.Stack stackS = new java.util.Stack
>();
static java.util.Stack stackP = new java.util.Stack
>();
static void initStack( char [] s, char [] p ) {
for( char s1 : s ) {
stackS.add(s1);
}
for( char p1 : p ) {
stackP.add(p1);
}
}
static boolean is_match_stack( char [] s, char [] p) {
while( (!stackS... 阅读全帖 |
|
D********g
发帖数: 650 | 4 面经回馈本版，只列出technical question.
P1:
A. Add next pointer to each node on a BTree to its next sibling on the same
level.
B. Boggle题，find all possible words from a 2D character array.
P2:
A. Given
interface Iterator {
T next();
boolean hasNext();
}
interface Predicate {
boolean accept(T t);
}
Implement a method that creates an "accept" iterator that returns items
accepted by the passedin pred variable.
Iterator conditionIterator(Iterator input, Predicate pred) {
}
B. Concurren... 阅读全帖 |
|
p*******m
发帖数: 47 | 5 我5月初要去Twitter onsite，面的是 Trust & Safety team
2轮电面都比较简单，2个engineers都很nice.
但听说onsite 难度会明显加大, 而且我网上能搜到的它家的题目不多，特别是onsite,
所以心里没底，来版上求经验。
希望有面试经验的同学能和我分享, 如果不方便帖出来，你也可以我站内发信或者
email: d********[email protected]
这是recruiter给我的schedule:
11:30am 去公司签到, 然后面7个人, 其中有个 team Product Manager。每轮45min,
第1轮是 lunch interview,
7轮分别有coding, Ph.D. research presentation, large-scale system design (这
个是open question)
下面是我搜集到的Twitter的题目，有些版上有过了，给后来的同学作参考。
如果你们有新的题, 也可以回在下面.
希望版上它家的信息能多些
++++++++++++++++++++++++++++++++++++... 阅读全帖 |
|
L**********g
发帖数: 15 | 6 找工总算告一段落了，从精华版中获得不少帮助，也想把自己的经验教训与大家分享一
下。
背景
如果不算实习，我有国内两年这里一年工作经验 ＋ master。毕业工作后，在组里越做
越没劲，遂开始准备跳槽。
准备
我前后断断续续共准备了4个月吧，也走了些弯路。最初，我粗略地过了一下
programming interview exposed，CLRS。话说CLRS真是精髓，值得一读再读。然后，
我就开始零零散散地做一些题目，从 careercup，glassdoor，code jam上找些题目来
写。后来，我才发现了mit这个版和leetcode，其中题目的质量和针对性都高很多，后
悔没有早点知道。
面试
1. G
这是我最后悔的一次了。。。当时准备的很不充分，有recuriter来搭讪，就apply了，
结果是电面就挂了。题目是实现大整数的乘法和加法，我虽然最后实现了，但是用了不
必要的递归，思路也有点混乱，于是挂掉。
2. L
在g悲剧之后，奋发了一阵，经朋友推荐，拿到了他家的电面。总共两轮电面 ＋
onsite （5面），还记得的题目有：
1. two sum
2. design to... 阅读全帖 |
|
h****n
发帖数: 1093 | 7 1. Question:
String s is called unique if all the characters of s are different.
String s2 is producible from string s1, if we can remove some characters of
s1 to obtain s2.
String s1 is more beautiful than string s2 if length of s1 is more than
length of s2 or they have equal length and s1 is lexicographically greater
than s2.
Given a string s you have to find the most beautiful unique string that is
producible from s.
Input:
First line of input comes a string s having no more than 1,000,000(10... 阅读全帖 |
|
h****n
发帖数: 1093 | 8 1. Question:
String s is called unique if all the characters of s are different.
String s2 is producible from string s1, if we can remove some characters of
s1 to obtain s2.
String s1 is more beautiful than string s2 if length of s1 is more than
length of s2 or they have equal length and s1 is lexicographically greater
than s2.
Given a string s you have to find the most beautiful unique string that is
producible from s.
Input:
First line of input comes a string s having no more than 1,000,000(10... 阅读全帖 |
|
R**y
发帖数: 72 | 9 题目如下，要求recursive 和 non recursive解法
write a program that given a 7 digit telephone number, could print all
possible combinations of letters that each number could represent.
second part: if the telephone number changes to 12 digits one
recursive 解法很清晰，建立一个字典，然后递归就好了。
iterative 解法，我就卡住了，google了一下，有一个解法如下:
private static ArrayList processOneNumber(ArrayList input, int[] phoneNum,
int currentNum) {
ArrayList output = new ArrayList();
int numberToProcess = phoneNum[currentNum];
char c;
... 阅读全帖 |
|
b*******d
发帖数: 750 | 10
maybe I'm wrong, but what about:
1xxxxxxx 1xxxxxxx 1xxxxxxx 0xxxxxxx
odd number of "1", but the last character is a 2-byte character.
1xxxxxxx 0xxxxxxx 1xxxxxxx 0xxxxxxx
even number of "1", but the last character is still a 2-byte character. |
|
s********x
发帖数: 914 | 11 Time Limit Exceeded了
但感觉已经cache了intermediate result了
是不是这题assume只是26个小写英文字母呢，如果是的话，用array就更快？
贴一下code
class AnagramString {
boolean visited;
String str;
private Map map = null;
AnagramString(String s) {
this.str = s;
}
boolean isAnagram(String s) {
if (this.map == null) {
this.map = new HashMap(this.str.length());
for (int i = 0; i < this.str.length(); i++) {
char c =... 阅读全帖 |
|
p*********j
发帖数: 47 | 12 输入一个字符串，返回所有字串，即"abc" -> {"a", "b", "c", "ab", "bc", "abc"}
。觉得写的好烂，大神们给提提意见，多谢！
public static ArrayList combinationsString(String s) {
ArrayList res = new ArrayList();
for (int i = 1; i <= s.length(); i++) {
dfs(s, 0, i, res);
}
return res;
}
private static void dfs(String s, int start, int resLength, ArrayList<
Character> res) {
if (resLength == 0) {
System.out.println(res.toString());
... 阅读全帖 |
|
v****a
发帖数: 236 | 13 public static boolean isIsomorphic(String inputString1, String inputString2)
{
int length1 = inputString1.length();
int length2 = inputString2.length();
if (length1 != length2) {
return false;
}
if (length1 == 1) {
return true;
}
Map map = new HashMap();
for (int i = 0; i < length1; i++) {
if (!map.containsKey(inputString1.charAt(i)) && !map.
containsVal... 阅读全帖 |
|
S*******C
发帖数: 822 | 14 private static final Map map = new HashMap<
Character, Character>(){
private static final long serialVersionUID = 839632L;
{
put('(',')');
put('{','}');
put('[',']');
}
}; |
|
S***w
发帖数: 1014 | 15 题目好难
dfs暴力试吧
boolean dfs(String s, String p, Map s_to_p, Map
, String> p_to_s) {
if (s.isEmpty() && p.isEmpty()) return true;
if (s.isEmpty() || p.isEmpty()) return false;
for(int i = 2; i <= s.length(); ++i) {
String pre = s.substring(0, i);
if (s_to_p.containsKey(pre)) {
if (s_to_p.get(pre) == p.charAt(0) &&
dfs(s.substring(i), p.substring(1), s_to_p, p_to_s))
return true;
}
else if (p_to_s.containsK... 阅读全帖 |
|
S***w
发帖数: 1014 | 16 题目好难
dfs暴力试吧
boolean dfs(String s, String p, Map s_to_p, Map
, String> p_to_s) {
if (s.isEmpty() && p.isEmpty()) return true;
if (s.isEmpty() || p.isEmpty()) return false;
for(int i = 2; i <= s.length(); ++i) {
String pre = s.substring(0, i);
if (s_to_p.containsKey(pre)) {
if (s_to_p.get(pre) == p.charAt(0) &&
dfs(s.substring(i), p.substring(1), s_to_p, p_to_s))
return true;
}
else if (p_to_s.containsK... 阅读全帖 |
|
b**********5
发帖数: 7881 | 17 在说说最后一道题吧
给一个dictionary， 里面a list of words， 比如 “abcd“， ”abe", "bbc", "
bdcea"
从这个dictionary里， 给一个random word
怎么random么？
从这个字典里， 你可以看到：
第一个letter， 是“a”， 有多少probability， 是“b“， 有多少probability
then if u pick "a", "b" follow "a" with certain probabilty. if u pick "b",
"b" follow "b" with certain probability...
所以implement getRandomWord时， 先generate a random number between 0 and 1，
然后看第一个letter，“a“ 为first letter的probability是30%， 如果generate
为 0-0.3的时候， 就pick ”a”。 如果“b”的probability为60%， 那么generate
为0.3... 阅读全帖 |
|
k**********i
发帖数: 36 | 18 ►►►Regular Expression Matching
Implement regular expression matching with support for '.' and '*'.
'.' Matches any single character.
'*' Matches zero or more of the preceding element.
The matching should cover the entire input string (not partial).
The function prototype should be:
bool isMatch(const char *s, const char *p)
Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa", "a*") → true
isMatch("aa", ".*") → true
isMatch... 阅读全帖 |
|
h****3
发帖数: 89 | 19 public static String bestTime(String tasks, int cooldown){
if(tasks==null || tasks.length()==0 || cooldown<0){
throw new IllegalArgumentException("input not valid");
}
int waitTime = cooldown;
int curRep =0;
StringBuilder res = new StringBuilder();
Stack stack = new Stack();
HashMap map = new HashMap();
PriorityQueue pq = new PriorityQueue(11, new Comparator<... 阅读全帖 |
|
b**********5
发帖数: 7881 | 20 是不是这个？
public boolean isPalindrome(String s) {
int n = s.length();
int i=0; int j = n-1;
while (i <= j) {
while (i < j && !Character.isLetterOrDigit(s.charAt(i)))
i++;
while (i < j && !Character.isLetterOrDigit(s.charAt(j)))
j--;
if (i <= j && Character.toLowerCase(s.charAt(i)) == Character.
toLowerCase(s.charAt(j)))
i++; j--;
else
return false;
}
return true;
} |
|
S*******C
发帖数: 822 | 21 这题用递归即使只传下标也不能通过长String的oj
有没有什么改进方法
我这种写法应该是O(N) time, O(N) space的吧
Runtime Error Message: Line 12: java.lang.StackOverflowError
public boolean isPalindrome(String s) {
if (s == null || s.length() < 2)
return true;
if(!rec(s, 0, s.length() - 1))
return false;
return true;
}
private boolean rec(String s, int start, int end){
if(start >= end)
return true;
if (!Character.isLetterOrDigit(s.charAt(start)))
... 阅读全帖 |
|
S*******C
发帖数: 822 | 22 你的答案质量稍稍有待提高，FB对答案质量要求很高的。
我给你看个最优解
public boolean isPalindrome2(String s) {
if (s == null || s.length() < 2)
return true;
int start = 0, end = s.length() - 1;
while (start < end) {
while (start < end && !Character.isLetterOrDigit(s.charAt(start)
))
start++;
while (start < end && !Character.isLetterOrDigit(s.charAt(end)))
end--;
if (Character.toLowerCase(s.charAt(start++)) != Character.
to... 阅读全帖 |
|
S*******C
发帖数: 822 | 23 这个答案是对的，也能通过OJ
但改成JAVA版就是不能过大的test case
public boolean isPalindrome(String s) {
if (s == null || s.length() < 2)
return true;
return rec(s, 0, s.length() - 1);
}
private boolean rec(String s, int start, int end){
if(start >= end)
return true;
while (start < end && !Character.isLetterOrDigit(s.charAt(start)))
start++;
while (start < end && !Character.isLetterOrDigit(s.charAt(end)))
end--;
r... 阅读全帖 |
|
b******n
发帖数: 1629 | 24 版上看了些面经，至少把airbnb的电话面试题都给看到了，虽然最后把airbnb的onsite
推掉了，但电面直接碰上原题的感觉真的好tmd有成就感。最后回馈一下版面。
整体感觉，国人面试官真的都非常的nice，老外大部分也都很nice，甚至碰到的三哥三
妹都很nice，没有感觉恶的。个人感觉面试的时候还是要多说话，不要让面试官说话，
更加不要让面试冷场，这个还是挺重要的，否则面试官一尴尬，直接就觉得没有
chemistry，反馈不可能很好。
我自己由于刷题刷得太烂，根本不想刷，看着就烦，只是把ccr和leetcode答案给看了
几遍，一遍都没写过，别的网站看都没看。所以可能不适用刷题刷的nb的同志们。基本
每家公司每道题都有时间复杂度分析，建议注意。
airbnb电面两轮，一个是house robber，一个是csv parser。
fb电面也是两轮，一个maximum continuous sum for an array, career cup面经原题
，一个是简单的trie，还有一个是n个元素中求包含k个元素的组合，dfs做，follow up
提高performance，被国... 阅读全帖 |
|
s*******s
发帖数: 9926 | 25 大家不要觉得今天不是发生在我这里, 发生在加州就觉得无所谓, 不关我的事, 海外中
国人应该团结一致, 才能对抗种族歧视, 一起行动, 大家应该要效法犹太人团结的精神
, 怎么样对抗SCA-5种族歧视呢? 下面有教你要怎样做的方法.
本文的网路版本在这里: http://nosca5.blogspot.com/2014/02/sca5.html
反对SCA-5具体有效的步骤, 请转发
从我做起, 从现在做起! 我们还来得及反对SCA5. 目前, 加州众议院的80席中, 有55席
民主党, 25席共和党. 对这个法案SCA5的支持是党派分票, 所以我们只需要保证 2个以
上民主党议员勇敢地站出来, 投票反对, 我们就可以让法案胎死腹中. 现在我们可以做
的是写信给代表我们选区的加州众议员, 去他们的网站给他们写.
Step 1: 下面网站里选Act Now有两个请愿投票, 有时间先去投票, 这样才能壮大声势.
这两个网站都需要注册, 但是Change.org和Whitehouse.gov是最常见的请愿网站, 将
来一定该还有用到的机会, 花点时间注册并不吃亏.
http://www.sa... 阅读全帖 |
|
S******6
发帖数: 3138 | 26 说的不错,但是 Integrity and character 两个都是没有定格的东西,如何才叫培养?
如果是按照你的标准, 那么也只是你认可的 Integrity and Character 而已; 如果是
按照社会公认的标准, 这样培养出来的恐怕更容易成为一个循规蹈矩,没有性格的人.
我对小孩的培养,永远是独立正确客观思考的能力。就像现在看着宝宝一天天学习运动
技能和用眼，手，嘴不断探索未知一样，我希望她永远不停止这样的探索，即使是
Integrity and Character, 也希望她是通过自己的寻求认识的结果，而不是在某些车
间里定制的某种产品。
在我个人自己成长的不同时期，我曾有过很不相同的性格，理念，风格，许多和我的父
母没有任何关系。父母曾经教育我的东西，长大后对我影响最大的只有两句话：遇事情
多动脑子，别跟别人混；人活一辈子起码做个对社会有用的人。
character. |
|
s*******s
发帖数: 9926 | 27 大家不要觉得今天不是发生在我这里, 发生在加州就觉得无所谓, 不关我的事, 海外中
国人应该团结一致, 才能对抗种族歧视, 一起行动, 大家应该要效法犹太人团结的精神
, 怎么样对抗SCA-5种族歧视呢? 下面有教你要怎样做的方法.
本文的网路版本在这里: http://nosca5.blogspot.com/2014/02/sca5.html
反对SCA-5具体有效的步骤, 请转发
从我做起, 从现在做起! 我们还来得及反对SCA5. 目前, 加州众议院的80席中, 有55席
民主党, 25席共和党. 对这个法案SCA5的支持是党派分票, 所以我们只需要保证 2个以
上民主党议员勇敢地站出来, 投票反对, 我们就可以让法案胎死腹中. 现在我们可以做
的是写信给代表我们选区的加州众议员, 去他们的网站给他们写.
Step 1: 下面网站里选Act Now有两个请愿投票, 有时间先去投票, 这样才能壮大声势.
这两个网站都需要注册, 但是Change.org和Whitehouse.gov是最常见的请愿网站, 将
来一定该还有用到的机会, 花点时间注册并不吃亏.
http://www.sa... 阅读全帖 |
|
w*********o
发帖数: 3030 | 28 Your child so called "chinese name" in pinying is not really chinese name
either. They are just Chinese characters translated by pronunciation. All
the meanings behind are as much lost as a common English name to anybody
else other than your family. The translations are even different for old
Cantonese immigrants or immigrants from Taiwan for a lot of the same
characters. I don't think even chinese around you in daily life would give a
damn about what chinese characters your name are other than... 阅读全帖 |
|
C***t
发帖数: 10731 | 29 周六第一次玩(多谢jansen/terry带来的牌) 和以前在BGG看的印象差不多 策略性适中
比一般的party game(杀人狼人之类)强 比主流桌游弱 基本和卡坦卡卡三国杀等入门游
戏的水平差不多 趣味性强 适合多人玩 某人赶紧买吧:D
刚查了一下官方英文规则 玩错了不少地方(盗版还是有缺点阿)
1. 角色分配时 除了一开始去掉一个暗角色 还要翻明牌 比如5个人玩 就是全掉1个暗
的 然后马上翻1个明的(若国王翻明则换1张) 剩下6张牌才从国王开始选 这样每轮都有
人选国王的机会加大 而且所有人都知道1张明牌 信息更平均
Step One: Remove Characters: Draw a random character card and place it face
down in the middle of the table without looking at it.
Then draw character cards based on the number of players (4 players = 2
cards, 5 players = 1 card, 6 p... 阅读全帖 |
|
s*******s
发帖数: 9926 | 30 本文的网路版本在这里: http://nosca5.blogspot.com/2014/02/sca5.html
反对SCA5, 不要浪费时间, 要这样做才有帮助, 请转发
从我做起, 从现在做起! 我们还来得及反对SCA5. 目前, 加州众议院的80席中, 有55席
民主党, 25席共和党. 对这个法案SCA5的支持是党派分票, 所以我们只需要保证 2个以
上民主党议员勇敢地站出来, 投票反对, 我们就可以让法案胎死腹中. 现在我们可以做
的是写信给代表我们选区的加州众议员, 去他们的网站给他们写.
Step 1: 下面网站里选Act Now有两个请愿投票, 有时间先去投票, 这样才能壮大声势.
这两个网站都需要注册, 但是Change.org和Whitehouse.gov是最常见的请愿网站, 将
来一定该还有用到的机会, 花点时间注册并不吃亏.
http://www.saynosca5.com/
美亚团结促进会的United Against SCA5 - Please click here to sign letter to
contact your elected represe... 阅读全帖 |
|
h**g
发帖数: 147 | 31 【 以下文字转载自 WaterWorld 讨论区 】
发信人: aspec (3 dollar bill), 信区: WaterWorld
标 题: 最后一贴, aspec最后的serious nonsense
发信站: BBS 未名空间站 (Fri Jun 3 04:12:37 2011, 美东)
没有完全疯掉算走运了
I'm retiring this aspec character for good before I go crazy, seriously.
Pretending to be a maniac to get your creative juices flowing is the worst
possible idea and experience, ever. Fellow wrights please take note and don'
t ever attempt this without supervision.
I never really meant to hurt anyone's feelings and I am very sorry fro... 阅读全帖 |
|
s*******s
发帖数: 9926 | 32 本文的网路版本在这里: http://nosca5.blogspot.com/2014/02/sca5.html
反对SCA5, 不要浪费时间, 要这样做才有帮助, 请转发
从我做起, 从现在做起! 我们还来得及反对SCA5. 目前, 加州众议院的80席中, 有55席
民主党, 25席共和党. 对这个法案SCA5的支持是党派分票, 所以我们只需要保证 2个以
上民主党议员勇敢地站出来, 投票反对, 我们就可以让法案胎死腹中. 现在我们可以做
的是写信给代表我们选区的加州众议员, 去他们的网站给他们写.
Step 1: 下面网站里选Act Now有两个请愿投票, 有时间先去投票, 这样才能壮大声势.
这两个网站都需要注册, 但是Change.org和Whitehouse.gov是最常见的请愿网站, 将
来一定该还有用到的机会, 花点时间注册并不吃亏.
http://www.saynosca5.com/
美亚团结促进会的United Against SCA5 - Please click here to sign letter to
contact your elected represe... 阅读全帖 |
|
s*******s
发帖数: 9926 | 33 应该是两个 一个sacremento 一个南加
南加那个区是日裔大本营
也算满厉害的 看last name应该看得出来
本文的网路版本在这里: http://nosca5.blogspot.com/2014/02/sca5.html
反对SCA5, 不要浪费时间, 要这样做才有帮助, 请转发
从我做起, 从现在做起! 我们还来得及反对SCA5. 目前, 加州众议院的80席中, 有55席
民主党, 25席共和党. 对这个法案SCA5的支持是党派分票, 所以我们只需要保证 2个以
上民主党议员勇敢地站出来, 投票反对, 我们就可以让法案胎死腹中. 现在我们可以做
的是写信给代表我们选区的加州众议员, 去他们的网站给他们写.
Step 1: 下面网站里选Act Now有两个请愿投票, 有时间先去投票, 这样才能壮大声势.
这两个网站都需要注册, 但是Change.org和Whitehouse.gov是最常见的请愿网站, 将
来一定该还有用到的机会, 花点时间注册并不吃亏.
http://www.saynosca5.com/
美亚团结促进会的United Against SCA5 - Plea... 阅读全帖 |
|
s*******s
发帖数: 9926 | 34 本文的网路版本在这里: http://nosca5.blogspot.com/2014/02/sca5.html
反对SCA5, 不要浪费时间, 要这样做才有帮助, 请转发
从我做起, 从现在做起! 我们还来得及反对SCA5. 目前, 加州众议院的80席中, 有55席
民主党, 25席共和党. 对这个法案SCA5的支持是党派分票, 所以我们只需要保证 2个以
上民主党议员勇敢地站出来, 投票反对, 我们就可以让法案胎死腹中. 现在我们可以做
的是写信给代表我们选区的加州众议员, 去他们的网站给他们写.
Step 1: 下面网站里选Act Now有两个请愿投票, 有时间先去投票, 这样才能壮大声势.
这两个网站都需要注册, 但是Change.org和Whitehouse.gov是最常见的请愿网站, 将
来一定该还有用到的机会, 花点时间注册并不吃亏.
http://www.saynosca5.com/
美亚团结促进会的United Against SCA5 - Please click here to sign letter to
contact your elected represe... 阅读全帖 |
|
s*******s
发帖数: 9926 | 35 本文的网路版本在这里: http://nosca5.blogspot.com/2014/02/sca5.html
反对SCA-5具体有效的步骤, 请转发
从我做起, 从现在做起! 我们还来得及反对SCA5. 目前, 加州众议院的80席中, 有55席
民主党, 25席共和党. 对这个法案SCA5的支持是党派分票, 所以我们只需要保证 2个以
上民主党议员勇敢地站出来, 投票反对, 我们就可以让法案胎死腹中. 现在我们可以做
的是写信给代表我们选区的加州众议员, 去他们的网站给他们写.
Step 1: 下面网站里选Act Now有两个请愿投票, 有时间先去投票, 这样才能壮大声势.
这两个网站都需要注册, 但是Change.org和Whitehouse.gov是最常见的请愿网站, 将
来一定该还有用到的机会, 花点时间注册并不吃亏.
http://www.saynosca5.com/
美亚团结促进会的United Against SCA5 - Please click here to sign letter to
contact your elected representatives选项... 阅读全帖 |
|
c*h
发帖数: 33018 | 36 【 以下文字转载自 JobHunting 讨论区 】
发信人: LeonardoWang (coeus), 信区: JobHunting
标 题: 报一报最近面试流水账
发信站: BBS 未名空间站 (Fri Oct 12 01:43:25 2012, 美东)
找工总算告一段落了，从精华版中获得不少帮助，也想把自己的经验教训与大家分享一
下。
背景
如果不算实习，我有国内两年这里一年工作经验 ＋ master。毕业工作后，在组里越做
越没劲，遂开始准备跳槽。
准备
我前后断断续续共准备了4个月吧，也走了些弯路。最初，我粗略地过了一下
programming interview exposed，CLRS。话说CLRS真是精髓，值得一读再读。然后，
我就开始零零散散地做一些题目，从 careercup，glassdoor，code jam上找些题目来
写。后来，我才发现了mit这个版和leetcode，其中题目的质量和针对性都高很多，后
悔没有早点知道。
面试
1. G
这是我最后悔的一次了。。。当时准备的很不充分，有recuriter来搭讪，就apply了，
结果是电面就挂了。题目是实... 阅读全帖 |
|
a*****0
发帖数: 6788 | 37 http://www.dailybreeze.com/news/ci_15633236
Rather than indulge in teenage angst, Catherine Chen instead poured her
creativity out on paper, doodling comic characters and crafting storylines.
Those secret sketches - drawings she was too shy to even show family members
- have now translated into a published comic strip.
The 17-year-old Rancho Palos Verdes resident has yet to even graduate high
school.
"We didn't even know she had done it," her father, Anthony Chen, said of the
comic.
Catherine de... 阅读全帖 |
|
i********r
发帖数: 1153 | 38 I teach improvisation, and one thing that I've leaned from improv that
carries over nicely to poker has to do with character work. When developing
a character, you have to get inside their head. A character is much more
than an occupation, hobby, voice or posture. The most important thing to
think about is a character's motivation: what that person wants.
In poker, every player has personal motivations. They're more than the hands
they 3bet preflop, their bet sizes, or how well they understand p |
|
k****0
发帖数: 172 | 39 关于有没有隐藏女主这个问题我特意去找了找， 还以为自己忘了
PS2 Shinibi没有隐藏女主
Secret Characters
To unlockk the secret charaters you must collect a certain number of gold
oboro coins:
when you collect 30 coins you unlock the first of the characters who is
Moritsune the main characters brother he is about 2 times as strong as
hotsuma but his sword gauge depletes about twice as fast
The 2nd character you get at 40 gold oboro coins his name is Joe Musashi he
is weaker then hotsuma and his sword doesnt power up as fast either he ... 阅读全帖 |
|
a***e
发帖数: 2094 | 40 难过中 :(
Is that a personality thing? do i have a chacha personality? Each dance has
its character - i can easily (well, comparatively speaking) get into the
character of rumba, paso, samba and jive, but not chacha. Wednesday night,
while practicing my new chacha routine, i taped myself - and was frustrated
to see myself dancing without THE chacha character...
Usually i watch a lot, say paso, to feel the attitude. The emotion from the
dance will affect me such that the character finds its way into |
|
j******n
发帖数: 21641 | 41 【 以下文字转载自 Reader 讨论区 】
发信人: wonderlich (左岸，遁去), 信区: Reader
标 题: Antichrist: A Discussion
发信站: BBS 未名空间站 (Sun Sep 18 03:25:53 2011, 美东)
Antichrist: A Discussion
Posted In Featured,Web Exclusives
Dense, shocking, and thought-provoking, Lars von Trier’s Antichrist is a
film which calls for careful analysis. This web-exclusive exchange between
Film Quarterly editor Rob White and philosopher Nina Power is meant as a
first attempt at the in-depth debate that this major film deserves.
SPOILER WARNING:... 阅读全帖 |
|
w**m
发帖数: 4061 | 42 觉得弗洛伊德的影响力太大了，弄得现在不管是小说还是电影，不管是创作者还是评论
者，一上来都要从精神分析入手
of playing characters who were "weak, culpable, morally indolent,
compromised, and greedy for illicit sensation without losing that basic
probity or potential for ethical character that we require of a hero."[10]
Critic and author Rob Edelman points out similarities in many of Douglas's
roles, writing that in some of his leading films, he personified the "
contemporary, Caucasian middle-to-upper-class American male who fin: ds
himself the br... 阅读全帖 |
|
wh
发帖数: 141625 | 43 对，michael douglas给我印象深的就是第一段说的这些既经受不起女人诱惑又有道德
底线、既暴力又控制的角色，说孬种、猥琐可能不确切，但我找不到更好的说法了。反
正很现代，他爸的时代不流行这样的。
of playing characters who were "weak, culpable, morally indolent,
compromised, and greedy for illicit sensation without losing that basic
probity or potential for ethical character that we require of a hero."[10]
Critic and author Rob Edelman points out similarities in many of Douglas's
roles, writing that in some of his leading films, he personified the "
contemporary, Caucasian middle-to-upp... 阅读全帖 |
|
i*********t
发帖数: 5873 | 44 references。。
发信人: wh (wh), 信区: WebRadio
标 题: Re: 来学习波哥的讲话
发信站: BBS 未名空间站 (Wed Oct 7 14:07:37 2009, 美东)
他说的原文是这篇，很长：
发信人: iamwhatieat (我吃故我在), 信区: Reader
标 题: Fascinating Fascism
发信站: BBS 未名空间站 (Thu Oct 1 02:19:18 2009, 美东)
Fascinating Fascism
by Susan Sontag
New York Review of Books
February 6, 1975
republished in:
Under the Sign of Saturn
(New York, 1980), pp. 73-105.
First Exhibit. Here is a book of 126 splendid color photographs by Leni
Riefenstahl, certainly the most ravishing book of phot... 阅读全帖 |
|
w**a
发帖数: 3510 | 45 继续读amazon review，又有一个读者和我有同感:
Harry Bosch is a disgusting character. He chain smokes. He doesn't shave
regularly. He guzzles beer, spilling it down his chin. He is `wiry' and
wears cheap, crumpled clothing. He sweats profusely. He talks back; he is
insolent, egotistical, and rude. And yet, somehow, beautiful women fall for
him. He treats them like trash, and yet he sleeps with 2 gorgeous women in
the span of only a few days. Yuck! I cannot imagine getting close enough to
him to even think about ... 阅读全帖 |
|
r*s
发帖数: 2555 | 46 Main points:
(1) 十三钗 is not as good as Lu Chuan's Nanjing Nanjing!
(2) If Warner Bros. had made a film with this plot back in 1942, it would
have made effective anti-Japanese propaganda and probably absorbing drama in
the bargain. 十三钗 just plays like hokum。
source: http://www.hollywoodreporter.com/review/flowers-of-war-film-review-christian-bale-272125
It's something you'd think only the crassest of Hollywood producers would
come up with — injecting sex appeal into an event as ghastly at the Nan... 阅读全帖 |
|
G**Y
发帖数: 33224 | 47 Disney's Zootopia: A Pro Gay Parable
http://fiddlingant.blogspot.com/2016/03/disneys-zootopia-pro-ga
Disney's new animated movie Zootopia got some great reviews so I decided to
see it on opening weekend. In our PC world, the reviewers decided to
overlook the obvious message that gays are a persecuted minority who are no
different than anyone else and that those who are concerned with how gays
are perceived as normal in modern society are bad.
This essay has spoilers.
The knee jerk reaction to my... 阅读全帖 |
|
b*****e
发帖数: 14299 | 48
居然有争议说这部自传是虚构的，一大段讨论，自己看吧。
Guy Sajer's book THE FORGOTTEN SOLDIER is rather notorious in the historical
community; the book purports to be the memoirs of an Alsatian who served
with the Division for the last years of the Second World War. Much has been
written on the subject of whether or not the book is a true story or not.
Two articles are presented here, plus an exchange of letters to the editor
to an American military journal. Those curious may wish to obtain a copy of
their own, and to inv... 阅读全帖 |
|
