2221. Find Triangular Sum of an Array

Given a digit array nums, repeatedly replace it with a new array where each element = (nums[i] + nums[i+1]) % 10, until one element remains — the "triangular sum." Return it. Successively collapse…