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

Created by Doug Hull

Solve Later

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

Last solution submitted on Aug 23, 2019

Last 200 Solutions

Problem Comments

5 Comments

5 Comments

Show 2 older comments

Richard Zapor on 10 Jun 2012

I think test suite 3 produces 4 positives, not 3.

Aurelien Queffurust on 11 Jun 2012

I agree with the above comments

Doug Hull on 11 Jun 2012

Oops. Fixed. thank you.

Pavan Toraty on 25 Oct 2014

Test suite 3 doesn't seem to be correct. Total windows possible in this case is 2. How can number of positive windows be greater than that. Someone please clarify.

Shalexis Casimiro on 20 Dec 2017

cool

Solution Comments

Solution 715240

2 Comments

2 Comments

Nicholas Hortance on 15 Aug 2015

e what they mean by window so if someone could explain that would be greatly appreciated.

suneel kumar Gaddam on 16 Nov 2016

Window is how many numbers you are adding together for every position

Solution 133608

2 Comments

2 Comments

Will on 21 Dec 2012

cheat - does not solve the problem

Doug Hull on 26 Dec 2012

Added new test, should be re scored soon. Thank you!