Counting Triangles - InterviewBit Solution

Problem Description:

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.

Notes:

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.

For example,

A = [1, 1, 1, 2, 2] Return: 4

Solution Approach:

Solution:

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.

Maximum Area of Triangle! InterviewBit Solution

Given a character matrix of size N x M in the form of a string array A of size N where A[i] denotes ith row. Each character in the matrix co

Locking Unlocking of N-ary Tree

Given an n-ary tree of resources arranged hierarchically such that the height of the tree is O(log N) where N is a total number of nodes...

Counting Triangles - InterviewBit Solution

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

3 Sum Zero - InterviewBit Solution

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives

3 Sum - InterviewBit Solution

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target.