Find the Runner-Up Score!

  • + 0 comments

    Max is O(n), where n is the size of the list. https://wiki.python.org/moin/TimeComplexity

    This is O(n^2) altogether.