Leetcode 1995. Count Special Quadruplets

Count the number of index-ordered quadruplets (a < b < c < d) in an array such that nums[a] + nums[b] + nums[c] == nums[d]. The core challenge is combinatorial counting of index combinations that satisfy a sum equality (array length ≤ 50).