Practice Valid Triangle Number
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an integer array nums, return the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.
Source: Valid Triangle Number on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [2,2,3,4]
Output
3
# Example 2
Input
nums = [4,2,3,4]
Output
4
Constraints
1 <= nums.length <= 1000
0 <= nums[i] <= 1000
Related LeetCode Problems
Practice more problems similar to Valid Triangle Number.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.