s****h
发帖数: 3979 | 1 只需要32.5k or 65k or 97.k了。
谢谢 |
|
s********z
发帖数: 5411 | 2 Will redeem for you from Discover once payment received.
Looking for a new car or service for your old one? Kia delivers an
outstanding combination of world-class engineering, exceptional performance
and advanced safety systems - all designed to bring you an impressive
driving experience. Now, you can:
Double the value of your Cashback Bonus when you redeem for Kia gift cards
below
Use the gift card on a new vehicle purchase*, accessories, service and more.
..
Find your nearest Kia dealer and se... 阅读全帖 |
|
o********8
发帖数: 98 | 3 有谁要买Kia车子？我有1200块Discover Cash。可以和你分享bonus。
Discover Cash Back for Kia Gift Card
Limited time offer - redeem now!
Looking for a new car or service for your old one? Kia delivers an
outstanding combination of world-class engineering, exceptional performance
and advanced safety systems - all designed to bring you an impressive
driving experience. Now, you can:
Double the value of your Cashback Bonus when you redeem for Kia gift
cards below
Use the gift card on a new vehicle purchase*, acce... 阅读全帖 |
|
r****h
发帖数: 1248 | 4 二手交易风险自负！请自行验证是否合法和一手卡！:
NOTE(Risk free):
我想卖的物品:
(出售)HP LEXMARK EMPTY ink cartriage for recycle 0.1$ each 马上drop
500个起售,你给label,或者local pickup (greater seattle area)
单张面值:
0.1$ each
可接受价格(必须明码标价！):
0.1$ each
物品新旧要求:
Used
邮寄方式要求:
Your label
买卖双方谁承担邮寄损失(Required if not code only):
before sent, me
after sent, fedex
付款方式说明:
BOA ONLY Cash
其他补充说明:
所有墨盒都是hp brand的,可以符合officemax office depot staples的要求.
关于recycle:
ink/toner cartridge recycling primer/faq for Office Depot, OfficeMax and
Staples (vers. 2... 阅读全帖 |
|
x*********0
发帖数: 411 | 5 我想卖的物品:
AMEX MR points 7*[email protected]
单张面值:
78K
可接受价格(必须明码标价！):
rate 1.8
物品新旧要求:
邮寄方式要求:
The points will be online transferred to your designated account. In
increment of 10K (1-2 accounts)
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
non cc paypal.
其他补充说明:
只转1-2 帐号
广告的有效期:
until gone
物品来源(Required for All Cards!):
我的联系方式:
站内PM
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
state and zip: |
|
x*********0
发帖数: 411 | 6 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
AMEX MR points 7*[email protected]+fee
单张面值:
78K
可接受价格(必须明码标价！):
rate 1.75
物品新旧要求:
邮寄方式要求:
The points will be online transferred to your designated account. In
increment of 10K (1-2 accounts)
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
non cc paypal.
其他补充说明:
只转1-2 帐号
广告的有效期:
until gone
物品来源(Required for All Cards!):
我的联系方式:
站内PM
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
state and zip: |
|
h****a
发帖数: 2095 | 7 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
AMEX MR points 1**[email protected]+fee
单张面值:
188K
可接受价格(必须明码标价！):
rate 1.75
物品新旧要求:
邮寄方式要求:
The points will be online transferred to your designated account. In
increment of 10K (1-2 accounts)
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
BOA
其他补充说明:
只转1-2 帐号
广告的有效期:
until gone
物品来源(Required for All Cards!):
我的联系方式:
站内PM
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
state and zip: |
|
h****a
发帖数: 2095 | 8 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
AMEX MR points 8*[email protected]+fee
单张面值:85K
可接受价格(必须明码标价！):
rate 1.75
物品新旧要求:
邮寄方式要求:
The points will be online transferred to your designated account. In
increment of 10K (1-2 accounts)
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
BOA
其他补充说明:
只转1-2 帐号
广告的有效期:
until gone
物品来源(Required for All Cards!):
我的联系方式:
站内PM
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
state and zip: |
|
q*******s
发帖数: 292 | 9 我想卖的物品:
AMEX MR points 1**[email protected]+fee
单张面值:120K
可接受价格(必须明码标价！):
rate 1.75
物品新旧要求:
邮寄方式要求:
The points will be online transferred to your designated account. In
increment of 10K (1-2 accounts)
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
Wellsfargo, Paypal, ING
其他补充说明:
只转1-2 帐号
广告的有效期:
until gone |
|
h****a
发帖数: 2095 | 10 二手交易风险自负！请自行验证是否合法和一手卡！:
我想卖的物品:
AMEX MR points 8*[email protected]+fee
单张面值:85K
可接受价格(必须明码标价！):
rate 1.75
物品新旧要求:
邮寄方式要求:
The points will be online transferred to your designated account. In
increment of 10K (1-2 accounts)
买卖双方谁承担邮寄损失(Required if not code only):
付款方式说明:
BOA
其他补充说明:
只转1-2 帐号
广告的有效期:
until gone
物品来源(Required for All Cards!):
我的联系方式:
站内PM
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
state and zip: |
|
p***s
发帖数: 169 | 11 手头已有的
- UA 19.7K
- Chase UR (可转UA等的) 17.4K
- SPG 64.7K (准备转AA来着)
- AA 61K
- AMEX UR还有21K的残点... 大概会接着攒。
Chase的点转UA的话，我也可以弄个UA的小号整个号转掉。
转AA的话，就不转账号，只供出票用了，AA这个月结束应该会有110K攒够。
SPG眼瞅的可以下一个bill出来可以达到80K，是想转AA走机票的——这样子AA一共会有
210K+
Chase和AMEX UR都没啥更大的期待了，incremental的增加个几千点而已...
暂时还没关注现在的售价。不过我也是后款过264K AMEX和65K UA mile的人了
到时候足数了，还请有兴趣的买主劳烦照顾一下 lol |
|
t*********u
发帖数: 26311 | 12 二手交易风险自负！请自行验证是否合法和一手卡！:
y
我想卖的物品:
Cricket帮忙付bill up to $200
单张面值:
up to $200, $100 incremental
可接受价格(必须明码标价！):
9折
物品新旧要求:
new
邮寄方式要求:
n/a
买卖双方谁承担邮寄损失(Required if not code only):
board rule
付款方式说明:
non cc pp
其他补充说明:
广告的有效期:
物品来源(Required for All Cards!):
我的联系方式:
bbs mail
Warranty期限:
能否证明是合法的一手卡?(Required for All Cards!):
state and zip: |
|
发帖数: 1 | 13 TOYOTA CAMRY LE 2011 FOR SALE BY 1ST OWNER, ONLY $9900, 87K MILES. CLEAN
HISTORY
2011 Toyota Camry LE, only 87xxx miles, daily driver so will go up
incrementally. Super clean, excellent shape. 4cyl, perfect for commuting,
garage parking, one owner.
Camry le in gray color for sale. Has very nice and smooth ride with power
engine and transmission.it is very clean car inside and outside. has
everything is perfect condition. plz 703909 five eight zero zero call /
Car location is Rockville, md 20852.... 阅读全帖 |
|
s*l
发帖数: 10 | 14 "Myth #3: Oil doesn’t matter. Every time oil prices go up, we are always
subjected to the same dismissive cop-out: Since the energy efficiency of US
GDP has continued to improve, the role of oil in shaping both production and
consumption has steadily diminished. As such, the impact of a given increment
in oil prices is not what it used to be. So don’t worry.
I have never bought this one either. The record is pretty clear on this risk
factor: Each of the five recessions since the early 1970s has |
|
s****n
发帖数: 700 | 15 最近为这个问题很烦恼。
学生的时候没有往roth里边投钱，现在后悔死了。
我的情况是已婚， 我们今年总收入估计在$190000. 我没有401K, 我老婆有。
我担心的是我max out我老婆401K后， 我们的收入还是大于$166000. 这样是不是我不仅
roth ira不能投， 普通IRA也不能投了。 不知道这种情况下，我投些钱去children
education fund能不能起点作用。
我现在就想尽量多存401K和IRA,能在2010年把他们都转成roth IRA就最好了。
401K contribution limit
# 2009 - $16,500
# 2010 - $16,500 plus an index for inflation ($500 increments)
这样两年我可以放$33500, 我的问题是这些钱能全部roll over to ira,然后在2010转
成roth IRA么.
如果说我还有资格投ira,每年$5000.
这就是说我在2010年能有$43500转成ROTH, 不知道我算得对不对。 |
|
s********n
发帖数: 1962 | 16 Certain good funds are closed to new investors. Some funds may
have a very high initial investment requirements or minimum
increment requirements. These issues usually don't exist in your
401k plan. |
|
n******h
发帖数: 2482 | 17 It's true. However it's virtually impossible to time the market at every
turn. The best strategy is to buy incrementally at every possible point.
If gold drops 200 points from here it only means it's on sale and it's time
to load it up. |
|
y****i
发帖数: 17878 | 18 official answer
http://www.treasurydirect.gov/indiv/research/faq/annualpurchase
"Why is there a purchase limit on savings bonds?
The purpose of the savings bonds program is to provide individuals with a
way to save or invest relatively small amounts of money in non-marketable
Treasury securities. Individuals with saving or investment needs in excess
of the savings bond purchase limit who desire the safety and stability of
Treasury securities may purchase marketable Treasury securities (bills,
no... 阅读全帖 |
|
r****m
发帖数: 1204 | 19 "想来想去，我还是觉得IUL是好东西。我明白前几年我不会赚钱。但是一旦有了这个工
具，我将来的钱可以多余时放入投资，需要时拿出。应该值得我现在走资啊。"
Based on your comments above, I can safely say:
1. You still don't know IUL (you don't know what you don't know)
2. Your agent didn't explain this to you (either s/he doesn't know or doesn'
t want to tell you).
First of all, the high cost/low return discussions above should already
clearly tell you that IUL's cash value will be significantly less than the
other alternative (Term+Index ETF), there is no arguments on that... 阅读全帖 |
|
r****m
发帖数: 1204 | 20 是的， 吃现成的吃惯了， 呵呵。
不过还是觉得incremental efforts will be pretty small. |
|
y*******g
发帖数: 6599 | 21 一个table中的key是auto increment, 从1到十万
随机删除一 row
要求写出sql语句找出被删的row的key
不用sql的话是老题目了,把数字加起来或者xor什么就好了.
用sql还能做这个么? 要怎么写?
谢谢 |
|
s*r
发帖数: 2757 | 22 i heard those lawyers have a very highly hourly rate and they bill you in
the increment of 15 min. |
|
B*****t
发帖数: 335 | 23 1. sort each array according to the appearance in the paper.
2. create a queue with 3 size_t var(ct1, ct2, ct3), which count
the number of each word(all init to 0's), and 2 pointers to rear
and front.
3. enqueue the element with smallest value in the 3 arrays, and
move the array pointer accordingly, and increment cti
accordingly. Suppose ct1 is just increased by 1:
3.1 if one of cti is 0, go back 3.
3.2 Check the front pointer. If it points to the same word
as just enqueued, pop the fron |
|
u*l
发帖数: 1943 | 24 offer letter 上写的：
You will receive a new hire stock option grant of 4000 options. The strike
price will be the closing price on your first day of employment (date of
grant).
These shares will vest over a four-year period as follows: 25% on the first
anniversary of the date of grant and in monthly increments over the
following three years.
All shares are governed by the language in our stock option plan (a copy of
which will be mailed to you separately) and Insider Trading rules.
看起来是一年1000股，连续4年 |
|
K******C
发帖数: 230 | 25 int j=0;
int x=j++ + j++ + ++j + ++j +j +j++ ；
x是多少
int j=0;
j=j++ + j++ + ++j + ++j +j +j++ ；
j 是多少 |
|
|
|
|
|
|
A*********r
发帖数: 564 | 31 我怎么觉得没有那么复杂啊，貌似复杂度就是sort的复杂度 。。
用楼主的例子:
seq1: ABCDEFG
seq2: DBCAPFG
可以得到seq2中每个字母在seq1对应的坐标依次为， O（n)可以实现吧。
3 1 2 0 -1 5 6
P字母没有在seq1里面出现，所以标记为-1, 然后sort这个坐标组里面足用-1分割开的
每个段，变为
0 1 2 3 -1 5 6
然后找最长的strictly increment 的一组数就可以了。。
关于这个间隔sort的可行性和复杂度，可以再讨论一下。。
( |
|
b********e
发帖数: 693 | 32 Most frequent path of 3 websites.
Given a log file, which contains a series of websites, which the user has vi
sited, find the most frequent path of 3 websites.
e.g: If this is a log file
A B C D E
A C D B E
C D E B A
A C D E B
C D E A B
Clearly, C D E in the most frequent website?
First I said graph, then I said hash table. Hash every 3 consecutive web sit
es and increment in Hash Table. Parse through HT and keep a variable which s
tores the max value you get the answer. |
|
f****g
发帖数: 313 | 33 Thanks for sharing! This is actually very good DP interview question.
The naïve approach:
We create an array C[m] to keep track of the number of guests at each time
point.
For each guest entry [x,y], we increment C[i] for x<=i<=y;
The largest number in C[m] is the maximum guest at that point.
Overall it takes O(nm) + O(n) time and O(m) space.
The DP approach:
We create two arrays En[m] and Ex[m] to keep track of the total number of
guests entered this party and left this party at the ti |
|
L*******e
发帖数: 114 | 34 I know for y=x++, definitely a temp variable holds the old value.
How about this: for(int i=0;i<100;i++) or even simpler i++?
From the claim from http://www.gotw.ca/gotw/002.htm, but I do not agree this claim, why a temp var is created but not used at all? see the following sample program and generated assembly.
Any thoughts?
int i = 0;
i++;
++i;
int k=i++;
assembly generated by g++:
movl $0, -12(%ebp) #, i
addl $1, -12(%ebp) #, i
addl $1, -12(%ebp) |
|
z***9
发帖数: 696 | 35 depends on if you use -O2 or O3 with g++ |
|
r**u
发帖数: 1567 | 36 i++，先要用额外的地方存原始值，返回这个值，然后＋1。
++i，就直接在原来的地址＋1，然后返回。
理论上++i，快一点。不过好像compiler已经都optimize了，
i++也不会要额外存原始值。
有人说如果i是iterator，difference会比较大。 |
|
h**k
发帖数: 3368 | 37 如果用在for循环语句里，i++和++i是一样的，被编译器直接优化了，都不生成临时变
量。 |
|
h**k
发帖数: 3368 | 38 在老编译器上，可以同时使用++i和i++的情况下，毫无疑问的使用++i更好，原因就是i
++需要生成临时变量。最新的编译器已经优化了，没有区别。
使用inline函数的缺点是执行代码变大了，这需要更大的内存，同时也增加了page
fault的可能，这往往会减慢程序的运行。 |
|
I*******l
发帖数: 203 | 39 How about using one hash table together with one array? The hash table can
be used to support O(1)-time insertions and deletions and use the array for
getRandom. Basically we maintain an array (or more precisely, a dynamic
array) of pointers for the integers in the set and a counter k for how many
integers the hash table currently contains. We will also store the index of
an element in the array in the hash table of that element. When an integer
is inserted, we add a new entry to the end of the ... 阅读全帖 |
|
I*******l
发帖数: 203 | 40 How about using one hash table together with one array? The hash table can
be used to support O(1)-time insertions and deletions and use the array for
getRandom. Basically we maintain an array (or more precisely, a dynamic
array) of pointers for the integers in the set and a counter k for how many
integers the hash table currently contains. We will also store the index of
an element in the array in the hash table of that element. When an integer
is inserted, we add a new entry to the end of the ... 阅读全帖 |
|
P********l
发帖数: 452 | 41 done利用已知的最大长度来跳过不必要的比较,觉得应该是最优的解法了。
但是代码上还可以改进：
int maxLength(int[] arr) {
if (arr.length < 2)
return arr.length;
// at least, the length contiguous incremental sequence
is 1.
int maxLen = 1;
// checking using the known maximum length
for (int i = maxLen; i < arr.length; i += maxLen) {
// i-maxLen is the starting position of the
sequence, so,
// invariant: arr[i-maxLen-1] >= arr[i-maxLen]
if (arr[i - 1] >... 阅读全帖 |
|
h*****g
发帖数: 944 | 42 Q1. Which of the following statements about the const qualifier is false?
a) A const variable much be initialized during declaration.
b) no explicit cast is required when converting from non-const to const
c) It is not legal to declare a variable both const and volatile
d) Const pointers are allowed in C
这个是不是选a啊?
Q2. Safe Programming Question
Which of the following will not have undefined behavior?
a) x+= ++i + ++i;
b) i+= ++i;
c) x += ++i;
d) x += ++i + --i;
貌似都能跑啊？到底啥叫underdefined behavior?
Q... 阅读全帖 |
|
z*s
发帖数: 209 | 43 I mean the former one. given a bunch of numbers and create such a bst (
unbalanced).
My method is to use a regular recursive bst node insertion http://en.wikipedia.org/wiki/Binary_search_tree#Insertion, set numOfDescendents of the newly added node to 1 and increment numOfDescendents of the nodes along the insertion path by 1. |
|
g*********s
发帖数: 1782 | 44 with unbalanced bst, you can't query the median in O(lgN). so the bst you
created doesn't meet the requirement of (2).
for creation of a balanced bst, there's extra work to do. that's why i say
it's not straightforward.
http://en.wikipedia.org/wiki/Binary_search_tree#Insertion, set
numOfDescendents of the newly added node to 1 and increment
numOfDescendents of the nodes along the insertion path by 1. |
|
g*******s
发帖数: 490 | 45 这边的c sample question
http://www.bestsamplequestions.com/technical-questions/c-sample-questions/c-sample-questions.html
列一下我发现的错误
第8
system dependent, be cautious of all sizeof questions, most of them are
system dependent
第10
system dependent, depends on the size of int
第11
compiler dependent
it's fine. 其实即使function的argument是数组形式，compiler也会自动改成指针，
just remember array is always
passed by its pointer in function calls
第16
won't print anything, 两个指针都没有allocate memory
第18
for declaration, it is not g... 阅读全帖 |
|
j*****u
发帖数: 1133 | 46 "for example, you can use String[] to store lines in a page. then search for
a particular line is constant time"
why this is constant not liner?
You could use a LinkedList or incremental array (e.g. List) + an
index like hash table or tree that provides better search than liner |
|
j*****u
发帖数: 1133 | 47 okay... I thought you meant searching "by line string". If what you wanted
is searching "by index" then it is accessing by index not searching.
Then simply an incremental array (e.g. vector,List,ArrayList) will do it.
internally, copy happens when the array is full but on average the inserting
is constant
number
insert |
|
t**d
发帖数: 352 | 48 BST is a good idea. any other ideas?
incremental array won't work since worst for insert is still linear. |
|
i**********e
发帖数: 1145 | 49 你的解法可以再 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... 阅读全帖 |
|
p*********b
发帖数: 47 | 50 9，Unix file path化简，写code
例如 /a/./b/../../c/ ，化简为 /c/
用stack或者d-queue，有些细节需要考虑，例如 /..//.. 还是输出 /
这题不需要额外的数据结构，从尾部向前反过来做。
我之前写的代码
/* The algorithm runs in O(n) time and O(n) space
* It works backwards so that no stack or other buffer is
* needed to skip the parents folder if a "../" is encountered.
* "//" is preserved as is, and "/./" is changed to "/
* I was able to do a inplace version, but string cut and cat are
* essentially array element revomal, which will make running time
* O(n^2).
*
* My ... 阅读全帖 |
|
