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

Given a vector:

[1 0 -1 3 2 -3 1]

and a window of 2,

A sliding window would find:

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

Meaning that three of the windows were positive.

Given a vector and a window, how many of the windows sum to be positive, not zero or negative?

Solve

Solution Stats

43.69% Correct | 56.31% Incorrect
Last Solution submitted on Aug 06, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers851

Suggested Problems

More from this Author51

Problem Tags

asee good

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!