422. Minimum Sum of Adjacent Elements

Given an array of positive integers nums, find the minimum possible sum of two adjacent elements in the array. You must use a two-pointer or sliding window approach, even though a simple loop would suffice, to practice the pattern.

Example:
Input: nums = [10, 4, 2, 7, 5]
Output: 6 (from 4 + 2)

Run this challenge interactively in Python or JavaScript when the app loads.