Google SWE L4 Interview

Google Coding Question: Minimum Direction Violations

The question was about a directed graph where each edge could still be used in both directions.

For an edge u -> v:

Moving from u to v costs 0
Moving from v to u cos

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

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

mpler here because every weight is either 0 or 1.

Time: O(N + M)
Space: O(N + M)

points needed