Sugget you to hold
Vanguard Total Bond Market Idx InstlPls
Vanguard Total Intl Stock Idx InstlPls
Stock fund often raises with DJIA, bond fund against DJIA.
Rebance them every 3-6 months.
Van anybody help to see if I need to change my allocations. This year's
return so far is only 1.48%. Thanks!
Investment option
Allocation %
Stable Value
Minnesota Life General Account
Money Market
Advantus Money Market
General Bond
BlackRock Strategic Income Opps Instl
Columbia Limited Duration Credit R4
Templeton Global Bond A_________20%
Vanguard Interm-Term Bond Index Adm_________5%
Vanguard Long-Term Investment-Grade Adm
US Stock
Advantus S&P 500/Citigroup Growth
Advantus S... 阅读全帖
现在选的FID FREEDOM K 2050 (FFKHX), 有必要改吗?
50% stock + 50% bond 的组合怎么样? 求推荐, 谢谢!
SPTN EXT MKT IDX ADV (FSEVX) 50%
VANG TOT BD MKT INST (VBTIX) 50%
Fund list如下:
Name/Inception Date Asset Class Category 1 Year 3 Year 5 Year 10 Year/
LOF* Returns As Of Bench- mark
FID GROWTH CO POOL
12/13/2013 Stock Investments Large Cap Growth 21.80% N/A N/A 18.79%
07/31/2015 Show
Benchmark: Russell 3000 Growth 16.37% 18.94% 17.76% 15.46 07/31/2015
TRP BLUE CHIP GR T5
09/30/2009 Stock Investmen... 阅读全帖
有如下选择,谢谢! ER ratio都可够贵的。现在选的是TRP RETIREMENT 2050,ER
ratio = 0.75%。不知道有没有更合适的组合。
Name/Inception Date Asset Class Category Gross Expense Ratio**
Shareholder Fees
AF FUNDMNTL INV R6 (RFNGX)
08/01/1978
Stock Investments Large Cap 0.31% No additional fees apply.
ALZGI NFJ DIV VAL I (NFJEX)
05/08/2000
Stock Investments Large Cap 0.71% No additional fees apply.
MAINSTAY LG CAP GR I (MLAIX)
07/03/1995
Stock Investments Large Cap 0.74% No additional fees apply.
VANG... 阅读全帖
I just doubt whether step 4 can be done in nlogn
it is true that the key are sorted. however, the idx corresponds to the key
has no order. Thus you may need to take linear time to find the
corresponding min idx.
I thought I get the nlogn and later found it is wrong ...
how about doing this for question#5:
design a function to hash each line to an integer between 0 to 1G
create a bit map of 1G
read a line and hash it to an idx, set bit idx to 1
read next line , hash it, if that bit is 1, discard
...
int GetNextPrime(){ // substitute this with more excellent algorithm
static int primes[] = {2,3,5,7,11};
static int idx = 0;
return primes[idx++];
}
void PrintFactors(int n){
if (n < 0){
n = -n;
}
if (n == 0){
return;
}
int prime = 1;
while (prime <= sqrt(double(n))){
prime = GetNextPrime();
while (n % prime == 0){
printf("%d ", prime);
n /= prime;
}
}
if (n > 1){
printf("%d ", n);... 阅读全帖
/**
* In an exam you have n problems to work on. i=0, 1, ..., n-1.
The i-th problem takes you x[i] minutes, and give you a score s[i].
You have 60 minutes to work on them. How can you get the best score?
*/
static class DPElement {
int value;
int prevCostIdx; // 0-based cost idx
int takenThisElement; // 0/1, indicating whether taking current
element, idx 0 based.
public DPElement() {
value = 0;
prevCostIdx = 0;
tak... 阅读全帖
我觉得30分钟做出这两道题很不简单啊。
不过这个循环的判断应该是小于等于号吧?
for (int i = 1; i <= str.size(); ++i)
nPermute *= i;
string correspPermute(string& str, int index)
{
set table;
for (auto& c : str)
table.insert(c);
int nPermute = 1;
for (int i = 1; i < str.size(); ++i)
nPermute *= i;
string res;
--index;
for (int m = index; m >= 0; --m) // 这里不应该是index应该是str.size()
{
nPermute /= m;
int idx = index / nPermute;
auto iter = table.... 阅读全帖
The ardendertat.com's code is not always correct. For an example, it will
return 121121121 as the next palin for input 120798387, where there exists a
smaller one: 120808021 .
The following code has no such shortcoming. The key idea is greedy +
heuristic.
#include
#include
#include
#include
#include
using namespace std;
class NextPalinSolution
{
public:
vector NextPalin(const vectorssrc){
vectorsrc(ssrc);
int ... 阅读全帖
06/15电面,ABC+白哥,一开始互相介绍然后讲一下印象深刻的一个project
Problem 1:
问烂的binary tree level print
Problem 2:
interface Sequence{
int size();
Object get(int idx);
void add(Object o);
boolean remove(int idx);
}
写个class implement这个interface
----------------------------------------------------
今天收到recruiter邮件如下,说虽然是positive feedback,但是:
However, I’ve just been informed that we can no longer move forward with
candidates who require a new H1-B visa. We have reached the number of
headcount approved for f... 阅读全帖
Given a decision tree, and lower & upper bounds for each dimension of a d-
dimension space. Find the maximum volume of the d-dimension space and its
lower and upper bounds. 大家有没有优于O(n)的解法?
这题有点绕. 举个两维的例子:
initial range for d0 is (0,10), d1 is (0,10)
Decision tree
idx=1,split=4
/ \
/ \
null idx=0,split=2
d1
10 | |
| |
| |
4 |___|_______________
|
|
|___________________
0 2 10 ... 阅读全帖
Ownership
First Trust Dow Jones Internet ETF 4.82 1.16
4,134,811
277,426
7.19%
Mar 06, 2018
Vanguard Total Stock Mkt Idx Not Rated 2.29 0.01
2,109,721
8,100
0.39%
Jan 31, 2018
Vanguard Extended Market Idx Inv 1.31 0.03
1,206,621
5,048
0.42%
Jan 31, 2018
Polar Capital Global Tech 1.27 0.99
1,171,143
5,400
0.46%
Jan 31, 2018
Sentinel Small Company A 1.16 1.22
1,063,000
0
0.00%
Dec 31, 2017
Total (for Top ... 阅读全帖
呵呵,看看这篇评论,天然气还是很有希望嘛
Today I’m going to discuss three main reasons why natural gas prices (in
the United States) haven’t participated in the commodity boom of 2010.
The first reason is that natural gas prices are loosely tied to oil prices.
Yes, oil prices rose over the past year, but only by about 10%. In order for
oil prices to significantly buoy natural gas prices, we’ll need to see
another huge ramp up like we did in the summer of 2008. Those higher oil
prices (above the $100 mark – as an es... 阅读全帖
/* generate a bunch of "random" numbers
taken in serial one by one from a list of numbers in
a given file
*/
class RandomGen(
public RandomGen() throws IOException {
InputStream ios = ..... open "rand.txt" in CLASSPATH;
//
read the file into memory,
}
int idx;
public Integer gen() {
return list_of_numbers[idx++];
}
}
something like the above.
the problem is that the constructor throws IOException, so if I use this
class, and most likely I us... 阅读全帖