# Implement a sliding window to find the maximum sum of any 3 consecutive numbers in the list [2, 1, 5

Canonical URL: <https://datadriven.io/problems/implement-a-sliding-window-to-find-the-maximum-sum-of-any-3-effcdfb7>

Domain: Python · Difficulty: medium

## Problem

Implement a sliding window to find the maximum sum of any 3 consecutive numbers in the list [2, 1, 5, 1, 3, 2]. Print the maximum sum.

## Related

- [All practice problems](https://datadriven.io/problems)
- [Mock interview mode](https://datadriven.io/interview/implement-a-sliding-window-to-find-the-maximum-sum-of-any-3-effcdfb7)
- [Python Interview Questions](https://datadriven.io/python-interview-questions)
- [Data Engineering Interview Prep Guide](https://datadriven.io/data-engineer-interview-prep)
- [Daily Challenge](https://datadriven.io/daily)

---

Source: DataDriven (https://datadriven.io). 100% free data engineering interview prep. Live code execution against Postgres 16, Python 3.11, and Spark sandboxes. No paywall, no premium tier, no signup gate.