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.
Loading...
  1. Practice
  2. Algorithms
  3. Search
  4. Sherlock and Array
  5. Discussions

Sherlock and Array

  • liyuekui + 1 comment

    No need to sum(arr) at all, that would cause another uneccesary O(n), here's my code:

    def solve(a, size):
    # Complete this function
    difference = 0
    left_index = 0
    compare_count = size - 1
    for i in xrange(size+1):
        if difference > 0:
            difference -= a[compare_count + left_index - i]
        else:
            difference += a[left_index]
            left_index += 1
    return 'YES' if difference == 0 else 'NO'
    • reis_vitore + 1 comment

      Failed Testcase 1!

      • liyuekui + 0 comments

        Thanks for feedback, code was updated and it passed all cases.