Problem 731. Given a window, how many subsets of a vector sum positive

[1 0 -1 3 2 -3 1]

   1 + 0 =  1
   0 - 1 = -1
  -1 + 3 =  2
   3 + 2 =  5
   2 - 3 = -1
  -3 + 1 = -2

Solution Comments

Problem Recent Solvers870

Suggested Problems

• Find all elements less than 0 or greater than 10 and replace them with NaN

  15779 Solvers

• Omit columns averages from a matrix

  618 Solvers

• 2 b | ~ 2 b

  408 Solvers

• Back to basics 6 - Column Vector

  1102 Solvers

• Find nearest prime number less than input number

  1016 Solvers

More from this Author51

• Decode a simplified barcode

  129 Solvers

• Implement Solitaire cipher for N long deck.

  17 Solvers

• Is this is a Tic Tac Toe X Win?

  530 Solvers

• Getting the indices from a vector

  11774 Solvers

• Solitaire Cipher

  268 Solvers