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?
I think test suite 3 produces 4 positives, not 3.
I agree with the above comments
Oops. Fixed. thank you.
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.
cool
e what they mean by window so if someone could explain that would be greatly appreciated.
Window is how many numbers you are adding together for every position
Find the longest sequence of 1's in a binary sequence.
2439 Solvers
Generate a vector like 1,2,2,3,3,3,4,4,4,4
1561 Solvers
474 Solvers
Check that number is whole number
274 Solvers
204 Solvers