1. Priority判断
如果要设计一个发送notification的system,同时有几个product,怎么判断priority
2. 流失用户的召回
想要通过发送“提醒回来继续玩游戏“的邮件来赢回user,怎么判断应该多久之后发,怎么判断这个是否成功的赢回了user
3. List中的重复数字
找出list中第一个重复一次的数
4. 寻找配对
[(1,left,red),(2,left,black),(3,right,black)],返回left和right配对的element,[(2,3)]
5. Jump Game
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
Return true if you can reach the last index, or false otherwise.
Return true if you can reach the last index, or false otherwise.