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

  • shubhamgoyal1101 + 4 comments

    python 3 code, easy to understand :) . It takes linear time 

    def solve(a):
    # Complete this function
    summy=sum(a)
    l=len(a)
    lefty=0
    for i in range(len(a)):
        current=a[i]
        summy-=current
        if lefty==summy:
            return 'YES'
        lefty+=current
    return 'NO'
    • martinberoiz + 0 comments

      loved it

    • Ajey01 + 0 comments

      great !!! best solution ..

    • nicmakaveli + 1 comment

      I had a similar idea, but yours is way better. Helped me figure out why mine was so slow:

      def solve(a):
    # Complete this function
    if len(a) == 1:
        return "YES"
    for i in range(1, int(len(a)+1/2)):
        left = sum(a[:i])
        right = sum(a[i+1:])
        if left == right:
            return "YES"
            break
    else:
        return "NO"

      Instead of computing the sum each time, just subtract. Way more efficient. Thank you for sharing.

    • mike_buttery + 0 comments

      Nice work!

      My first try was to sum both sides of the pivot and I timed out

      Then realised sum the whole array and + / - the pivot

      I iterated over the array rather than use indexes

      def balancedSums(arr):
    leftsum = 0
    rightsum = sum(arr)
    for n in arr:
        rightsum -= n
        if rightsum == leftsum:
            return 'YES'
        leftsum += n
    return 'NO'