447. Minimum Sum of Two Neighbors

Given an array of integers nums, find the smallest possible sum of any two adjacent elements. If the array has fewer than two elements, return 0.

Example:
Input: nums = [4, 1, 2, 5]
Output: 3 (since 1 + 2 = 3)

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