Medium
Quiz
#611 Valid Triangle Number
APPROACH
Given an integer array nums, count how many triples of elements from the array can serve as side lengths of a valid triangle. Return that count.
Example 1:
Input: nums = [2,2,3,4]
Output: 3
Explanation: Valid combinations are:
2,3,4 (using the first 2)
2,3,4 (using the second 2)
2,2,3
Example 2:
Input: nums = [4,2,3,4]
Output: 4
1 of 4
1:00
What is the optimal approach for this problem?