Transaction Segments

goldmansachs

Given an array transactionValues of length n, where transactionValues[i] represents the transaction amount at time i. Count the number of strictly increasing segments of length exactly k in the array....

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: