Capital One OA

1. 非常Easy，记不大清楚了
2. Easy, Giving a string, find the longest consecutive substring with duplicate letters, if multiple longest one, get the most right one. return the letter + the length

    Example: ‘aabbbcca’, return ‘b3’

3. Giving a

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

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

bricks. To build the tower to be either ascending or descending, with the height difference between two consecutive elements being 1. Return the minimum number of bricks needed

Is the question of bricks the same as this one? https://stackoverflow.com/questi ... um-number-of-bricks