TomoLink
CompaniesZeptoData Structures & AlgorithmsValid Triangle Number
DSA
MediumArray

Valid Triangle Number

arraytwo pointersbinary search

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 .

Examples

Example 1
Input: nums = [2,2,3,4]
Output: 3
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

Constraints

1 <= nums.length <= 1000
0 <= nums[i] <= 1000
🤔
Medium
Difficulty
Topic Info
ModuleDSA
CategoryArray
Sub-topicTwo Pointers
Tags
arraytwo pointersbinary searchgreedysorting
Navigation
Valid Triangle Number [Medium] | Zepto Dsa | TomoLink