面了google/facebook/linkedin/two sigma/aqr/uber, 被uber/aqr据了。基本所有面
过的题：
hedge fund 1:
1. Write a function that takes as input integers P and Q and returns P to
the power of Q. Note any assumptions you make and the complexity of the
algorithm. We expect you to do better than O(Q).
2. Write a function that takes as input an array of 1 million integers,
such that 1 ≤ x ≤ 10 for every element x in the array, and returns the
sorted array. The sort does not need to occur in-place. Obviously you can
just call a standard sorting function like quicksort, but can you do better?
3. You are given an alphanumeric string. Write an algorithm that will
segment the string into substrings of consecutive integers or numbers and
then sort the substrings. For example, the string “AZQF013452BAB” will
result in “AFQZ012345ABB”.
4. Write a function to determine the largest palindromic subsequence of a
string. A palindromic string is a string which is the same when read in
either the forward or reverse direction. For example, “ABBA” is a
palindromic string and the largest palindromic substring of “TABBA” is “
ABBA”.
I did with a double loop solution.
tech company 1:
phone screen:
word ladder (check the leetcode for this question)
onsite:
1. graph deepcopy
2. use normal lock to implement readwrite lock
3. design question, how to scale web application
4. given a list of iterators which iterates over sorted lists, write a
MergeIterator class which iterates over the merged list, e.g.
class MergeIterator<T extends comparable<T>>
{
MergeIterator(List<Iterator<T>> iterators)
{
}
boolean hasNext()
T next();
}
hedge fund 2:
1. friend circles - give a matrix, Y in cell means i and j is friend, N
otherwise, find how many friend circles in the matrix, e.g. 1 is friend of 2
, and 2 is friend of 3, then 1,2,3 is in same friend circle.
2. StringChain, give a dictionary, the string chain is by remove a char in
the string, and if the new string is in the dictionary, then continue, e.g.
dict = { a, b, ab, abc, add} then the longest chain is (a, ab, abc) or (b,
ab, abc). The char can be removed from any place in the string.
online coding:
huffman decoding. give a huffman encoding dictionary, decode a string back.
Onsite:
1. multiply 2 numbers, the digits of the numbers are given as int array, e.g
. int[] product(int[] num1, int[] num2);
2. given a list of intervals, each interval is defined as 2 integer (start/
end), find min set of points, for those points, each interval at least cover
1 point. e.g. given intervals as [1, 4], [2, 3], [5, 6], we just need 2
points, (2, 5), and each interval will either cover piont 2, or point 5.
need O(nlogn) solution.
3. given binary search tree, each tree node contains piont of (left, right,
parent, leftChildTreeSize), write a function to find the number of nodes
which has value less than the given node, e.g.
int findNumberofLess(Node current, Node root);
4. process 2 stream of data and output result, basic merge sort
implementation.
tech company 2:
1. have N offices globally. each office have a local calender with holidays.
you are allowed to move every weekend to different office, how to get max
numbers of holidays. follow up, if for each office, there are only certain
set of offices are reacheable, e.g. if you are in NYC this weekend, you can
move to SF, or London. If you are in SF, you can move to NYC and Beijing,
etc. how to max the holidays.
2. Binary tree find the longest consecutive path.
3. how to check 2 rectangles overlap. Give a very large set of segments (
each segment is defined by start point and end point), given a function
which given 2 segments, returns the intesection of the 2 segment if they
intersect, or null if not. How to find all the intersections, cannot do the
double loop in memory since the dataset is too big to fit in memory.
4. give a string array, find the 2 string which don't share any char, and
have the max product of the lengths. e.g. given string abc, aagh, def, the
max product is len(abc) * len(def) = 3 * 3 = 9
5. design question, how to generate unique sequence number using distributed
system. e.g. you have a set of machines which is running this sequence
number generator, client can connect to any machine, and get the next
sequence number which is guranteed to increment for same client.
tech company 3:
online coding:
1. find kth minimal number in tournament tree. sample of tournament tree (2
beat 4, 3 beat 5, 2 beat 3 and become champion)
2
2 3
4 2, 3, 5
2. word distance, e.g. given an array of words, and give 2 words, find the
min distance of index those 2 words
Onsite:
1. deepIterator, e.g. given list {1, 2, {{3, 5}, 4}, 6}, write an iterator
class which will iterate through the deep list.
2. check whether 2 tree is identical, can you do it iteratively?
3. roman string to int, and int to roman string
4. adding a list of intervals, each interval is defined by start point and
end point, find the total coverage of the intervals, e.g. intervals: { 1, 4}
, {2, 5}, {7, 10}, total coverage is 1 to 5 and 7 to 10, which is 7.
5. design question, design a system which can rank the url sharings, e.g.
users will share urls, we want to rank the most shared urls for the last 10
minutes, for last hour, for last day, etc. there are total 100 millions url
sharing happen every day.
现在two sigma/google 二选一，工资基本一样，组都不错，不知道有没有在那里上班
的可以给点建议。
--
Wednesday, October 14, 2015
Wednesday, September 23, 2015
http://www.mitbbs.com/mitbbs_article_t.php?board=JobHunting&gid=33059349
Pinterest 电面
1. 多叉树的serialize & unserialize
2. 判断一个graph是不是bipartite
Dropbox电面
1. 1) bool match(string pattern, string data)
test case:
pattern = 'abba', data = 'red blue blue red' true
pattern = 'abba', data = 'red blue yellow red' false
pattern = 'aaaa', data = 'red red red red' true
pattern = 'abba', data = red red red red' false
2) followup，remove spaces
pattern = 'abba', data = 'redbluebluered' true
pattern = 'abba', data = 'redblueyellowred' false
pattern = 'aaaa', data = 'redredredred' true
pattern = 'abba', data = redredredred' false
2. 那道很经典的log hitter，版上之前讨论过
Google onsite
1. 类似这道题：
给如下的数据格式：<start_time, end_time, value>
For example,
1, 3, 100
2, 4, 200
5, 6, 300
。。。
这些数据时间点可能有重合。在时间段2~3之间，value的和是100+200 = 300. 找出这
组数据中最高的value和
[consider end points]
2.find k most frequent words from a file
3.brainstorming: 一个上传文件的service，之前正常运转，突然有一天挂了，这期间
没改代码。问怎么排查问题。。
TripAdvisor 电面&onsite
太杂了记不清了，但都是比较基础经典的, 1维DP，位操作什么的。onsite还有很多
behavior questions, 团队协作，敏捷开发什么的。。
再就是一些小公司比较喜欢问sql语句, linux命令，怎么debug啊之类的...
machine learning相关的，频率比较高的是问logistic regression, reservoir
sampling, cross validation，怎么解决overfitting，怎么做feature selection，
ensemble methods，collaborative filtering, IR evaluation metrics这些。
求rp求offer _(:з」∠)_
1. 多叉树的serialize & unserialize
2. 判断一个graph是不是bipartite
Dropbox电面
1. 1) bool match(string pattern, string data)
test case:
pattern = 'abba', data = 'red blue blue red' true
pattern = 'abba', data = 'red blue yellow red' false
pattern = 'aaaa', data = 'red red red red' true
pattern = 'abba', data = red red red red' false
2) followup，remove spaces
pattern = 'abba', data = 'redbluebluered' true
pattern = 'abba', data = 'redblueyellowred' false
pattern = 'aaaa', data = 'redredredred' true
pattern = 'abba', data = redredredred' false
2. 那道很经典的log hitter，版上之前讨论过
Google onsite
1. 类似这道题：
给如下的数据格式：<start_time, end_time, value>
For example,
1, 3, 100
2, 4, 200
5, 6, 300
。。。
这些数据时间点可能有重合。在时间段2~3之间，value的和是100+200 = 300. 找出这
组数据中最高的value和
[consider end points]
2.find k most frequent words from a file
3.brainstorming: 一个上传文件的service，之前正常运转，突然有一天挂了，这期间
没改代码。问怎么排查问题。。
TripAdvisor 电面&onsite
太杂了记不清了，但都是比较基础经典的, 1维DP，位操作什么的。onsite还有很多
behavior questions, 团队协作，敏捷开发什么的。。
再就是一些小公司比较喜欢问sql语句, linux命令，怎么debug啊之类的...
machine learning相关的，频率比较高的是问logistic regression, reservoir
sampling, cross validation，怎么解决overfitting，怎么做feature selection，
ensemble methods，collaborative filtering, IR evaluation metrics这些。
求rp求offer _(:з」∠)_
Wednesday, August 26, 2015
http://www.mitbbs.com/article_t/JobHunting/33037695.html
为了防止违反NDA，就不列出公司名了，就是一些常见公司。
1. Write a iterator to iterate a nested array.
For example, for given array: [1, 2, [3, [4, 5], [6, 7], 8], 9, 10]
call iterator.next() 10 times should return 1,2,3,4,5,6,7,8,9,10.
用了stack存(array, index)的tuple。
2. LeetCode 原题，120 - Triange。有一点变种，给的是一维数组。
3. Implement HashTable 主要看dynamic expanding
4. Implement MaxHeap.
5. Topology sort，就是版上常见的给一些排过序的未知语言的词，求该语言的字母序
。要求实现核心算法。可以给出一些helper function定义不需实现。
6. LeetCode 付费题 157 & 158 - Read N Characters Given Read4()。提供int
read4(char* buf)，实现int read(char* buf, int len)。read4函数读至多4个字符，
除非EOF，并返回实际读到的字符个数。题没有难度要注意一些细节问题。
7. Given an array with length n + 1. The array contains numbers from 1 to n,
with one of the number duplicated. Now find the duplicated number.
讨论各种解法以及时间空间复杂度，最后实现O(N)时间O(1)空间的解法。数组可以
mutate.
8. Given a bag of characters and a dictionary, find longest string that can
be constructed.
9. Given a grid of characters and a dictionary, find all possible words from
grid.
以上两题都用的标准Trie树解法。讨论复杂度，和优化方案。
10. Given a grid with 'o' and 'x'. Find minimum steps from top-left to
bottom-right without touching 'x'.
a) You can only move right or move down. (BFS or DP)
b) You can move in all 4 directions. (BFS)
11. CS basics. Thread & Process, address space, how memory mapped file works
, etc.
同时感谢版上大牛们的内推：mitbbsfanfan, xjm，虽然都没有去成...
最后祝大家找工作顺利！
1. Write a iterator to iterate a nested array.
For example, for given array: [1, 2, [3, [4, 5], [6, 7], 8], 9, 10]
call iterator.next() 10 times should return 1,2,3,4,5,6,7,8,9,10.
用了stack存(array, index)的tuple。
2. LeetCode 原题，120 - Triange。有一点变种，给的是一维数组。
3. Implement HashTable 主要看dynamic expanding
4. Implement MaxHeap.
5. Topology sort，就是版上常见的给一些排过序的未知语言的词，求该语言的字母序
。要求实现核心算法。可以给出一些helper function定义不需实现。
6. LeetCode 付费题 157 & 158 - Read N Characters Given Read4()。提供int
read4(char* buf)，实现int read(char* buf, int len)。read4函数读至多4个字符，
除非EOF，并返回实际读到的字符个数。题没有难度要注意一些细节问题。
7. Given an array with length n + 1. The array contains numbers from 1 to n,
with one of the number duplicated. Now find the duplicated number.
讨论各种解法以及时间空间复杂度，最后实现O(N)时间O(1)空间的解法。数组可以
mutate.
8. Given a bag of characters and a dictionary, find longest string that can
be constructed.
9. Given a grid of characters and a dictionary, find all possible words from
grid.
以上两题都用的标准Trie树解法。讨论复杂度，和优化方案。
10. Given a grid with 'o' and 'x'. Find minimum steps from top-left to
bottom-right without touching 'x'.
a) You can only move right or move down. (BFS or DP)
b) You can move in all 4 directions. (BFS)
11. CS basics. Thread & Process, address space, how memory mapped file works
, etc.
同时感谢版上大牛们的内推：mitbbsfanfan, xjm，虽然都没有去成...
最后祝大家找工作顺利！
Friday, August 21, 2015
http://www.mitbbs.com/article_t/JobHunting/32722633.html
因为之前发过贴，背景就不赘述了，具体说说怎么准备还有面经吧。
骑驴找马，一月底开始刷leetcode，到三月中第一个面试，刷了一遍半吧，明显觉得写
第二遍的时候思路清晰多了，code也比第一遍的简洁。其他的就是每家面试前争对性的
看面经，能看多少是多少，四家只有L面经重复率很高，g家最不能预料题型。后面准备
design的时候都是乱看，一些fb tech talk的视频还有之前有人贴过的fb design的总
结，
但我基础不好，临时抱佛脚感觉也没什么用。面经我就只贴面完有及时记下来的，反正
也给过很多朋友了，就贴上来吧。
已经签了fb，准备八月初start，有同一期的pm我，哈。
脸书:
1. Print all paths of a binary tree
I gave a recursive solution.
Then he wanted to give an iterative way.
2a. Fibonacci (iterative)
2b. Buckets of anagrams
[“cart”,”tarc”, “cat”, “act”, “ract”] -> [[“cart”, “tarc”, “
ract”], [“cat”, “act”]]
onsite design是tiny url, 估计interviewer也知道我没什么经验，问了个最简单的也
没答好。T-T
coding都比较easy。
领英:
1. Return if two strings are isomorphic. (character 1-1 match)
“zoo” -> “fee” ( z->f, o->e) true
“zoo” -> “dui” ( z->d, o->u, o-> ) false
“dui” -> “zoo” (d->z, u->o, i-> ) false
Use two hashmaps
*****************************************************************
2. K nearest points (solution see below) Time: O(nlgk)
*****************************************************************
1. Search in rotated sorted array
*****************************************************************
2. public interface Intervals {
/**
* Adds an interval [from, to] into internal structure.
*/
void addInterval(int from, int to);
/**
* Returns a total length covered by intervals.
* If several intervals intersect, intersection should be counted only
once.
* Example:
*
* addInterval(3, 6)
* addInterval(8, 9)
* addInterval(1, 5)
*
* getTotalCoveredLength() -> 6
* i.e. [1,5] and [3,6] intersect and give a total covered interval [1,6]
* [1,6] and [8,9] don't intersect so total covered length is a sum for
both intervals, that is 6.
*
* 0 1 2 3 4 5 6 7 8 9 10
*/
int getTotalCoveredLength();
}
亚麻:
1a. Given 2 sorted, singly-linked lists, write a function that will merge
them into a new sorted, singly-linked list
Ex.
1->2->4->8->16->32
2->4->6
1->2->2->4->4->6->8->16->32
*****************************************************************
1b. merge n sorted lists
// 1 -> 3,
// 2 -> 5
// 4
newhead: 1 -> 2 -> 3 -> 4 -> 5
*****************************************************************
1c. Given a Binary tree, print path from root to all nodes that are
divisible by 5
Input:
6
/
5 7
/
4 15
/ |
3 10 2 8
Output:
6 5
6 7 4 10
6 7 15
*****************************************************************
2. Given an array A (the array can be treated as a big number) and a number
n, find the biggest number that you can reach to via n swaps. A swap can
only happen in adjacent items. For example, given [1 3 4 2 5 7 9] and n = 1,
the biggest number is [3 1 4 2 5 7 9]
n=1, 3 1 4 2 5 7 9
n=2, 1 3 4 -> 1 4 3 -> 4 1 3
狗家:
1. Reorder List (leetcode)
1->2->3->4->5 => 1->5->2->4->3
*****************************************************************
2. Abbreviation: apple can be abbreviated to 5, a4, 4e, a3e, …
Given a target string (internationalization), and a set of strings,
return the minimal length of abbreviation of this target string so that it
won’t conflict with abbrs of the strings in the set.
“apple”, [“blade”] -> a4 (5 is conflicted with “blade”)
“apple”, [“plain”, “amber”, “blade”] -> ???
Problem changed to:
If given a string and an abbreviation, return if the string matches abbr.
“internationalization”, “i5a11o1” -> true
*****************************************************************
Onsite:
1a. Write a function to get a positive integer n as input and return 0 or 1.
The probability of returning 1 should be 1/(2^n)
1b. Given an array, return the median. (talk about expected time complexity)
2a. Code review - a class which takes a string, split by separators and
return the array of tokens (point out coding problems and indicate how you
will implement it)
2b. Longest consecutive sequence (leetcode) (how do you handle duplicates)
2c. design: how to store files given the file paths and contents. (tree?)
3a. Given an array and a number x, find out how many pairs satisfy (a[i], a[
j]) st. a[i]+a[j] < x
3b. follow up: if we want to find 3 items that adds up to a number < x
3c follow up: if we want to find k items. Time complexity: O(n^(k-1)*lgn)
4. Give a map which has some obstacles in it. Given a starting point S and
ending point E, find the shortest path from S to E. Note that you can go to
any(4) direction from S, but during the process, you can only go straight
from the previous direction, unless you hit an obstacle.
i.e. if you are at (1, 1) and the next (1, 2) is blocked, you can only go to
(2, 1) or (0, 1)
5a. Java “final” keyword
5b. 3-way partition: given an array and number x, reorder the array so that
first part will be < x, middle part is = x, and final part is > x.
5c. Design: given an array of integers and a range (i, j), we want to return
the min item in the range (balanced binary search tree)
5d. System design: given a machine, how to generate id so that they will not
duplicate; if we have multiple machines, what to do
骑驴找马，一月底开始刷leetcode，到三月中第一个面试，刷了一遍半吧，明显觉得写
第二遍的时候思路清晰多了，code也比第一遍的简洁。其他的就是每家面试前争对性的
看面经，能看多少是多少，四家只有L面经重复率很高，g家最不能预料题型。后面准备
design的时候都是乱看，一些fb tech talk的视频还有之前有人贴过的fb design的总
结，
但我基础不好，临时抱佛脚感觉也没什么用。面经我就只贴面完有及时记下来的，反正
也给过很多朋友了，就贴上来吧。
已经签了fb，准备八月初start，有同一期的pm我，哈。
脸书:
1. Print all paths of a binary tree
I gave a recursive solution.
Then he wanted to give an iterative way.
2a. Fibonacci (iterative)
2b. Buckets of anagrams
[“cart”,”tarc”, “cat”, “act”, “ract”] -> [[“cart”, “tarc”, “
ract”], [“cat”, “act”]]
onsite design是tiny url, 估计interviewer也知道我没什么经验，问了个最简单的也
没答好。T-T
coding都比较easy。
领英:
1. Return if two strings are isomorphic. (character 1-1 match)
“zoo” -> “fee” ( z->f, o->e) true
“zoo” -> “dui” ( z->d, o->u, o-> ) false
“dui” -> “zoo” (d->z, u->o, i-> ) false
Use two hashmaps
*****************************************************************
2. K nearest points (solution see below) Time: O(nlgk)
*****************************************************************
1. Search in rotated sorted array
*****************************************************************
2. public interface Intervals {
/**
* Adds an interval [from, to] into internal structure.
*/
void addInterval(int from, int to);
/**
* Returns a total length covered by intervals.
* If several intervals intersect, intersection should be counted only
once.
* Example:
*
* addInterval(3, 6)
* addInterval(8, 9)
* addInterval(1, 5)
*
* getTotalCoveredLength() -> 6
* i.e. [1,5] and [3,6] intersect and give a total covered interval [1,6]
* [1,6] and [8,9] don't intersect so total covered length is a sum for
both intervals, that is 6.
*
* 0 1 2 3 4 5 6 7 8 9 10
*/
int getTotalCoveredLength();
}
亚麻:
1a. Given 2 sorted, singly-linked lists, write a function that will merge
them into a new sorted, singly-linked list
Ex.
1->2->4->8->16->32
2->4->6
1->2->2->4->4->6->8->16->32
*****************************************************************
1b. merge n sorted lists
// 1 -> 3,
// 2 -> 5
// 4
newhead: 1 -> 2 -> 3 -> 4 -> 5
*****************************************************************
1c. Given a Binary tree, print path from root to all nodes that are
divisible by 5
Input:
6
/
5 7
/
4 15
/ |
3 10 2 8
Output:
6 5
6 7 4 10
6 7 15
*****************************************************************
2. Given an array A (the array can be treated as a big number) and a number
n, find the biggest number that you can reach to via n swaps. A swap can
only happen in adjacent items. For example, given [1 3 4 2 5 7 9] and n = 1,
the biggest number is [3 1 4 2 5 7 9]
n=1, 3 1 4 2 5 7 9
n=2, 1 3 4 -> 1 4 3 -> 4 1 3
狗家:
1. Reorder List (leetcode)
1->2->3->4->5 => 1->5->2->4->3
*****************************************************************
2. Abbreviation: apple can be abbreviated to 5, a4, 4e, a3e, …
Given a target string (internationalization), and a set of strings,
return the minimal length of abbreviation of this target string so that it
won’t conflict with abbrs of the strings in the set.
“apple”, [“blade”] -> a4 (5 is conflicted with “blade”)
“apple”, [“plain”, “amber”, “blade”] -> ???
Problem changed to:
If given a string and an abbreviation, return if the string matches abbr.
“internationalization”, “i5a11o1” -> true
*****************************************************************
Onsite:
1a. Write a function to get a positive integer n as input and return 0 or 1.
The probability of returning 1 should be 1/(2^n)
1b. Given an array, return the median. (talk about expected time complexity)
2a. Code review - a class which takes a string, split by separators and
return the array of tokens (point out coding problems and indicate how you
will implement it)
2b. Longest consecutive sequence (leetcode) (how do you handle duplicates)
2c. design: how to store files given the file paths and contents. (tree?)
3a. Given an array and a number x, find out how many pairs satisfy (a[i], a[
j]) st. a[i]+a[j] < x
3b. follow up: if we want to find 3 items that adds up to a number < x
3c follow up: if we want to find k items. Time complexity: O(n^(k-1)*lgn)
4. Give a map which has some obstacles in it. Given a starting point S and
ending point E, find the shortest path from S to E. Note that you can go to
any(4) direction from S, but during the process, you can only go straight
from the previous direction, unless you hit an obstacle.
i.e. if you are at (1, 1) and the next (1, 2) is blocked, you can only go to
(2, 1) or (0, 1)
5a. Java “final” keyword
5b. 3-way partition: given an array and number x, reorder the array so that
first part will be < x, middle part is = x, and final part is > x.
5c. Design: given an array of integers and a range (i, j), we want to return
the min item in the range (balanced binary search tree)
5d. System design: given a machine, how to generate id so that they will not
duplicate; if we have multiple machines, what to do
Saturday, August 15, 2015
http://www.mitbbs.com/article_t/JobHunting/32675607.html
1. 把Heart Bleed Bug搞清楚。
从源代码到business impact,
你要能一清二楚而且表达得头头是道。
保证你们面见的大头都扫地相迎。
因为他们正身在噩梦之中，
不在乎有功，只在乎无过。
http://www.inferse.com/14435/heartbleed-bug-handling-security/
学习code quality/security audit.
几个人一起，把openssl 合力audit一次。
特别是用的少的部分， 互相交流，互相present。
最基本的比如： web programming,
mobile programming, framework
有什么 coding standard,
secure coding practice.
有什么 常见的网络安全fail.
coursera 上有 CYBERSECURITY SPECIALIZATION。
UT， 很多学校也有COURSEWORK
私心希望这样大家都可以自己养成好习惯，
而且知道怎样挑某族裔的刺，掌握主动权。
可攻可守。
当然遇到烙印就别来这一套。
烙印最忌讳有人比他们能吹。
装书呆子，老实巴交，苦力怕事
最有机会被烙印放过。
2. 提高EQ
先入club, 再阅读：
http://www.mitbbs.com/club_bbsdoc/ITRelief.html
参照烙印的EQ：
http://www.mitbbs.com/clubarticle_t2/ITRelief/31121015.html
建议老中发动起来帮助老中政客们电话拉票，
学习目标： 聆听， 见机行事， 电话礼貌， 英语， 心理抗rejection, 责任感， 荣
誉心，移位思考。
老中政客们入选，你们以后resume也多一个reference, experience!
请当双赢来认真对待。 你们看烙印支持O8 campaign卖了苦力，就无数O8的
"恩主”出现了， 在技术公司政府狐假虎威。
SVCA征集全美义工Phone Banking:
http://www.mitbbs.com/article_t/CivilSociety/9909.html
Tipsheet by Aijie:
Phone bankings tips by our volunteer, Aijie.
1）打电话前，注意一下他们的性别，年龄，党派，地址，因为有的人家用一个电话，
甚至夫妻互换了电话。这样接通时自己可以有心理准备。称呼Mr.或者Ms.，而不是其
first name, 一方面是正式尊重，另一方面是因为知道姓，比知道名要容易，不会让对
方的第一反应是‘你怎么知道我的名字’。 对DM先不要说PK是共和党，侧重介绍PK做
了什么，尤其是为亚裔，作为我们的一份子为我们发声。
2）对典型的华人的名字，hello后可以直接用中文,尤其是40-50岁的人，一定会中文。
而且一些60岁左右的叔叔阿姨，他们不会英文，不至于开口就把他们吓走。对于不太确
定的名字，可用英文问是否可以讲中文。从对方口音，可以找认同感，比如来自大陆就
介绍自己也是，来自台湾就介绍PK也是，等等。
3） 打电话时间的选择，个人觉得11am-12pm, 最迟不能超过12:30pm，因为忙了一上午
，11开始大家会比较放松，好聊。最晚12半后应该都在吃饭，不好打扰。然后4pm-7pm
，最迟不能超过7:30pm，呵呵，比建议的8pm早了半小时。另外要注意对方下班开车时
间，如果遇到，可以说还是先注意驾车安全，晚些再打。
4）记录自己打电话的时间。如果中午没人接，晚上再打。2次后都没人接，第3次留言
。最多别超过3次，不然对方也会烦的。这一点和建议的也不一样。我用这种办法，找
到了几个第一次没接的，有了直接对话的机会，成功率大些。当然，如果建议还是第一
次就直接留言，我会照做。
5）对于不同的声音，不要马上反对。尊重对方，听他讲，再用事实和数据说话。我和
一位Xu太太聊了半个小时，她有几点不同的意见。（1）她是支持平权法案的，觉得不
能因为当初我们亚裔受益就支持，现在不受益就反对。我听她说完，称赞她关心实事，
为所有族裔利益考虑，有开明的思想，等等。然后再说历史的原因，50年前，为了那些
历史上受歧视压迫受到不公待遇的少数族裔和女性，有了平权AA，照顾他们，是真的为
少数族裔提供机会。而后来，加州的各个族裔在变化，一些有才华的学生却因为族裔而
受到逆向歧视不能入学。所以20年前才取消了平权，所有学生都用成绩来竞争，而不是
族裔。20年后，现在的SCA5不是平权，西裔人口已经接近40%，如果通过，就是为人数
占多数的族裔服务了。（2）Xu太又说不赞成华人只知道学习，就成绩好。我又先赞她
考虑周全，不能让孩子死读书。然后指出大学录取学生并不是只看GPA，学生的申请要
全方位发展，各项优秀，才能被看中。并用林书豪Jeremy Lin的例子来说。她很开心，
很喜欢林那样的。（3）Xu太说不喜欢竞选的人到了社区总是强调自己是亚裔，会为亚
裔争取利益。不能说对亚裔好，而是应该是对美国的发展好。我还是赞她有开明的思想
，民主的意识。然后再说，其实其他族裔的竞选者也都是打自己的社区这样说的。比如
奥巴马当年竞选，自己族裔的都去投票。首先要让自己的族裔支持自己，才有可能获得
更大的支持啊。后来Xu太也说明白为什么西裔的竞选也要这样，不管怎样，还是要支持
PK的。
6） 留言。因为没有反馈，我不知道效果如果。我录了一下几段留言的时长。范例用时
1：45-2min。我很喜欢Lei的简短版，约1min.我自己也有个简短版，和Lei的非常相似
，约1min.增加了一点，就是对于名字像华人的，我在说完PK后，用中文再说一遍他的
名字。
谢谢大家！一起努力！
从源代码到business impact,
你要能一清二楚而且表达得头头是道。
保证你们面见的大头都扫地相迎。
因为他们正身在噩梦之中，
不在乎有功，只在乎无过。
http://www.inferse.com/14435/heartbleed-bug-handling-security/
学习code quality/security audit.
几个人一起，把openssl 合力audit一次。
特别是用的少的部分， 互相交流，互相present。
最基本的比如： web programming,
mobile programming, framework
有什么 coding standard,
secure coding practice.
有什么 常见的网络安全fail.
coursera 上有 CYBERSECURITY SPECIALIZATION。
UT， 很多学校也有COURSEWORK
私心希望这样大家都可以自己养成好习惯，
而且知道怎样挑某族裔的刺，掌握主动权。
可攻可守。
当然遇到烙印就别来这一套。
烙印最忌讳有人比他们能吹。
装书呆子，老实巴交，苦力怕事
最有机会被烙印放过。
2. 提高EQ
先入club, 再阅读：
http://www.mitbbs.com/club_bbsdoc/ITRelief.html
参照烙印的EQ：
http://www.mitbbs.com/clubarticle_t2/ITRelief/31121015.html
建议老中发动起来帮助老中政客们电话拉票，
学习目标： 聆听， 见机行事， 电话礼貌， 英语， 心理抗rejection, 责任感， 荣
誉心，移位思考。
老中政客们入选，你们以后resume也多一个reference, experience!
请当双赢来认真对待。 你们看烙印支持O8 campaign卖了苦力，就无数O8的
"恩主”出现了， 在技术公司政府狐假虎威。
SVCA征集全美义工Phone Banking:
http://www.mitbbs.com/article_t/CivilSociety/9909.html
Tipsheet by Aijie:
Phone bankings tips by our volunteer, Aijie.
1）打电话前，注意一下他们的性别，年龄，党派，地址，因为有的人家用一个电话，
甚至夫妻互换了电话。这样接通时自己可以有心理准备。称呼Mr.或者Ms.，而不是其
first name, 一方面是正式尊重，另一方面是因为知道姓，比知道名要容易，不会让对
方的第一反应是‘你怎么知道我的名字’。 对DM先不要说PK是共和党，侧重介绍PK做
了什么，尤其是为亚裔，作为我们的一份子为我们发声。
2）对典型的华人的名字，hello后可以直接用中文,尤其是40-50岁的人，一定会中文。
而且一些60岁左右的叔叔阿姨，他们不会英文，不至于开口就把他们吓走。对于不太确
定的名字，可用英文问是否可以讲中文。从对方口音，可以找认同感，比如来自大陆就
介绍自己也是，来自台湾就介绍PK也是，等等。
3） 打电话时间的选择，个人觉得11am-12pm, 最迟不能超过12:30pm，因为忙了一上午
，11开始大家会比较放松，好聊。最晚12半后应该都在吃饭，不好打扰。然后4pm-7pm
，最迟不能超过7:30pm，呵呵，比建议的8pm早了半小时。另外要注意对方下班开车时
间，如果遇到，可以说还是先注意驾车安全，晚些再打。
4）记录自己打电话的时间。如果中午没人接，晚上再打。2次后都没人接，第3次留言
。最多别超过3次，不然对方也会烦的。这一点和建议的也不一样。我用这种办法，找
到了几个第一次没接的，有了直接对话的机会，成功率大些。当然，如果建议还是第一
次就直接留言，我会照做。
5）对于不同的声音，不要马上反对。尊重对方，听他讲，再用事实和数据说话。我和
一位Xu太太聊了半个小时，她有几点不同的意见。（1）她是支持平权法案的，觉得不
能因为当初我们亚裔受益就支持，现在不受益就反对。我听她说完，称赞她关心实事，
为所有族裔利益考虑，有开明的思想，等等。然后再说历史的原因，50年前，为了那些
历史上受歧视压迫受到不公待遇的少数族裔和女性，有了平权AA，照顾他们，是真的为
少数族裔提供机会。而后来，加州的各个族裔在变化，一些有才华的学生却因为族裔而
受到逆向歧视不能入学。所以20年前才取消了平权，所有学生都用成绩来竞争，而不是
族裔。20年后，现在的SCA5不是平权，西裔人口已经接近40%，如果通过，就是为人数
占多数的族裔服务了。（2）Xu太又说不赞成华人只知道学习，就成绩好。我又先赞她
考虑周全，不能让孩子死读书。然后指出大学录取学生并不是只看GPA，学生的申请要
全方位发展，各项优秀，才能被看中。并用林书豪Jeremy Lin的例子来说。她很开心，
很喜欢林那样的。（3）Xu太说不喜欢竞选的人到了社区总是强调自己是亚裔，会为亚
裔争取利益。不能说对亚裔好，而是应该是对美国的发展好。我还是赞她有开明的思想
，民主的意识。然后再说，其实其他族裔的竞选者也都是打自己的社区这样说的。比如
奥巴马当年竞选，自己族裔的都去投票。首先要让自己的族裔支持自己，才有可能获得
更大的支持啊。后来Xu太也说明白为什么西裔的竞选也要这样，不管怎样，还是要支持
PK的。
6） 留言。因为没有反馈，我不知道效果如果。我录了一下几段留言的时长。范例用时
1：45-2min。我很喜欢Lei的简短版，约1min.我自己也有个简短版，和Lei的非常相似
，约1min.增加了一点，就是对于名字像华人的，我在说完PK后，用中文再说一遍他的
名字。
谢谢大家！一起努力！
Subscribe to:
Posts (Atom)