Second most repeated character in a sequence

[SKAUL05]

This PR is about adding an algorithm which would find the second most repeated character in a sequence

[onlinejudge95]

How about generalizing the algorithm to find kth most repeated character in a sequence

[SKAUL05]

How about generalizing the algorithm to find kth most repeated character in a sequence

@onlinejudge95 Changed to support nth repeated

[SKAUL05]

@onlinejudge95 Changes done

[cclauss]

The algorithm is a one liner...

def count_repeated(sequence: list, nth_repeated: int) -> str:
        return "" if nth_repeated < 1 else Counter(sequence).most_common()[nth_repeated - 1][0]

https://docs.python.org/3/library/collections.html#collections.Counter.most_common

[cclauss]

Sorry @ SKAUL05 but closing as this has now become a demonstration of how to use the Python Standard Library rather than an algorithm. Please do not be discouraged because this has been a learning experience. I hope you will make other submissions of algorithms in the near future.