Count Stable Segments

Count Stable Segments is a Citadel coding interview problem. Given an array of server capacities, count the number of contiguous subsegments of length at least 3 that are “stable,” where both endpoint capacities equal the sum of all interior elements. Return the total count. This interview question focuses on array-based segment evaluation in a practical problem setting.