Dsa
Two Pointers
Warm-up
Find Minimum Consecutive Sum
Given an array of integers, write a function that finds the minimum sum of any two consecutive elements in the array and returns that minimum sum.
Input:
A single line containing space-separated integers. The length of the array will be at least 2 and at most 1000.
Output:
A single integer representing the minimum sum of any two consecutive elements.
Example:
Input:
3 5 1 7 2
Output:
3 (1 + 2) is the minimum sum of consecutive elements.
Key concepts
two_pointersarraysliding_window
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now