Lets Code Everyday - Day 18

Question - 18: Find the Triangular Sum of an Array 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 pro...