Python and data for quants
A rolling mean, faster, part 2 of 3
A rolling mean, faster · Part 2 of 3
You compute a 50-day rolling mean over a list p of 1,000 prices, producing one value for each full window. Count one read each time a price is fetched from the list.
A running sum reads the first window once, then for each later window adds the price that enters and subtracts the one that leaves. How many reads does it make?
Answer with a number. Fractions, powers and expressions like 23/6 or C(52,5) are read correctly in practice.
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
Performance: profiling, vectorising and when to leave Python
More python and data for quants questions
- Profiling shows 60% of runtime in one function.Applied · Premium
- A NumPy array is C-ordered. Which loop is faster: summing along rows or along columns?Advanced · Premium
- You test x in container millions of times against a fixed collection of 100,000 ids.Foundation · Premium
- A backtest computes pnl = signal * returns, where both are indexed by day. What is wrong?Applied · Free solution
- You need the quote in force at the instant of each trade. Which join?Applied · Free solution
- An equity curve runs 100, 120, 90, 110. What is the maximum drawdown, as a decimal?Foundation · Premium