外卖平台onsite coding面经

// Two dashers (who happen to be best buds) can complete up to n possible ordered pickups on a certain day. These pickups are represented by two arrays of length n, one for each dasher. A pickup is represented by the name of the merchant, for example “chilis” or “albertsons.”


// We could have the following two arrays that represent the pickup jobs for the two dashers:
// dasher1_pickups: [“chilis”, “albertsons”, “walmart”, “albertsons”, “chilis”,

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

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

urger king”]

// Example 2
// dasher1_pickups: [“chilis”, “albertsons”, “mcdonalds”]
// dasher2_pickups: [“burger king”, “jamba juice”, “applebees”]

// dasher1 and dasher2 do not share any of the same pickup jobs, so they do not have any pickup jobs together.

// returns []

dp部分没好好准备，遇到新题有点儿噶。按道理这个dp应该不算难的。

和刷题网 幺幺斯散 好像差不多