SF startup 面经

This is a simplified version of a real problem we encountered.

Your solutions will preferably be implemented in Go. We'll also consider
solutions implemented in Python (or other languages on request), but since
Go can be learned in approximately a day, we really do prefer a solution
written in Go.

We're building a directed graph.

The graph consists of Nodes connected by Edges.

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

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

etica, sans-serif">We recommend to build on top of https://github.com/google/btree/ but are
interested to hear if you have a different take.




这个题目可能红黑树或者双向链表就可以了,分享

楼主这是什么公司 ? 能站内信吗?