Capital One SDE OA

地里都有原题，回馈社区。
​
第一题：Extremely simple.

Given a list of integer, iterate the list and calculate the sum. If sum < 0, reset sum to 0; If sum >= 100, reset sum to 100. Return final sum

第二题：

You are given an array of songs songs, where each song is represented as a string in the following format: <songName>:<songLength>. You are also given an array of animations animations, where each animation is represented in a similar format: <animationName>:<animationLength>. Your task is to select an appropriate animation for each song. Specifically, an animation can only be matched to a song if its length is an integer divisor of the song's length. If multiple animations can fit a song, select the one with the lowest index within the animations array.



Return an array of animations for songs, ordered in the same way as the corresponding songs. Each element of the array must be a string in the following format: <animationName>:<timesToBePlayed>, where timesToBePlayed is the number of times the animation must be played to match the song's length. You can match the same animation to multiple songs. It is guaranteed that an appropriate animation exists for all given songs.



Note: You are not expected to provide the mos

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

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

r the strings are equal or one string ends with another. In other words, find the number of such pairs i, j (0 ≤ i < j < words.length) that words[i] is a suffix of words[j], or words[j] is a suffix of words[i].



Example



For words = ["back", "backdoor", "gammon", "backgammon", "comeback", "come", "door"], the output should be solution(words) = 3.



The relevant pairs are:

1. words[0] = "back" and words[4] = "comeback".

2. words[1] = "backdoor" and words[6] = "door".

3. words[2] = "gammon" and words[3] = "backgammon".

感谢分享