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?
Solution Stats
Problem 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
Show commentsProblem Recent Solvers847
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
47577 Solvers
-
Least common multiple of many numbers
227 Solvers
-
440 Solvers
-
8380 Solvers
-
Getting the indices from a vector
8946 Solvers
More from this Author51
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!