mediumArrayCombinatoricsMathSimulation 0 views
Find 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).
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:
Return the triangular sum of nums.
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.
Constraints
- 1 <= nums.length <= 1000
- 0 <= nums[i] <= 9
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.