You are given a 0-indexed integer array nums, where nums[i] is a digit between 0 and 9 (inclusive).

The triangular sum of nums is the value of the only element present in nums after the following process terminates:


	Let nums comprise of n elements. If n == 1, end the process. Otherwise, create a new 0-indexed integer array newNums of length n - 1.
	For each index i, where 0 &lt;= i &lt;&nbsp;n - 1, assign the value of newNums[i] as (nums[i] + nums[i+1]) % 10, where % denotes modulo operator.
	Replace the array nums with newNums.
	Repeat the entire process starting from step 1.


Return the triangular sum of nums.

&nbsp;
Example 1:

Input: nums = [1,2,3,4,5]
Output: 8
Explanation:
The above diagram depicts the process from which we obtain the triangular sum of the array.

Example 2:

Input: nums = [5]
Output: 5
Explanation:
Since there is only one element in nums, the triangular sum is the value of that element itself.

&nbsp;
Constraints:


	1 &lt;= nums.length &lt;= 1000
	0 &lt;= nums[i] &lt;= 9


class Solution(object):
    def triangularSum(self, nums):
        while len(nums) > 1:
            arr = []
            for i in range(len(nums)-1):
                arr.append((nums[i] + nums[i+1]) % 10)
            nums = arr
        return nums[0]
class Solution {
    public int triangularSum(int[] nums) {
        return find(nums,nums.length);
    }
    
    public int find(int[] a, int n){
        if(n == 1)
            return a[0];
            
        for(int i=0;i<n-1;i++){
            a[i] = (a[i] + a[i+1])%10; 
        }
        return find(a,n-1);
    }
}
class Solution {
public:
    int triangularSum(vector<int>& nums) {
        int n=nums.size();
        for(int i=n-1;i>=1;i--){
            for(int j=0;j<i;j++){
                nums[j]=(nums[j]+nums[j+1])%10;
            }
        }
        return nums[0];
    }
};
var triangularSum = function(nums) {
    while(nums.length > 1){
        let arr = []
        for(let i=0; i<nums.length-1; i++){
            arr.push((nums[i] + nums[i+1]) % 10)
        }
        nums = arr
    }
    return nums[0]
};
Find Triangular Sum of an Array