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
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 Solvers857
Suggested Problems
-
Given two arrays, find the maximum overlap
1581 Solvers
-
Number of 1s in the Binary Representation of a Number
455 Solvers
-
344 Solvers
-
Rotate and display numbered tile
354 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
1889 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!