Second most repeated word in a sequence
Given a sequence of strings, the task is to find out the second most repeated (or frequent) string in the given sequence. You may assume that no two words are the second most repeated, there will be always a single word.Examples: Input: ["aaa", "bbb", "ccc", "bbb", "aaa", "aaa"]Output: bbbExplanatio