热带雨林新鲜OA

第一题： Maximum Money in K Consecutive Bags

In Amazon's financial team, an analyst is dealing with an infinite number of bags arranged in a line, each numbered from

1. 1

复制代码

to infinity. The task is to gather information about the amount of money in these bags, presented as

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

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

bags with the maximum total amount of money. Since the answer can be large, return it modulo

1. 10^9 + 7

复制代码

.

第二题是后台AI assisted API debugging。问题是一个dashboard不能新建issue。