We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. All Contests
  2. HourRank 22
  3. Parity Game
  4. Discussions

Parity Game

  • rithinch
     + 0 comments

    Simple Python Solution:

    def smallestSizeSubsequence(n, A):
    total = sum(A)
    result = 0 if total%2 == 0 else 1 if len(A)>1 else -1
    return result