Sign Up 注册获取更多干货
查看: 2224|回复: 2

Vmware OA 面经 (附加OJ)

[复制链接] |试试Instant~ |关注本帖
sclookout 发表于 2016-4-23 06:00:02 | 显示全部楼层 |阅读模式

2016(4-6月) 码农类 硕士 实习@VMWARE - 内推 - 在线笔试 |Otherfresh grad应届毕业生


您需要 登录 才可以下载或查看,没有帐号?Sign Up 注册获取更多干货

楼主是招人内推的,从Vmware的邮件来看他们情况是这样的: 有人内推,他们就会让你选择几个职位,然后发给你一个OA。OA做完后,hr会把你的OA分数和简历发给你选择的组。感觉然后基本就是没消息的节奏。。。 60Min OA 六道题。之前有个帖子已经给的比较详细了,为了大家准备我把相应的题的链接贴出来,大家可以提前去hackerank中去准备一下。 第一题:就是Leetcode中买股票问题,只可以买一次卖一次 lc#121原题不同的地方是在非法状态下需要返回-1.
第二题:找出可以被整除的k的subsequence的和 hackerrack搜consecutive-subsequences
第三题:提取出源代码中的注释 hackerrank 搜ide-identifying-comments. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷
第四题:在大量字符串中提取domain url:hackerrank 搜 detect-the-domain-name. 1point 3acres 璁哄潧
第五题:描述很纠结但是其实就是在这道题 hackerrack clique.鐣欏璁哄潧-涓浜-涓夊垎鍦
第六题:完全没有时间读,提的描述是这个样子:Wedding planner: Julia is a wedding planner who puts together phantasmagorical  extravaganza packages for new couples and their guests from 2 to  2,000. Hundreds of items are needed for each event, and Julia has a list  of supplier offers for all these items in various quantities. The price per  unit of every item is highly variable, depending on the supplier, the  number ordered, and the client/buyer who places the order. With her  years of record-keeping, Julia knows the best unit price she can get for  any item in any of a limited number of order sizes. Some items cost less  per unit when the number ordered goes up, some cost less per unit  when the number ordered goes down, and others have no rhyme or  reason for the unit prices available.  To price a new event, Julia consults her database of past offers.  If the amount needed for the new event is exactly the same as the  amount in a past offer, the unit price is also the same.  If she has a price for a higher amount and a price for a smaller  amount, her best guess will be that the unit cost will be linearly  interpolated from the unit costs for the closest lower amount and  the closest higher amount.  If the database only has one amount, then her best guess is that this  will be her unit cost.  And, if the amounts for which she has offers are all smaller or all  larger than the amount she needs, then she finds it most accurate to  linearly extrapolate from the closest two points to the amount  needed.  Finally, sometimes price offers lapse. When this happens, Julia, who  is not very database savvy, just overwrites the old unit price with a  zero or negative number. The amounts associated with zero or  negative unit price need to be disregarded.  automated so she can do it for hundreds of items with thousands of  individual prices.  Complete the function extrapolate , which takes a new amount n, an  array amount of old offer amounts in increasing order, and an array  ucost of corresponding unit prices. Your completed function should give  the expected unit price p for the new amount. The unit prices may  increase, decrease or oscillate, and may also contain invalid values like  0 or negative numbers. Your answer, as well as the unit prices in the  second array, should all be real numbers with exactly two decimal  places, representing dollars and cents. Use standard rounding to arrive  at two decimal places.  Input  A positive integer n, denoting the number if items for which a unit  price is needed.  1.  An array amount of l positive integers denoting the different order  amounts for which historical unit costs exist.  2.  An array ucost of l strings of real numbers denoting the different  unit costs for the corresponding amounts in array a.  3.  Output  A single positive number p with exactly two decimal places.  Note that the code for processing input and output is already present in  the system and designed to be compatible with the test case files used  to score your solution. There is no need to change only of the code other  than the body of the function extrapolate.  Constraints  1 ≤ l ≤ 100  2 ≤ n <= 2000  size(a) = l = size(u)  a(i) < a(j) ⇔ i < j  1  2  3  4  5  n = 25  a = {10, 25, 50, 100, 500 }  u = {"2.46","2.58", "2", "2.25", "3" }  Sample Output #1:  p = 2.58  Explanation #1:  The amount 25 is one of the values in the database. Its corresponding  unit price is 2.58.  Sample Input #2:  n = 2000  a = {10, 25, 50, 100, 500 }  u = {"27.32", "23.13", "21.25", "18.00", "15.50"}  Sample Output #2:  6.13  Explanation #2:  The item count 2,000 is not in the database. It is larger than any amount  in the database. The closest two price points to it are 15.5 for 500 and  18.00 for 100. Linear extrapolation from these two points means  reducing the price by 2.5 for every increase in amount of 400. There 3.75  jumps of 400 from 500 to 2,000, or 4.75 jumps of 400 from 100 to  2,000. The unit price for 2,000 is therefore 15.5 - 2.5 × 3.75 or 18 - 2.5 ×  4.75. Both expressions evaluate to 6.125. This rounds up to 6.13.  感觉上他们家没有招人的意思。祝各位好运。

发现没有权限发链接,只能这么发帖了。本来帖子发在instance里面,发现这里看不到。希望版主谅解。. From 1point 3acres bbs

. visit 1point3acres.com for more.




larry_cn 发表于 2016-4-23 07:09:12 | 显示全部楼层
额 是内推的 全职 也是 这个. 1point3acres.com/bbs
做了 1 2 3 6, 第5题 做了 一半  也是 没消息 . 鍥磋鎴戜滑@1point 3 acres
不知道 有没有 人 有消息
回复 支持 反对

使用道具 举报

 楼主| sclookout 发表于 2016-4-23 07:14:37 | 显示全部楼层
我只做了1 2 3 4 完全没消息。。。 看hr的回复,要等有team感兴趣的话 就会有联系。。。.鐣欏璁哄潧-涓浜-涓夊垎鍦
回复 支持 反对

使用道具 举报



■方法: [hide=200]你想要隐藏的内容比如面经[/hide]


一亩三分地推荐上一条 /5 下一条


custom counter

GMT+8, 2018-3-25 02:15

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

快速回复 返回顶部 返回列表