Find the Runner-Up Score!

  • + 0 comments

    This has very poor time complexity...bcoz you check for max every time and you also use remove which has O(n) time. Hence your code is atleast O(n2).