# Given nums = [1, 3, -2, 5, -1, 4, 6] and window = 3, compute the maximum sum of any 3 consecutive el

Canonical URL: <https://datadriven.io/problems/given-nums-1-3-2-5-1-4-6-and-window-3-compute-90031db9>

Domain: Python · Difficulty: medium

## Problem

Given nums = [1, 3, -2, 5, -1, 4, 6] and window = 3, compute the maximum sum of any 3 consecutive elements using a sliding window. Print the max.

## Related

- [All practice problems](https://datadriven.io/problems)
- [Mock interview mode](https://datadriven.io/interview/given-nums-1-3-2-5-1-4-6-and-window-3-compute-90031db9)
- [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.