m**y
发帖数: 191 | 1 Basically you are a temp. You will be assigned to the client site for 1 year
based on so-called "orally" promise.
Usually, the client, which maybe a big company like Citi or GS, has policy
that 1/1.5 year is the maximum period they can use you. After that, they
need to evaluate whether to hire you as full-time or they need to adhere to
the policy and dump you if any unexpected event occurs, such as budget
constraint, your performance, reorganization and so on.
BE CAREFULLY about this kind of job |
|
k***e
发帖数: 556 | 2 1. your example already gives one case: space constraint
the other case, for the problem size is not infinte, sometimes the const
before the bounds should be considered
用i
overl |
|
S**Y
发帖数: 136 | 3 space constraint是的,
但是有一个算法是: 对于sort数目比较多的数,先用merge sort或者quick sort, 在
sort数目
比较小的时候部分的时候改用insertion sort, 请问这么做是为什么?应该不是space的
考虑..
谢谢
const |
|
x***y
发帖数: 633 | 4 Actually, a node is always a lower bound for the right tree(<), and upper
bound for the left tree (>=), we can modify that guy program:
if (node->data=data>max) return(false);
// otherwise check the subtrees recursively,
// tightening the min or max constraint
return
isBSTUtil(node->left, min, node->data) &&
isBSTUtil(node->right, node->data, max) |
|
t**n
发帖数: 272 | 5 Given a binary tree, how would you write program for getting mirror image of
tree in O(n) time? Is it possible ? Assume you have no constraints on space.
我只能想到递归:
Mirror(Node* p){
Mirror(p->left);
Mirror(p->right);
ExchangeLeftRight(p);
}
这个复杂度应该怎么算? |
|
c******k
发帖数: 1251 | 6 http://microsoftjobsblog.com/zen-of-pm/
1. ask lots of questions to understand WHO are the customers, what are their
needs/problems/priorities
2. brain storming lots of good ideas
3. ask constraints to narrow down and prioritize your solutions
suggest do some mock interviews and practice on white board
good luck |
|
h**k
发帖数: 3368 | 7 这题在横向移动距离是实数时，实际上是一个典型的covex optimization问题。即假设
每种地形横向移动距离是x_i，则问题抽象为
minimize sum( 每种地形上所需要的时间 ),
where i-th地形上所需要的时间 = (x_i*x_i+w_i*w_i)^(1/2) / v_i
subject to constraints:
sum( x_i ) - offset = 0.
.. |
|
t*******e
发帖数: 274 | 8 来自主题: JobHunting版 - 问道编程题 最近遇到的一道题，用java实现，结果要是在单个class内，还要有test case验证，有
人知道么？
题目： Given a set of retrofitting options (String name, double cost, double
benefit), and a budget, produce the highest benefit subset whose total cost
fits within the budget. Repeat this exercise, given a set of mutual
exclusivity constraints (i.e. measure X and measure Y cannot be used
together) |
|
e******n
发帖数: 144 | 9 帮我看看？
OBJECTIVE
Seeking a permanent and full time mechanical engineering position where my
knowledge in fluid mechanics,
alternate energy systems, power plant reactors, shock/vibration analysis,
and thermal analysis can be applied.
EDUCATION
xx University School of Engineering
Graduation Date: May 2010
Major: Bachelor of Science in Mechanical Engineering with an Energy System
Concentration
GPA: 3.0
EXPERIENCE
Missiles Launch Research Rutgers, Department ... 阅读全帖 |
|
y*c
发帖数: 904 | 10
我做过two constraint 0-1 knapsack跟one dimension 解法类似。多重背包不知道一
样不一样。 |
|
t****n
发帖数: 263 | 11 if enrollment has the right unique constraint, then
SELECT COUNT(DISTINCT s.SID) - SUM(CASE WHEN c.cid IS NOT NULL THEN 1 ELSE 0
END)
FROM students s
LEFT JOIN enrollment e
ON s.SID = e.SID
LEFT JOIN courses c
ON c.cid = e.cid
AND c.cname = 'Math'
enrollment( |
|
v**a
发帖数: 84 | 12 还是GE global research center
说"there are some constraints around our financial system and the potential
candidates start date"
"If we made you an offer would you be able to accept the offer before Oct
xxth and start no later than November xxth"
我11月要回国的嘛……
怎么回答呢？ |
|
a***c
发帖数: 2443 | 13 the problem doesn't look like it's set up right. needs more constraints to
make a meaningful problem.
Does the original question say you can't race 49 cars all at once? |
|
b***e
发帖数: 39 | 14 Our company (ADM, Archer Daniels Midland) has an immediate opening of
Assistant Program Director in Project Cornerstone with accounting/Finance/
business/IT background and familiar with JDE (preferred) or ERP. We would
sponsor H1B for the right candidate of this position. Relocation and
complete benefit package will be provided. Competitive salary. Contact my
mitbbs ID if you have any question.
General
ADM Accounting has experienced significant growth and an increase in demand
for our services. ... 阅读全帖 |
|
f****g
发帖数: 313 | 15 Hey, todayzj
Could you share the link for the discussion? I tried several key words, and
but
I still cannot find it..
I think without the constraints of keeping the same order of the elements,
it
is easy to be done in O(n) time and O(1) space ( refer to the implementation
of
qsort) |
|
n****t
发帖数: 241 | 16 我看到貌似正确的一个解法，加了很多限制条件。。。
面试题之二叉搜索树的中位数 收藏
这个问题不算是很常见的问题，基本上在中文的论坛社区没有看到过，遇见这个是因为
偶尔在http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi 上面注册了账号而看到的，题目如下：
Given a BST (Binary search Tree) how will you find median in that?
Constraints:
* No extra memory.
* Function should be reentrant (No static, global variables allowed.)
* Median for even no of nodes will be the average of 2 middle elements and
for odd no of terms will be middle element only.
* Algorithm should be efficient in terms of comple... 阅读全帖 |
|
S*******e
发帖数: 118 | 17 The 0-1 knapsack can be reduced to this problem when some constraints in
this problem are removed. For each item in the knapsack problem with weight
w and value v, construct w words and v sentences that contain exactly these
w words. Then whether we can cover n sentences with max-weight m is
equivalent to knapsack problem.
The major difference is that w and v need to be integers in this problem,
and w is no larger than a constant. This is exactly the condition where 0-1
knapsack can be solved in... 阅读全帖 |
|
c******n
发帖数: 4965 | 18 不对吧， knapsack 里面的weight 都是有同样意义的。
这里的3-word sentence 可以是abc, or def, 当然是不一样的了
constraints in
weight
exactly these
problem,
where 0-1
http://en.wikipedia.org/wiki/Knapsack_problem, section "Dynamic
programming solution".
minor
problem). |
|
y*****a
发帖数: 221 | 19 原题是这么说的
Suppose there is a binary tree having millions of nodes and by mistake one
node has two indegree........(i.e. There becomes a cycle/loop in that tree .
..u have to find that node which is having two indegree....
Constraint is no extra memory can be used and tree representation is in
Linked list format... |
|
P********l
发帖数: 452 | 20 Interesting.
The first problem is similar to one trivial interview question.
Double Squares
A double-square number is an integer X which can be expressed as the sum of
two perfect squares. For example, 10 is a double-square because 10 = 3^2 + 1
^2. Your task in this problem is, given X, determine the number of ways in
which it can be written as the sum of two squares. For example, 10 can only
be written as 3^2 + 1^2 (we don't count 1^2 + 3^2 as being different). On
the other hand, 25 can be writ... 阅读全帖 |
|
P********l
发帖数: 452 | 21 3rd:
Studious Student
You've been given a list of words to study and memorize. Being a diligent
student of language and the arts, you've decided to not study them at all
and instead make up pointless games based on them. One game you've come up
with is to see how you can concatenate the words to generate the
lexicographically lowest possible string.
Input
As input for playing this game you will receive a text file containing an
integer N, the number of word sets you need to play your game agains... 阅读全帖 |
|
i**********e
发帖数: 1145 | 22 I think your method is more complicated than is needed.
The problem has a constraint that only 0's and 1's exist in the array.
We could use two counters to keep track of number of 0's and 1's met so far, and do a one-pass traverse across the array.
The length of the maximum size contiguous array with equal number of 0's and 1's must be:
2 * min( count of 0's, count of 1's ).
I know, it might seem too simple to be true, but sometimes being simple is also a virtue.
一些常见面试题的答案与总结 -
http://www.ihas1... 阅读全帖 |
|
a*****9
发帖数: 790 | 23 【 以下文字转载自 BayAreaJobSeekers 俱乐部 】
发信人: amy2009 (benben), 信区: BayAreaJobSeekers
标 题: multiple openings in ASIC design(Santa Clara)
发信站: BBS 未名空间站 (Sat Feb 12 22:57:21 2011, 美东)
DFT:
Know details about the tap controller, scan, ATPG, ATE test, etc
good understanding and hands on experience in certain DFT field.
quick, have the knowledge of DFT, good team player
Digital Design:
RTL coding, micro-architecture, Verilog,
quick hands, easy to get along with, good team player.
... 阅读全帖 |
|
i****c
发帖数: 102 | 24 some of them:
·given an array, each element is a string pair: the first string is a
parent node, and the second is a child node. construct a binary tree
·OO design: design a restaurant reservation system， tic-tac-toe and its
implementation
·how to evaluate search engine results (enum all metrics you can think of,
e.g., recall and click)
·synchronization of hashmap
·sorting integer (large range) with limit memory
·given a int array, check whether there is an element in array satisfying A
[i]=i, c... 阅读全帖 |
|
c*********n
发帖数: 96 | 25 有谁想到亚马逊工作需要引荐的？我可以帮忙递简历。把简历站内发给我。
Amazon’s Transportation Team is looking for Software Engineers. Amazon.com
stores and sells millions of unique items through its Fulfillment Centers (
FCs). These items are shipped from tens of thousands of vendors into the
many FCs in the Amazon network. We need different quantities of each of
these items, we need to pick them up from the vendors at different times,
and bring it into the FCs at specific times depending on the priority of the
items. Each item ha... 阅读全帖 |
|
a**m
发帖数: 151 | 26 You have to paint N boards of length {B1, B2, B3… BN}. There are K
painters available and you are also given how much time a painter takes to
paint 1 unit of board. You have to get this job done as soon as possible
under the constraints that any painter will only paint continuous sections
of board, say board {2, 3, 4} or only board {1} or nothing but not board
{2, 4, 5}.
know it could be solved by DP. But solution space seems quite big. What is
the optimal solution? Thx. |
|
g*******s
发帖数: 490 | 27 简单的数据操作可行，但是cascade的操作，包括constraint requirement的check很难
做，数据的完整性很难保证吧。。
而且题目说server上不能run任何程序。。那这个都没法实现= = |
|
i**********e
发帖数: 1145 | 28 My code for 9).
string extractUntilDelim(string s, int i, char delim) {
int n = s.length();
string ans;
for (int j = i; j < n; j++) {
if (s[j] == delim)
return ans;
else
ans += s[j];
}
return ans;
}
// constraint: path must begin with a '/'.
// "/var/www/html/../.././lc" -> "/var/lc/"
// "/../../ -> "/"
string simplifyUnixFilePath(string path) {
deque directories;
int n = path.length();
for (int i = 0; i < n; i++) {
char c = path[i];
if (c == '... 阅读全帖 |
|
i**********e
发帖数: 1145 | 29 Solution for 7):
// constraint: n is a positive integer.
// returns the integer part of the square root.
// uses a modification of the binary search.
int sqrt(int n) {
assert(n > 0);
int lo = 1;
int hi = n/2;
while (lo < hi) {
int mid = lo + (hi-lo+1)/2;
int k = mid*mid;
if (k <= n)
lo = mid;
else
hi = mid-1;
}
return lo;
}
一些常见面试题的答案与总结 -
http://www.ihas1337code.com |
|
i**********e
发帖数: 1145 | 30 My code for 9).
string extractUntilDelim(string s, int i, char delim) {
int n = s.length();
string ans;
for (int j = i; j < n; j++) {
if (s[j] == delim)
return ans;
else
ans += s[j];
}
return ans;
}
// constraint: path must begin with a '/'.
// "/var/www/html/../.././lc" -> "/var/lc/"
// "/../../ -> "/"
string simplifyUnixFilePath(string path) {
deque directories;
int n = path.length();
for (int i = 0; i < n; i++) {
char c = path[i];
if (c == '... 阅读全帖 |
|
i**********e
发帖数: 1145 | 31 Solution for 7):
// constraint: n is a positive integer.
// returns the integer part of the square root.
// uses a modification of the binary search.
int sqrt(int n) {
assert(n > 0);
int lo = 1;
int hi = n/2;
while (lo < hi) {
int mid = lo + (hi-lo+1)/2;
int k = mid*mid;
if (k <= n)
lo = mid;
else
hi = mid-1;
}
return lo;
}
一些常见面试题的答案与总结 -
http://www.ihas1337code.com |
|
c******w
发帖数: 102 | 32 经过半年多的征战，现在总算要进入尾声。 为了回馈jobhunting版， 特发面经，感谢
所有对我有过帮助的战友们，并希望后来者都能有好的offer。 声明： 谢绝某些喜欢
吓唬小mm的WSN来看贴，要看去火星看。
某Palo Alto公司（P）：
Interview 1:
1. 两个sorted array, 如果merge成一个array。
2. 如果这两个array没有sort呢？并分析复杂度。
3. 如果有K个没有sorted的array怎么办呢？
4. 如果当前机器有K个cpu， 怎么处理问题3呢？复杂度分析。（考虑
multithreading）
Interview 2：
1． 给定一个array，如何找到两个数字， 他们的和等于一个target number。 需
要提供几种不同的算法，并比较分析。
2． 关于数据库的。 什么是Key， 什么是foreign key。 为什么要用foreign key？
3． 怎么提高数据库查询的速度？ （indexing）。 Indexing是如何实现的。
4． 如果有一个数据库现在运行速... 阅读全帖 |
|
h*****g
发帖数: 312 | 33 You have to paint N boards of length {B1, B2, B3… BN}. There are K painters
available and you are also given how much time a painter takes to paint 1
unit of board. You have to get this job done as soon as possible under the
constraints that any painter will only paint continuous sections of board,
say board {2, 3, 4} or only board {1} or nothing but not board {2, 4, 5}.
用DP 得咋解？ |
|
n**a
发帖数: 12 | 34 Hello,
Amazon.com is looking for experienced engineers with Distributed and
scalable systems background. Please send your resumes to n******[email protected]
Many positions open, location- Seattle, WA
Job description: SDE
Amazon's New Ad Products group is looking for exceptional software engineers
to build sophisticated distributed systems for next generation ad programs.
The New Ad Products group was recently formed to build advertising systems
to address new market segments. This new group within ... 阅读全帖 |
|
r*****t
发帖数: 7278 | 35 Hope you had a nice weekend! Do you know any SQL Developers looking right
now? I have a contract to hire with a top company here in Houston. Below is
the job description. Thank you in advance.
I am ideally looking for someone that has the following skill set:
· 5 years + experience developing and supporting in-house applications in a
deadline driven environment.
· Solid experience with T/SQL development to support ETL designs.
· Ability to interpret execution plans and tailor new requirements fo... 阅读全帖 |
|
s**x
发帖数: 7506 | 36 Given an array A of integers, find the maximum of j-i subjected to the
constraint of A[i] < A[j].
以前讨论过，忘了 mark 了，ihas1337code 上好像还没整理完。
多谢 |
|
r*******n
发帖数: 3020 | 37 Problem Statement
You have been given a list of jewelry items that must be split
amongst two people: Frank and Bob. Frank likes very expensive jewelry. Bob
doesn't care how expensive the jewelry is, as long as he gets a lot of
jewelry. Based on these criteria you have devised the following policy:
* 1) Each piece of jewelry given to Frank must be valued greater than or
equal to each piece of jewelry given to Bob. In other words, Frank's least
expensive piece of jewelry must be valued... 阅读全帖 |
|
s******e
发帖数: 108 | 38 Please contact senior recruiter:
James:
James.Mennella AT gs.com
EHRT - Job Postings Information
Job : 12434
Job Title: Technology, Equity Technology, QA Developer - Analyst/Developer (
SLC)
Location: Salt Lake City
Regular/Temporary: Employee
Job Summary & Responsibilities
The candidate will work in a global team responsible for designing, building
and maintaining test harnesses and software
configuration management toolsets. Systems are high performance, real-time C
++/JAVA/C# systems running ... 阅读全帖 |
|
a*****p
发帖数: 1285 | 39 1面 45分钟 白人哥哥
1. 交流简历的东西 20 分钟
2. 如果你自己写hash table，怎么写（high level）
我说一个key 对应一个value
然后要考虑 collision。然后他说为什么要考虑collision，blahblah
他说cool，不知道真cool 假cool
3. 如何从linkedlist里面找中间的那个
这个貌似没有看到过
我先问他有没有constraints，说没有，然后我就说，一个个搜索，然后放到array里面
拉，然后直接从array里面提取阿
然后他说，不要用其他data strcuture，然后我就说设置一个counter，一个个搜索到
list结尾阿，然后再回来搜
然后他说，如果只用一个pass，然后，hmmmm，我就没答上来，然后问有没有hints，他
说这个题是bonus，不知道真的假的
4. fobonacci
5. 问问题
我觉得我那个linkedlist没答上，他直接就跳fibonacci这种简单题，继续加油了。。
。 |
|
h*********n
发帖数: 11319 | 40 有点好奇，什么样的公司会在去年狂找了一堆人啊？
利，
prefer哪
interview的
Controller
bu
郁闷
opportunit
like
mak
constraint
打过
由于
op
是他
confir
)
fun
自费
底不 |
|
v***n
发帖数: 562 | 41 #3.4
In the classic problem of the Towers of Hanoi, you have 3 rods and N disks
of different sizes which can slide onto any tower. The puzzle starts with
disks sorted in ascending order of size from top to bottom (e.g., each disk
sits on top of an even larger one). You have the following constraints:
(A) Only one disk can be moved at a time.
(B) A disk is slid of the top of one rod onto the next rod.
(C) A disk can only be placed on top of a larger disk.
Write a program to move the disks from th... 阅读全帖 |
|
|
b*******y
发帖数: 232 | 43 是样题，然后还是45分钟倒计时的
可以用各种语言编写
感觉这种题目，用C或者java写是不是编程时间上比不过python？
单单看题目本身也很难啊，像是hannoi，但比它难多了，不知道有什么思路？
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs who have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move ... 阅读全帖 |
|
s***h
发帖数: 662 | 44 来自主题: JobHunting版 - 一个算法题 我碰到一个这样的题目，
You have a map of n cities connected by routes. A route (u,v) has length
d(u,v). you are in city s now and want to go to city t in m days. additional
constraints are:
1. you have maximum travel distance f(d), d from 1 to m.
2. you have cost c(u) to stay overnight in city u.
now it asks you to come up with a plan that
1. starts from s, takes exactly m days to go to t.
2. spending exactly one night at each city you pass.
3. do not travel more than f(d) on day d.
4. minimize the total c... 阅读全帖 |
|
e****t
发帖数: 766 | 45 也报个offer，临床统计， PhD, experienced. 工作从7月份开始找到现在， 主
要是当前工作的公司在裁人，安全起见， 所以开始骑驴找马。 Recruiter 电话很多，
但是到HM 只有5个， 三个onsite， 1 个offer。 也算圆满了。工资少了些， 主要是
离LD 从250 mile 变成 90 mile， 钱不是很重要了。 有点遗憾的是， 绿卡又得从新
开始了。
还记得一些面试题， 回馈本版， 谢谢其他贴面经的朋友。
Linear regression: basic assumptions, how to diagonistic,
if violate any assumption, how to handle
Bootstrap basic idea.
Bayesian theory/Frequetist difference. How to explain to non statistician.
What is empirical Bayesian?
What is difference between logrank test and wilco... 阅读全帖 |
|
g**e
发帖数: 6127 | 46 Please let me know if you are interested. I can forward your resume to HM di
rectly.
This position is in Seattle, WA. It's an experienced hire (level 6).
Job Description
Amazon's Global Retail Catalog Tools team is responsible for developing inno
vative and user-friendly applications to help retail business owners to mana
ge the worldwide retail catalog. Our large scale web applications running o
n distributed systems have direct and critical business impact. We are look
ing for an experienced... 阅读全帖 |
|
e***n
发帖数: 42 | 47 既然是样题，希望能公开讨论一下：这道题像careercup书上Hanoi Tower的一个变形：
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs which have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move consists of picking the topmost disc of any o... 阅读全帖 |
|
k***t
发帖数: 276 | 48 看到一个题和一个答案。不太理解。
1.What does it mean that "tree representation is in Linked list format"?
Is there a standard way to represent a tree with a linked list? Or does it
just refer to the fact that TreeNode has left and right child link/pointers.
2. "When we thread a binary tree while doing preorder traversal, it wont
result in any cycle."
Is there a standard way to "thread' a binary tree? There is no "cycle"
concept at all in normal tree traversal, isn't it?
=======================================
S... 阅读全帖 |
|
r******g
发帖数: 138 | 49 欢迎擅长Java/C++的直接投递简历给我 l*******[email protected]。没有工作年限要求，
Junior/Senior皆可，但需要较好的computer science 以及Java 或者 C++ 基础。
以下是我们组的介绍
Posting Title
MTS Software Engineer - VMware View - CPD
About Us
VMware (NYSE: VMW) is the global leader in virtualization and cloud
infrastructure, two areas that consistently rank as top priorities among
CIOs. VMware delivers award-winning, customer-proven solutions that
accelerate IT by reducing complexity and enabling more flexible, agile
service delivery. Our solutions help... 阅读全帖 |
|
c**********e
发帖数: 2007 | 50 Can anybody look at this problem? The answer seems different from mine. 我觉
得答案不对。
Facebook Hacker Cup 2011 Round 1A
First or Last
As a top driver in European racing circles, you find yourself taking more
than your fair share of risks. You go into every race knowing it may be your
last, but generally with the suspicion it won't be. Today, however, may
turn out to be different. The Fédération Internationale de l'Automobile
has sanctioned a new track in the Bernese Alps that may prove to be death o... 阅读全帖 |
|
