|
|
l**********1
发帖数: 5204 | 3 TDRL tandem duplication and random loss and or Horizon transfer event,
pls refer
>Thus, for any given tandem duplication history, Fitch (1977) and Elemento
et al. (2002) defined a corresponding rooted duplication >tree (RDT) in
which nonnested duplication events are not temporally >related and an (
unrooted) du- plication tree (DT) in which the >root location is also lost.
>HTTP double dot//hal.archives-ouvertes.fr/docs/00/19/19/24/PDF/D109.PDF
or 2012 one PhD dissertation from National Universi... 阅读全帖 |
|
s***0
发帖数: 1106 | 4 60
Your AutoCheck Vehicle History Report
2001 Mercury Villager
Report Run Date: 2010-10-05 22:16:48.514 EDT
VIN: 4M2ZV11T11DJ12379
Year: 2001
Make: Mercury
Model: Villager
Style/Body: Wagon 4D
Class: Van - Mini
Engine: 3.3L V6 MPI
Country of Assembly: United States
Vehicle Age: 9 year(s)
Calculated Owners: 2
Calculated Accidents: 0
Last Reported
Odometer Reading: 164,910
This vehicle's AutoCheck Score
The AutoCheck Score is a summary of your vehicle's history, letting you
compar... 阅读全帖 |
|
c***z
发帖数: 6348 | 5 用autocheck查了个车，看不懂结果，尤其是
(1)Odometer Problem
The vehicle has odometer-related problems. These may include discrepancies
such as not actual miles, a broken odometer, exceeding a vehicle’s
mechanical limits, a mileage discrepancy, or suspect miles.
(2)Duplicate Title
The vehicle had a duplicate title issued by the DMV.
(3)Fleet, Rental and/or Lease Use
Vehicle Use and EventCheck
记录的最后一项是
07/07/2011 HILLSIDE, NJ
Motor Vehicle Dept. TITLE (Title #:NK201118800000076)
DUPLICATE ... 阅读全帖 |
|
b*****f
发帖数: 851 | 6 11月21号从NY州的Hertz买了个二手车，title(Maryland的title)有点问题，NJ的DMV不
让注册(我在NJ住)，所以就把title寄给Hertz让他们改,悲催的是这个title寄丢了。现
在已经让Hertz申请了duplicate title。
想问的是，在Maryland申请个duplicate title要多久啊？11月21号Hertz给了个临时的
可用一个月的纸质plate，如果12月20号，我还没收到duplicate title, 那也没办法注
册了。我能让Hertz再给我开个一个月的纸质plate吗？我能用这个纸质的plate开长途
吗？比如从NJ到印第安阿州。
哪位有经验的给回答下这几个问题你，多谢了。 |
|
e******t
发帖数: 3289 | 7 2012 Buick Enclave Convenience
One owner One owners
Calculated Owners: 1
Class: CUV - Mid Range
Engine: 3.6L V6 DI
Country of Assembly: United States
Vehicle Age: 4 year(s)
Calculated Owners: 1
VIN: 5GAKRBED0CJ274174
Year: 2012
Make: Buick
Model: Enclave Convenience
Style/Body: SUV 4D
This vehicle's AutoCheck Score
The AutoCheck Score is a summary of your vehicle's history. It lets you
compare similar vehicles with e... 阅读全帖 |
|
发帖数: 1 | 8 最近查到一个报告，上面写的是Duplicate title issued，除了原来的title丢了，还
有什么情况下可以有这个duplicate？有人说lease的情况下可以发申请这个duplicate
tile吗？买的时候需要注意一些什么问题？ |
|
m**t
发帖数: 374 | 9 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
Delta Voucher 2*$100 @0.8
单张面值:
$100
可接受价格(必须明码标价！):
一张$100, expires 27MAY12, $80
另一张$100, expires 05JAN13, $85
两张一起买，$160
物品新旧要求:
new
邮寄方式要求:
email code
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
non-cc paypal/BOA/chase
其他补充说明:
Terms & Conditions
Terms and Conditions for Delta Transportation Credit Voucher(s) with a Date
of Issue on or after December 15th, 2011:
1. Value: The face amount of this voucher may be applied to the purchase of
any ticket for passe... 阅读全帖 |
|
d*******1
发帖数: 175 | 10 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
Delta Voucher $400 @0.85
单张面值:
$400 (expiration date: 08/11/2012)
可接受价格(必须明码标价！):
$340
物品新旧要求:
new
邮寄方式要求:
email code
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
non-cc paypal/BOA
其他补充说明:
Terms & Conditions
Terms and Conditions for Delta Transportation Credit Voucher(s) with a Date
of Issue on or after December 15th, 2011:
1. Value: The face amount of this voucher may be applied to the purchase of
any ticket for passenger travel within the Delta system worldw... 阅读全帖 |
|
m**t
发帖数: 374 | 11 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
Delta Voucher 2*$100 @0.8
单张面值:
$100
可接受价格(必须明码标价！):
一张$100, expires 27MAY12, $80
另一张$100, expires 05JAN13, $85
两张一起买，$160
物品新旧要求:
new
邮寄方式要求:
email code
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
non-cc paypal/BOA/chase
其他补充说明:
Terms & Conditions
Terms and Conditions for Delta Transportation Credit Voucher(s) with a Date
of Issue on or after December 15th, 2011:
1. Value: The face amount of this voucher may be applied to the purchase of
any ticket for passe... 阅读全帖 |
|
d*******1
发帖数: 175 | 12 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
Delta Voucher $400 @0.85
单张面值:
$400 (expiration date: 08/11/2012)
可接受价格(必须明码标价！):
$340
物品新旧要求:
new
邮寄方式要求:
email code
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
non-cc paypal/BOA
其他补充说明:
Terms & Conditions
Terms and Conditions for Delta Transportation Credit Voucher(s) with a Date
of Issue on or after December 15th, 2011:
1. Value: The face amount of this voucher may be applied to the purchase of
any ticket for passenger travel within the Delta system worldw... 阅读全帖 |
|
u***1
发帖数: 251 | 13 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
Delta Voucher $600 @0.85
单张面值:
$600 (expiration date: 12/15/2013)
可接受价格(必须明码标价！):
$510
物品新旧要求:
new
邮寄方式要求:
email code
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
non-cc paypal/BOA
其他补充说明:
Terms & Conditions
Terms and Conditions for Delta Transportation Credit Voucher(s) with a Date
of Issue on or after December 15th, 2011:
1. Value: The face amount of this voucher may be applied to the purchase of
any ticket for passenger travel within the Delta system worldw... 阅读全帖 |
|
a******n
发帖数: 4290 | 14 理由说我duplicate membership with PTF.
大概半年前，dp突然莫名其妙得自动给我们发了一个PTF的membership ID。
因为手头已经有一个了，我赶紧打电话说，我们没有order这个id,希望不要被认定为
duplicate membership. dp的人说，马上咳嗽，不会认定我们家是重复申请ptf.
这都半年过去了，突然不让我登陆ptf。打电话给csr,dp的人说我的membership is
fine,没有问题。过了大概1周，dp的正式email通知到了，说我duplicate membership
with ptf.
我又打电话过去，他们说no matter for 什么原因，反正就是取消membership了，等收
到正式书面通知，我可以根据书面通知做response。
我的ptf反正也早已经挖掘的差不多了，咳嗽了也就罢了。
他们不会把我其他的program也给咳嗽了吧？我也不希望上黑名单的说，以后还得跟dp
玩啊。
事情好奇怪啊？ 请指教～～
我老革命遇到新问题了。 |
|
p***e
发帖数: 29053 | 15 There still is no information available on the number of H1b applications
received by the USCIS so far. The CIS has stated that they will be
reviewing H1b cases subject to the H1b quota cap received for duplicate H1b
filings. The CIS has stated that it will first analyze whether a duplicate
H1b petition exists based on preliminary data entry information. Once a
potential H1b duplicate has been identified, the CIS officer will then pull
the H1b petitions and evaluate them to ensure that they a |
|
M****g
发帖数: 40 | 16 Questions and Answers: American Immigration Lawyers Association (AILA)
Questions on H-1B Processing
Question: We understand that USCIS will be reviewing H cap cases for "
duplicate filings." Please explain how USCIS will determine that a filing
is a duplicate. Is this based on the Petitioner FEIN and beneficiary name
only? If USCIS believes that a filing is a duplicate, will USCIS provide the
Petitioner/Attorney with an opportunity to respond in case there is a
misunderstanding? As many fore |
|
m*****n
发帖数: 5245 | 17 梁勇律师事务所，lianglaw.com专稿
移民局Service Center Operations 今天通知
所有属于FY2009 Cap 的H-1B 申请已经在5月23日完成所有的H-1B 资料的输入动作,并
在5月24日将所有的抽中的H-1B 收据寄出, 有足够的H-1B 案件, 移民局本来会发出的
候补名单不需要了, 也就是说如果你到现在没有收到H-1B 收据, 银行的支票金额也没
取走,你就没有占到FY2009 的H-1B 名额,移民局将从这个星期开始陆续退回没被抽中的
申请件包括表格及申请费
.
移民局同时表示, 今年大约有500件左右的申请是移民局认为 “Duplicate” 的申请.
移民局正在逐一清查这些是否真的是“Duplicate” 的申请, 如果查证属实的话,移民
局会全数拒绝这些“Duplicate” 的申请并且不退回申请费.
***谢谢您阅读本文，如需转载，请注明出处，其他相关新闻请查看本所网址:http://www.lianglaw.com |
|
h**6
发帖数: 4160 | 18 我把二叉树版本写出来了，大家研究一下：
void duplicate(BSTNode* A)
{
if(A == NULL)
return;
BSTNode* temp = new BSTNode;
temp->left = A->left;
temp->right = A->right;
A->left = temp;
A->right = NULL;
duplicate(temp->left);
duplicate(temp->right);
}
void copy(BSTNode* A)
{
if(A == NULL)
return;
BSTNode* temp = A->left;
if(A->random == NULL)
temp->random = NULL;
else
temp->random = A->random->left;
copy(temp->left);
copy(temp->righ |
|
I**********s
发帖数: 441 | 19 问了1) 研究, 2) 多线程程序设计, 3) 任意无穷字符串流, 内存有限, 找出唯一一对
重复字符串, 这个我说了哈希表和外部排序, 但是面试人说有更好的办法(后来想也许
是bloom filter), 然后追问外部排序的细节到结束. 估计要挂 :(
总结: 面试既是技术活, 又是运气活.
无论如何, 把我的准备工作放下面, 攒点rp, 希望对大家有所帮助.
Interview Qs
Data Structures
1. Integer
- find number of 1s
- next largest smaller
- smallest larger number
- determine if is palindrom
- itoa, atoi
- add 2 numbers w/o using + or arithmetic operators
- implement *, -, / using only +
- find max of two numbers w/o co... 阅读全帖 |
|
A*********r
发帖数: 564 | 20 嗯，需要记录每个duplicate的次数，然后才知道对每个duplicate，要怎么输出。
如果duplicate的次数少于ｋ的话，那么ｋ里面可以取的ｘ的数目也是变的，挺复杂的
，需要用递归。。 |
|
d****j
发帖数: 293 | 21 面试官没提到题目不可以外泄，而且也都是常见的， 所以就在这里发了。
两轮电话面试都是45分钟，2道编程题，白板共享文档写程序。
简单寒暄5-10分钟，谈谈research，最近做的project等等。
然后直接告知共享文档link，写程序。
Round 1：
A. Given an arbitrary tree, can you print it level by level (with each level
printed on the same line).Define your own tree node structure, can be
binary tree or n-ary tree.
B. Given a set of distinct integers, can you print out all subsets?
Round 2:
A. Remove duplicated integers in an array, and then return an array without
duplicates. Follow up: what if allow duplic... 阅读全帖 |
|
d****j
发帖数: 293 | 22 面试官没提到题目不可以外泄，而且也都是常见的， 所以就在这里发了。
两轮电话面试都是45分钟，2道编程题，白板共享文档写程序。
简单寒暄5-10分钟，谈谈research，最近做的project等等。
然后直接告知共享文档link，写程序。
Round 1：
A. Given an arbitrary tree, can you print it level by level (with each level
printed on the same line).Define your own tree node structure, can be
binary tree or n-ary tree.
B. Given a set of distinct integers, can you print out all subsets?
Round 2:
A. Remove duplicated integers in an array, and then return an array without
duplicates. Follow up: what if allow duplic... 阅读全帖 |
|
s*******f
发帖数: 1114 | 23 //A. Given an arbitrary tree, can you print it level by level (with each
level
//printed on the same line).Define your own tree node structure, can be
//binary tree or n-ary tree.
struct Node{
int d;
std::vector children;
};
void PrintByLevel(Node *r){
if (!r)
return;
std::queue q;
q.push(r);
int pre_count = 1;
int count = 0;
while (!q.empty()){
Node *p = q.front();
for (std::vector::const_iterator ci = p-
>children.begin(); ci != p->children.end(); ++ci){
q.push(*ci);
++cou... 阅读全帖 |
|
e*****e
发帖数: 1275 | 24 这题目大家有啥思路？俺觉得挺有意思的。。。。
我所想到的就是第一找true max.
true max 就是用auto increase, 你能bid 到最高的
num_max_inc = (max - start)/incr
true_max = start + num_nmax_inc * inc;
如果你的inc太高，一步就超过max了，true_max 就是 start
第二就是找second max from all the true max list.
如果没有second max, 大家都愿意出到最高，那就哥们1，最先bid的那个是winner.
如果有seonc max,如下。。。
max 可以有好多duplicate,如果没有duplicate,
这个max - N*inc 大于secon max, 这就是解。N>=0,要最大。
然后从哪个duplicate 的 max 的true_max list 里面找solution.
比如如下。。。second max is 14, max is 18
A 15, 18
B 16, 17, 18
C 16, 18
怎么找sol... 阅读全帖 |
|
i**********e
发帖数: 1145 | 25 你的解法可以再 generalized 些，不需要特别处理 duplicate 情况：
解法如下：
Assume a[i] = starting bid, b[i] = largest bid, k[i] = bid increment amount,
where i is the person's index
1) First, calculate the maximum possible bid for each person = a+k*floor((b-
a)/k).
2）Second, find the max and the second_max (can be done in O(N) with about
2N comparisons) among all the maximums calculated in 1). You don't have to
store the results in 1) with extra storage, you can just calculate and
record the max/second_max at the same t... 阅读全帖 |
|
c**y
发帖数: 172 | 26 Binary search works for an array with duplicate elements.
However, a modified binary search doesn't work for a rotated array with
duplicate elements (see Careercup book p181).
So how should we deal with a rotated array without duplicate elements?
Trying to use the modified binary search is good, but it is hard to remember
. We can first locate the special location, and then use the ordinary binary
search in the "right" range. |
|
c******r
发帖数: 225 | 27 3. read n lines of random numbers(space as delimiter) from a file, lines
with same numbers are treated as duplicated lines, regardless of the order.
check and print non-duplicate lines. performance time analysis.
sort the n line based on the # of numbers in each line o(nlgn)
only lines that have the same # of numbers will be compared
suppose we have a set of m lines of length k
for each line in line_set:
sort numbers in each line ~ o(klgk)
then build a hashmap as a helper data structure
for al... 阅读全帖 |
|
x****3
发帖数: 62 | 28 刚拿到书, 还没看. 题是从http://www.crackingthecodinginterview.com考的. 感觉跟第4版差别不大.
Chapter 1 Arrays and Strings
1.1 Unique Characters in String
1.2 Reverse String in C
1.3 Check Permutation
1.4 Replace Spaces
1.5 String Compression
1.6 Rotate Image / Matrix
1.7 Set Row or Column to 0
1.8 Check Rotation Using isSubstring
Chapter 2 Linked Lists
2.1 Remove Duplicates
2.2 Find kth to Last Element
2.3 Delete Node from Middle
2.4 Partition List
2.5 Add Two Lists
2.6 Get Front of Loop in Circular List
2.7 Check ... 阅读全帖 |
|
x****3
发帖数: 62 | 29 刚拿到书, 还没看. 题是从http://www.crackingthecodinginterview.com考的. 感觉跟第4版差别不大.
Chapter 1 Arrays and Strings
1.1 Unique Characters in String
1.2 Reverse String in C
1.3 Check Permutation
1.4 Replace Spaces
1.5 String Compression
1.6 Rotate Image / Matrix
1.7 Set Row or Column to 0
1.8 Check Rotation Using isSubstring
Chapter 2 Linked Lists
2.1 Remove Duplicates
2.2 Find kth to Last Element
2.3 Delete Node from Middle
2.4 Partition List
2.5 Add Two Lists
2.6 Get Front of Loop in Circular List
2.7 Check ... 阅读全帖 |
|
a*****g
发帖数: 110 | 30 来自主题: JobHunting版 - 面经&感想 从6月初开始准备找工作，找了近半年，期间毁onsite无数，最近终于有所收获，拿到
几个offer，虽然不是那几个著名大公司，不能和版上的牛人比，但也算和自己专业相
近，决定挑一个从了。穷人没什么包子，就说点感想发点面经，答谢本版。顺便求祝福
接下来的process能够顺利。今年h1b已经用完了，我是打算quit phd做full time的，
学校的CPT/OPT没过qualify之前还不让full time，庆幸公司允许我先做part time。希
望一切能够顺利。也bless其他找工作的同志们。
1. 找工作还是要花大量时间精力充分准备的，各种基本概念、data structure,
algorithms, programming language concepts，还有自己简历上写的各种project要把
每个细节都弄清楚。没准备好之前不要轻易投大公司浪费机会，免得追悔莫及。我就有
惨痛的教训。一下是我主要复习的材料。
career cup
programming interview expose
ihas1337code
thecareerplus
geeks for gee... 阅读全帖 |
|
w*******s
发帖数: 96 | 31 Two implementation. one use sort and one use hash.
//pre: str is sorted.
void PermutationWithDuplicate(char *str, int position)
{
if (position == strlen(str)) {
printf("%s", str);
return;
}
char lastChar = '\0';
for (int i = position; i
{
//skip those character which is duplicated. Since the string is
sorted, it's easy.
if (lastChar == str[i] ) continue;
lastChar = str[i];
swap(str[po... 阅读全帖 |
|
x*******5
发帖数: 152 | 32 这个是我的题库，还有一些题没有coding，比如back of envelop计算，idea思考，等等
Column 4-5 Pearl (namespace Pearl)
64. Implement bitsort (Bitsort)
65 Find the k unique random integers from the range of [0,n-1] (STL, knuth,
swap, floyd) (generate_int_floyd; generate_int_swap; generate_int_knuth)
66. If memory is limited, using k-pass bitsort to sort integers (bitsort_
kpass)
67. Rotation of array (reverse, gcd, blockswap) (rotate; rotate2; rotate3)
68. Permutation of a string (without/with duplicates chars) (String::string_... 阅读全帖 |
|
w****x
发帖数: 2483 | 33 前天刚做过
//permutation of string with duplicate characters
//different from the subset problem, can't solve duplicated chars
//situation by sorting the array
void _inner_print(char strOrg[], char strCur[], int nLen)
{
assert(strOrg && strCur && nLen >= 0);
if (0 == nLen)
{
cout<
return;
}
//record if a character is calculated as a header
//to eliminate duplicated characters
bool bRec[256];
memset(bRec, 0, sizeof(bRec));
for (int i = ... 阅读全帖 |
|
l**********o
发帖数: 260 | 34 新手初到，写了几行，请大家指点
// this is to produce an integer array with one number duplicated
import java.util.*;
import java.io.*;
public class proAnArray{
public static void main(String[] args) throws IOException{
FileWriter fw = new FileWriter("Array.txt");
int N = 30000;
fw.write(N + "\n");
for(int i = 0; i < N; i++){
fw.write(i + " ");
if (i % 10 == 0) fw.write("\n");
}
int j = 400;
fw.write(j + "\n"); ... 阅读全帖 |
|
s*******f
发帖数: 1114 | 35 1. get index of s1 in s2, for each char in s1, mark position is s2.
here "tiger" in "itreg" is [1, 0, 4, 3, 2]
stops和posts is: 2 3 1 0 4
//For duplication, always pick nearer one first. I use "set" to deal with
duplication in code.
At first I use brute force here with O(n square). But when using
hash_map >, it goes to O(n), or queue hm[256]
.no need to use "set" for duplication.
2. rule for eat: you can eat neighbour if your high or low bound
can "touch" neighbour.
here [1,... 阅读全帖 |
|
p***s
发帖数: 78 | 36 detect number of duplicates in bst
duplicates in array is nlogn （不用hash), 这个怎么更快？
标 题: Re: 明天onsite，求下bless了
发信站: BBS 未名空间站 (Tue Jun 12 01:19:01 2012, 美东)
我贴下面经吧。
两轮电面.
第一轮问了下怎么实现，query auto completion。 我说trie，他然后问了下trie 很
大比较大的情况下怎么scale
第二轮问了题。
怎么用rand5是实现rand7
onsite问的题目都很不是很难。
intersection of two arrays.
maximum sub array.
intersection of two sorted arrays. how to optimize when two array size are
different.
reservoir sampling
detect number of duplicates in bst
最后一道
http://www.mitbbs.com/ar... 阅读全帖 |
|
t******t
发帖数: 21 | 37 if no duplicates like 6,4,7,5,3,8
scan the input once find max min and count and then you can calculate if
they are continuous.
if duplicates are allowed, use hashmap to filter out duplicates and find max
min and count(don't count dup) in one pass. |
|
r****i
发帖数: 528 | 38 1. Coding, given a list of words (string), let compound word be the
combination of any two words in the array, check the numbers of duplicated
words (to check if there are duplicated compound words, and if the compound
word is the same as some word in the original list,
it is also considered as duplicated)
{"am", "eat", "a", "meat"} "am"+"eat"="a"+"meat" outout =1
2. OO design. Design a system for members to borrow books from a library
and a followup question is how to guarantee the performance... 阅读全帖 |
|
p****e
发帖数: 3548 | 39 试了一下，合格不
// Type your C++ code and click the "Run Code" button!
// Your code output will be shown on the left.
// Click on the "Show input" button to enter input data to be read (from
stdin).
#include
using namespace std;
char getnonduplicate(string s)
{
int size = s.size();
if(size == 0) return '\0';
vector cc;
int lastnonduplicate = 0;
for(int i = 0; i < size; i++)
{
bool duplicate = false;
for(int j=0; j < cc.size(); j++)
{
... 阅读全帖 |
|
h**h
发帖数: 298 | 40 关于H1B，USCIS上的这段话什么意思？
A Duplicate Copy of the H-1B Petition
You must submit a duplicate copy of your H-1B petition and any subsequent
response to a Request for Evidence or Notice of Intent to Deny (where
applicable) if the beneficiary will be applying for a nonimmigrant visa
abroad. USCIS will not make a second copy if one is not provided.
You may also choose to submit a duplicate copy of the petition with any
subsequent response to a Request for Evidence or Notice of Intent to Deny (
where appl... 阅读全帖 |
|
E*********w
发帖数: 161 | 41 CIS 不是08年就已经规定不可以一人多申了吗？这应该早就不是问题了啊？
On March 19, 2008, USCIS announced a regulatory change to prohibit employers
from filing multiple or duplicative H-1B petitions for the same employee.
To ensure fair and orderly distribution of available H-1Bs, USCIS will deny
or revoke multiple or duplicative petitions filed by an employer for the
same H-1B worker and will not refund the filing fees submitted with multiple
or duplicative petitions.
还是我理解有误？。。。 |
|
g***j
发帖数: 1275 | 42 请问如果没有duplication的话，很好理解，取中间位置的直，然后扔掉确定有序并且
全部小于或者大于target的那部分。
那么如果有duplication，对上面的有什么影响么？ 我看了网上不少解答，但是我还是
没有想明白，如果前面的思路是正确的话，为啥有duplication，会有差别。 |
|
h****y
发帖数: 137 | 43 不管是leetcode的int还是我面的这道题改成char, 都是assume no duplicate的, 要是
还考虑duplicate难度又上升了, 而且你即便用vector的解法在duplicate的情况下也是
不对的 |
|
y***1
发帖数: 18 | 44 背景： cs Ph.D， 已经毕业工作3年，在学校里做faculty. 本来完全没想过去公司，
前几天不知google recruiter 怎么地就找到我的联系方式问有无兴趣跳槽，那就试试
吧。
昨天面的，背景聊了快20分钟，然后
（1）what is BST?
(2) 可不可以里面有duplicate value.
(3) 如何handle duplicate value, 不同handle 策略有什么优缺点。
（4）然后选了一种我说的，把duplicate全放在left sub tree, 然后写一个function
判断是不是BST, 就是 validateBST
我写了一个最简单的，分析了复杂度， 是O(n^2), 问可不可以optimize,我说可以。
便写了一个O(n)的用low 和high 来bond.
然后程序有个小bug,经提示改了，又问这个方法有什么drawback,我说遇到 root=INT_
MAX, root->right=INT_MAX会overflow, 然后要求处理overflow.
面了50分钟。
今天打电话过来说要onsite.
给大家一个参考。。 |
|
l******9
发帖数: 579 | 45 【 以下文字转载自 Statistics 讨论区 】
发信人: light009 (light009), 信区: Statistics
标 题: SQL check likeness between two large tables
发信站: BBS 未名空间站 (Tue May 6 15:38:29 2014, 美东)
I need to check the likeness between two data tables on SQL. I am working on
Aginity Workbench for Netezza on Win 7.
The tables are very large. One of them has 100 million rows and 4 columns;
another one has 1500 million rows and 3 columns.
Example, table1
ID1 ID2 ID3 Value
xxxx xxxxxx xxxxxxxx xxx.xxxxxx ... 阅读全帖 |
|
A****0
发帖数: 1073 | 46 这题我感觉有个陷阱——Duplicates，当duplicate数超过数组长度一半时无解。
而且有duplicate时只有sort的办法最好，其他好些办法都不行。 |
|
h*******e
发帖数: 1377 | 47 好吧。。。没有了，看错了以为类似 leetcode rmv duplicate 呢。如果全局
duplicate那就是hash要么 如果是adjacent duplicate 就是curI 1开始 size 结束，
curI-1 curI, newI三个指针就行吧。 |
|
h*******e
发帖数: 1377 | 48 好吧。。。没有了，看错了以为类似 leetcode rmv duplicate 呢。如果全局
duplicate那就是hash要么 如果是adjacent duplicate 就是curI 1开始 size 结束，
curI-1 curI, newI三个指针就行吧。 |
|
n*****5
发帖数: 984 | 49 Phone1：
Q1.First position of integer in given sorted array with duplicate
Q2: Given inorder and preorder traversal strings of a binary tree, please
write code to reconstruct the tree
phone 2:
Q1: Best time to buy and sell stock.
Q2: Unsorted array with element 1~N. One element is replaced with another,
so there is one missing and one is duplicated. Find out which one is missing
/ duplicated.
---expected using swap or similar
yahoo onsite 每人45分钟
问web 结构 设计一个能够distributed， 快速查询的网络，支持restful 如何设计
从... 阅读全帖 |
|
r****8
发帖数: 22 | 50 heck if a tree has a cycle
duplicate a graph
char *p;
p=*p=0;
what’s wrong with this code?
char *p;
p=*p=0;
what’s wrong with this code?
using uninitialized pointer
who will generate segmentation fault?
hardware, CPU.
how is segmentation fault generated?
CPU generates an unrecoverable fault, a kind of exception
why the lower address space is not used by neither os nor process?
avoid damage caused by uninitialized pointer
uninitialized pointer often contains garbage value which is small. That is
... 阅读全帖 |
|
