Problem: Counting Triangles
You are given an array of N non-negative integers, A0, A1,…, AN-1. Considering each array element Ai as the edge length of some line segment, count the number of triangles that you can form using these array values.
You can use any value only once while forming each triangle. The order of choosing the edge lengths doesn’t matter. Any triangle formed should have a positive area.
Return answer modulo 109 + 7.
A = [1, 1, 1, 2, 2] Return: 4
Code in C++
If you have any questions or queries, feel free to drop a comment in the comments section below.
Note: Help us improve this blog
If you have a better solution, and you think you can help your peers to understand this problem better, then please drop your solution and approach in the comments section below.
We will upload your approach and solution here by giving you the proper credit so that you can showcase it among your peers.