Verily Software Engineer

Verily 海投
是从Google 分出来的公司，在上海有Office，因为上海这个Office刚成立所以目前工作地点就在Google总部。

面试官是一个在Google工作六年的，被调到verily的大佬
先问了一下之前做过的machine learning的东西。。？feature是怎么选的。。？
因为是很久之前的项目，说的不是很好

Google docs写码

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

想了五分钟DP，面试官看一个字没写，开始和我讨论思路，我说2维dp，他说想多了，给了点提示，突然想到是greedy。。他让我证明。随便说了两句之后就开始写了。
从自我介绍到结束是45分钟。
凉了

这道题是普林斯顿cs4里面的一道例题。。。
https://algs4.cs.princeton.edu/43mst/

USA Computing Olympiad problem. In a city there are N houses, each of which is in need of a water supply. It costs w[i] dollars to build a well at house i, and it costs c[i][j] to build a pipe in between houses i and j. A house can receive water if either there is a well built there or there is some path of pipes to a house with a well. Design an algorithm to find the minimum amount of money needed to supply every house with water. -->
Solution.: Create an edge-weighted graph with N+1 vertices (one for each house plus a source vertex x). Include an edge between every pair of vertices i and j with cost c[i][j] (to represent the potential pipes). Include an edge between the source s and every house i with cost w[i] (to represent the potential open wells). Find an MST in this edge-weighted graph.

楼主是在哪里投的这家公司呀?

感谢分享，收藏以后看。

请问老哥结果如何、。 我也拿到面试

dengzeyu147 发表于 2019/09/17 01:36:15
请问老哥结果如何、。 我也拿到面试

挂了
. 1point 3 acres加油不难

You work with a contractor and figure out 后面两句 楼主能详细讲讲吗 貌似有一些字符被吞了 没看懂

能说一下大概怎么做的么

这道题就是minimum spanning tree吧，Kruskal？一个graph，每两个well计算连接他们的cost: cost[i, j] = wellCost[i] + wellCost[j] + connectCost[i, j]; 然后放进PQ；每次poll出来的i and j, 通过union find计算是否已经connect